./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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 ../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.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 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:05:49,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:05:49,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:05:49,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:05:49,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:05:49,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:05:49,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:05:49,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:05:49,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:05:49,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:05:49,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:05:49,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:05:49,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:05:49,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:05:49,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:05:49,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:05:49,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:05:49,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:05:49,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:05:49,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:05:49,607 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:05:49,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:05:49,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:05:49,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:05:49,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:05:49,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:05:49,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:05:49,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:05:49,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:05:49,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:05:49,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:05:49,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:05:49,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:05:49,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:05:49,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:05:49,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:05:49,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:05:49,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:05:49,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:05:49,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:05:49,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:05:49,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:05:49,636 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:05:49,666 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:05:49,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:05:49,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:05:49,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:05:49,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:05:49,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:05:49,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:05:49,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:05:49,669 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:05:49,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:05:49,670 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:05:49,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:05:49,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:05:49,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:05:49,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:05:49,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:05:49,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:05:49,671 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:05:49,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:05:49,672 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:05:49,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:05:49,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:05:49,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:05:49,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:05:49,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:05:49,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:05:49,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:05:49,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:05:49,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:05:49,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:05:49,674 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:05:49,674 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:05:49,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:05:49,674 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.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 -> 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 [2022-07-12 10:05:49,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:05:49,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:05:49,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:05:49,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:05:49,972 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:05:49,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2022-07-12 10:05:50,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4468f820/83692a86b6f7475dacc5be9f64e1c6d8/FLAGd66dbb14d [2022-07-12 10:05:50,485 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:05:50,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2022-07-12 10:05:50,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4468f820/83692a86b6f7475dacc5be9f64e1c6d8/FLAGd66dbb14d [2022-07-12 10:05:50,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4468f820/83692a86b6f7475dacc5be9f64e1c6d8 [2022-07-12 10:05:50,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:05:50,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:05:50,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:05:50,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:05:50,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:05:50,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:05:50" (1/1) ... [2022-07-12 10:05:50,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b754e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:50, skipping insertion in model container [2022-07-12 10:05:50,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:05:50" (1/1) ... [2022-07-12 10:05:50,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:05:50,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:05:50,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i[999,1012] [2022-07-12 10:05:50,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:05:50,993 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:05:51,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i[999,1012] [2022-07-12 10:05:51,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:05:51,087 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:05:51,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:51 WrapperNode [2022-07-12 10:05:51,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:05:51,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:05:51,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:05:51,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:05:51,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:51" (1/1) ... [2022-07-12 10:05:51,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:51" (1/1) ... [2022-07-12 10:05:51,176 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-07-12 10:05:51,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:05:51,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:05:51,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:05:51,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:05:51,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:51" (1/1) ... [2022-07-12 10:05:51,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:51" (1/1) ... [2022-07-12 10:05:51,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:51" (1/1) ... [2022-07-12 10:05:51,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:51" (1/1) ... [2022-07-12 10:05:51,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:51" (1/1) ... [2022-07-12 10:05:51,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:51" (1/1) ... [2022-07-12 10:05:51,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:51" (1/1) ... [2022-07-12 10:05:51,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:05:51,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:05:51,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:05:51,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:05:51,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:51" (1/1) ... [2022-07-12 10:05:51,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:05:51,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:05:51,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 10:05:51,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 10:05:51,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:05:51,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:05:51,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:05:51,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:05:51,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:05:51,341 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:05:51,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:05:51,341 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:05:51,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:05:51,342 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:05:51,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:05:51,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:05:51,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:05:51,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:05:51,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:05:51,344 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:05:51,511 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:05:51,512 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:05:51,970 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:05:52,258 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:05:52,258 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:05:52,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:05:52 BoogieIcfgContainer [2022-07-12 10:05:52,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:05:52,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:05:52,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:05:52,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:05:52,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:05:50" (1/3) ... [2022-07-12 10:05:52,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c296dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:05:52, skipping insertion in model container [2022-07-12 10:05:52,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:51" (2/3) ... [2022-07-12 10:05:52,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c296dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:05:52, skipping insertion in model container [2022-07-12 10:05:52,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:05:52" (3/3) ... [2022-07-12 10:05:52,269 INFO L111 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i [2022-07-12 10:05:52,277 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:05:52,309 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:05:52,310 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:05:52,310 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:05:52,371 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:05:52,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2022-07-12 10:05:52,473 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2022-07-12 10:05:52,474 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:05:52,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-07-12 10:05:52,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2022-07-12 10:05:52,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2022-07-12 10:05:52,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:05:52,506 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a0a3d52, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@470f5d1a [2022-07-12 10:05:52,506 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 10:05:52,527 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2022-07-12 10:05:52,527 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:05:52,527 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:52,528 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:52,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:52,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1958117325, now seen corresponding path program 1 times [2022-07-12 10:05:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:52,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810028575] [2022-07-12 10:05:52,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:52,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:52,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810028575] [2022-07-12 10:05:52,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810028575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:52,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:52,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:05:52,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266454519] [2022-07-12 10:05:52,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:52,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:05:52,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:52,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:05:52,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:05:52,905 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 116 [2022-07-12 10:05:52,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:52,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:52,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 116 [2022-07-12 10:05:52,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:53,034 INFO L129 PetriNetUnfolder]: 37/224 cut-off events. [2022-07-12 10:05:53,034 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-07-12 10:05:53,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 224 events. 37/224 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 697 event pairs, 7 based on Foata normal form. 13/221 useless extension candidates. Maximal degree in co-relation 264. Up to 51 conditions per place. [2022-07-12 10:05:53,039 INFO L132 encePairwiseOnDemand]: 111/116 looper letters, 11 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-07-12 10:05:53,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 113 transitions, 264 flow [2022-07-12 10:05:53,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:05:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:05:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-07-12 10:05:53,058 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9396551724137931 [2022-07-12 10:05:53,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2022-07-12 10:05:53,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2022-07-12 10:05:53,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:53,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2022-07-12 10:05:53,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:53,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:53,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:53,079 INFO L186 Difference]: Start difference. First operand has 121 places, 113 transitions, 235 flow. Second operand 3 states and 327 transitions. [2022-07-12 10:05:53,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 113 transitions, 264 flow [2022-07-12 10:05:53,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 260 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-12 10:05:53,113 INFO L242 Difference]: Finished difference. Result has 118 places, 109 transitions, 228 flow [2022-07-12 10:05:53,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2022-07-12 10:05:53,118 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -3 predicate places. [2022-07-12 10:05:53,119 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 228 flow [2022-07-12 10:05:53,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:53,120 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:53,120 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:53,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:05:53,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:53,122 INFO L85 PathProgramCache]: Analyzing trace with hash -566480303, now seen corresponding path program 1 times [2022-07-12 10:05:53,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:53,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77799044] [2022-07-12 10:05:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:53,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:53,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77799044] [2022-07-12 10:05:53,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77799044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:53,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:53,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:05:53,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669164452] [2022-07-12 10:05:53,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:53,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:05:53,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:05:53,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:05:53,417 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116 [2022-07-12 10:05:53,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:53,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:53,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116 [2022-07-12 10:05:53,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:54,285 INFO L129 PetriNetUnfolder]: 1304/3562 cut-off events. [2022-07-12 10:05:54,286 INFO L130 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-07-12 10:05:54,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5769 conditions, 3562 events. 1304/3562 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 30137 event pairs, 242 based on Foata normal form. 0/3447 useless extension candidates. Maximal degree in co-relation 5713. Up to 924 conditions per place. [2022-07-12 10:05:54,310 INFO L132 encePairwiseOnDemand]: 104/116 looper letters, 29 selfloop transitions, 8 changer transitions 70/182 dead transitions. [2022-07-12 10:05:54,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 182 transitions, 584 flow [2022-07-12 10:05:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:05:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:05:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 899 transitions. [2022-07-12 10:05:54,314 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2022-07-12 10:05:54,314 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 899 transitions. [2022-07-12 10:05:54,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 899 transitions. [2022-07-12 10:05:54,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:54,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 899 transitions. [2022-07-12 10:05:54,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.88888888888889) internal successors, (899), 9 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:54,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:54,322 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:54,322 INFO L186 Difference]: Start difference. First operand has 118 places, 109 transitions, 228 flow. Second operand 9 states and 899 transitions. [2022-07-12 10:05:54,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 182 transitions, 584 flow [2022-07-12 10:05:54,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 182 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:05:54,329 INFO L242 Difference]: Finished difference. Result has 132 places, 102 transitions, 296 flow [2022-07-12 10:05:54,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=132, PETRI_TRANSITIONS=102} [2022-07-12 10:05:54,330 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 11 predicate places. [2022-07-12 10:05:54,330 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 102 transitions, 296 flow [2022-07-12 10:05:54,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:54,330 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:54,331 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:54,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:05:54,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:54,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:54,332 INFO L85 PathProgramCache]: Analyzing trace with hash -180533774, now seen corresponding path program 1 times [2022-07-12 10:05:54,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:54,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860972268] [2022-07-12 10:05:54,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:54,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:54,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:54,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860972268] [2022-07-12 10:05:54,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860972268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:54,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:54,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:54,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278924775] [2022-07-12 10:05:54,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:54,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:54,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:54,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:54,489 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116 [2022-07-12 10:05:54,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 102 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:54,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:54,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116 [2022-07-12 10:05:54,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:55,110 INFO L129 PetriNetUnfolder]: 865/1860 cut-off events. [2022-07-12 10:05:55,111 INFO L130 PetriNetUnfolder]: For 3044/3060 co-relation queries the response was YES. [2022-07-12 10:05:55,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5568 conditions, 1860 events. 865/1860 cut-off events. For 3044/3060 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12147 event pairs, 141 based on Foata normal form. 54/1861 useless extension candidates. Maximal degree in co-relation 5500. Up to 533 conditions per place. [2022-07-12 10:05:55,125 INFO L132 encePairwiseOnDemand]: 107/116 looper letters, 34 selfloop transitions, 6 changer transitions 67/182 dead transitions. [2022-07-12 10:05:55,125 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 182 transitions, 928 flow [2022-07-12 10:05:55,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:05:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:05:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1254 transitions. [2022-07-12 10:05:55,129 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8315649867374005 [2022-07-12 10:05:55,130 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1254 transitions. [2022-07-12 10:05:55,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1254 transitions. [2022-07-12 10:05:55,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:55,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1254 transitions. [2022-07-12 10:05:55,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.46153846153847) internal successors, (1254), 13 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:55,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:55,141 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:55,142 INFO L186 Difference]: Start difference. First operand has 132 places, 102 transitions, 296 flow. Second operand 13 states and 1254 transitions. [2022-07-12 10:05:55,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 182 transitions, 928 flow [2022-07-12 10:05:55,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 182 transitions, 834 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-07-12 10:05:55,164 INFO L242 Difference]: Finished difference. Result has 136 places, 104 transitions, 340 flow [2022-07-12 10:05:55,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=340, PETRI_PLACES=136, PETRI_TRANSITIONS=104} [2022-07-12 10:05:55,166 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 15 predicate places. [2022-07-12 10:05:55,166 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 104 transitions, 340 flow [2022-07-12 10:05:55,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:55,167 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:55,168 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:55,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:05:55,168 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:55,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:55,169 INFO L85 PathProgramCache]: Analyzing trace with hash 122241685, now seen corresponding path program 1 times [2022-07-12 10:05:55,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:55,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583423467] [2022-07-12 10:05:55,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:55,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:55,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:55,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583423467] [2022-07-12 10:05:55,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583423467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:55,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:55,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:05:55,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004026288] [2022-07-12 10:05:55,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:55,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:05:55,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:55,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:05:55,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:05:55,326 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2022-07-12 10:05:55,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 104 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 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) [2022-07-12 10:05:55,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:55,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2022-07-12 10:05:55,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:55,832 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][108], [20#L817true, 69#P1ENTRYtrue, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 8#L763true, 80#L4-1true, 203#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:55,832 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-07-12 10:05:55,832 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-12 10:05:55,832 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-12 10:05:55,832 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-12 10:05:55,877 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][108], [20#L817true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 8#L763true, 203#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 76#L4true, P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, 93#L784true, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:55,877 INFO L384 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-07-12 10:05:55,878 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-12 10:05:55,878 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-12 10:05:55,878 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-12 10:05:55,880 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][141], [20#L817true, 69#P1ENTRYtrue, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, 80#L4-1true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:55,880 INFO L384 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-07-12 10:05:55,880 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-12 10:05:55,880 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-12 10:05:55,880 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-12 10:05:55,924 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][108], [20#L817true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 8#L763true, 80#L4-1true, 203#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, 93#L784true, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:55,924 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-07-12 10:05:55,924 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-07-12 10:05:55,924 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-07-12 10:05:55,924 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-07-12 10:05:55,925 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][141], [20#L817true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 76#L4true, P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, 93#L784true, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:55,925 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-07-12 10:05:55,925 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-07-12 10:05:55,925 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-07-12 10:05:55,925 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-07-12 10:05:55,977 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][141], [20#L817true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 80#L4-1true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, 93#L784true, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:55,977 INFO L384 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-07-12 10:05:55,977 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-07-12 10:05:55,977 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-07-12 10:05:55,977 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-07-12 10:05:55,985 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][116], [60#L3true, 20#L817true, 192#true, 102#L797true, 156#true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:55,985 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-07-12 10:05:55,985 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-12 10:05:55,985 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-12 10:05:55,985 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,009 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][116], [20#L817true, 192#true, 102#L797true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 8#L763true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 76#L4true, P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,009 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,009 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,009 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,009 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,073 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][116], [20#L817true, 192#true, 102#L797true, 156#true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, 76#L4true, Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,073 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,073 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,073 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,073 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,091 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][148], [20#L817true, 102#L797true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 8#L763true, 80#L4-1true, 197#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,091 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,091 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,091 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,091 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,092 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][116], [20#L817true, 192#true, 102#L797true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 8#L763true, 115#L3-1true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,092 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,092 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,092 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,092 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,092 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][116], [20#L817true, 192#true, 102#L797true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 76#L4true, P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,093 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,093 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,093 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,093 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,093 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,100 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][148], [20#L817true, 102#L797true, 156#true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, 80#L4-1true, 197#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,100 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,100 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,100 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,100 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,101 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][116], [20#L817true, 192#true, 102#L797true, 156#true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, 115#L3-1true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,101 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,101 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,101 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,101 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,115 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][148], [20#L817true, 102#L797true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 80#L4-1true, 197#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,115 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,115 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,115 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,115 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,115 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,116 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][116], [20#L817true, 102#L797true, 192#true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 115#L3-1true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,116 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,116 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,116 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,116 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,116 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,132 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([868] L850-->L853: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_3 2) (= v_~__unbuffered_p0_EAX~0_3 0) (= v_~__unbuffered_p2_EBX~0_3 0) (= 2 v_~y~0_5))) 1 0) 0) 0 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~y~0=v_~y~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~y~0=v_~y~0_5} AuxVars[] AssignedVars[~main$tmp_guard1~0][162], [44#L853true, 192#true, 102#L797true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 8#L763true, 26#L810true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,132 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-07-12 10:05:56,132 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-12 10:05:56,132 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-12 10:05:56,132 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-12 10:05:56,132 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][116], [20#L817true, 192#true, 102#L797true, 105#L850true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 8#L763true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,133 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-07-12 10:05:56,133 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-12 10:05:56,133 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-12 10:05:56,133 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-12 10:05:56,136 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][116], [20#L817true, 102#L797true, 192#true, 105#L850true, 156#true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,136 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-07-12 10:05:56,136 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-07-12 10:05:56,136 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-07-12 10:05:56,136 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-07-12 10:05:56,146 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][116], [20#L817true, 192#true, 102#L797true, 105#L850true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,146 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-07-12 10:05:56,146 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-07-12 10:05:56,146 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-07-12 10:05:56,146 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-07-12 10:05:56,146 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-07-12 10:05:56,185 INFO L129 PetriNetUnfolder]: 1931/3927 cut-off events. [2022-07-12 10:05:56,185 INFO L130 PetriNetUnfolder]: For 5261/5815 co-relation queries the response was YES. [2022-07-12 10:05:56,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9695 conditions, 3927 events. 1931/3927 cut-off events. For 5261/5815 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 30278 event pairs, 149 based on Foata normal form. 37/3698 useless extension candidates. Maximal degree in co-relation 9620. Up to 1002 conditions per place. [2022-07-12 10:05:56,217 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 40 selfloop transitions, 7 changer transitions 48/178 dead transitions. [2022-07-12 10:05:56,217 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 178 transitions, 850 flow [2022-07-12 10:05:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:05:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:05:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1011 transitions. [2022-07-12 10:05:56,220 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.871551724137931 [2022-07-12 10:05:56,220 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1011 transitions. [2022-07-12 10:05:56,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1011 transitions. [2022-07-12 10:05:56,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:56,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1011 transitions. [2022-07-12 10:05:56,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.1) internal successors, (1011), 10 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:56,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:56,226 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:56,226 INFO L186 Difference]: Start difference. First operand has 136 places, 104 transitions, 340 flow. Second operand 10 states and 1011 transitions. [2022-07-12 10:05:56,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 178 transitions, 850 flow [2022-07-12 10:05:56,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 178 transitions, 819 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-07-12 10:05:56,239 INFO L242 Difference]: Finished difference. Result has 135 places, 108 transitions, 371 flow [2022-07-12 10:05:56,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=371, PETRI_PLACES=135, PETRI_TRANSITIONS=108} [2022-07-12 10:05:56,240 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 14 predicate places. [2022-07-12 10:05:56,241 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 108 transitions, 371 flow [2022-07-12 10:05:56,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 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) [2022-07-12 10:05:56,241 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:56,241 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:56,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:05:56,242 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:56,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1675924850, now seen corresponding path program 1 times [2022-07-12 10:05:56,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:56,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20809879] [2022-07-12 10:05:56,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:56,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20809879] [2022-07-12 10:05:56,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20809879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:56,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:56,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950669597] [2022-07-12 10:05:56,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:56,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:56,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:56,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:56,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:56,346 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2022-07-12 10:05:56,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 108 transitions, 371 flow. Second operand has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:56,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:56,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2022-07-12 10:05:56,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:56,769 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [30#L843-1true, 20#L817true, 192#true, 102#L797true, Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 195#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 156#true, 231#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 203#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,769 INFO L384 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-07-12 10:05:56,769 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-07-12 10:05:56,769 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-07-12 10:05:56,769 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-07-12 10:05:56,840 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [60#L3true, 20#L817true, 102#L797true, 192#true, Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 195#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 156#true, Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 231#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 203#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,840 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,840 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,840 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,840 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,860 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [20#L817true, 229#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 192#true, 102#L797true, Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 195#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 156#true, Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 203#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 8#L763true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 76#L4true, P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,861 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,861 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,861 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,861 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-12 10:05:56,869 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][146], [20#L817true, 233#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 102#L797true, 192#true, Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 195#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 156#true, Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 203#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, 76#L4true, P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,870 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,870 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,870 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,871 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,890 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [20#L817true, 229#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 102#L797true, Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 195#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 203#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 8#L763true, 80#L4-1true, 197#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,891 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,891 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,891 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,891 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,892 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][146], [20#L817true, 233#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 192#true, 102#L797true, Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 195#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 156#true, Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 203#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 76#L4true, P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,892 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,893 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,893 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,893 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,893 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-12 10:05:56,895 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][146], [20#L817true, 233#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 102#L797true, Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 195#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 156#true, Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 203#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, 80#L4-1true, 197#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,895 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,895 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,896 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,896 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,907 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][146], [20#L817true, 233#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 102#L797true, Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 195#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 156#true, Black: 199#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 203#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 58#L768true, 80#L4-1true, 197#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P2Thread1of1ForFork1InUse, Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(= ~__unbuffered_p2_EAX~0 0)]) [2022-07-12 10:05:56,907 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,907 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,907 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,908 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,908 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:05:56,936 INFO L129 PetriNetUnfolder]: 836/2092 cut-off events. [2022-07-12 10:05:56,936 INFO L130 PetriNetUnfolder]: For 3954/4068 co-relation queries the response was YES. [2022-07-12 10:05:56,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6519 conditions, 2092 events. 836/2092 cut-off events. For 3954/4068 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15911 event pairs, 86 based on Foata normal form. 71/2091 useless extension candidates. Maximal degree in co-relation 6442. Up to 491 conditions per place. [2022-07-12 10:05:56,952 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 47 selfloop transitions, 14 changer transitions 40/184 dead transitions. [2022-07-12 10:05:56,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 184 transitions, 1022 flow [2022-07-12 10:05:56,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:05:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:05:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1113 transitions. [2022-07-12 10:05:56,956 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.872257053291536 [2022-07-12 10:05:56,956 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1113 transitions. [2022-07-12 10:05:56,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1113 transitions. [2022-07-12 10:05:56,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:56,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1113 transitions. [2022-07-12 10:05:56,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.18181818181819) internal successors, (1113), 11 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:56,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:56,962 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:56,963 INFO L186 Difference]: Start difference. First operand has 135 places, 108 transitions, 371 flow. Second operand 11 states and 1113 transitions. [2022-07-12 10:05:56,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 184 transitions, 1022 flow [2022-07-12 10:05:56,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 184 transitions, 976 flow, removed 19 selfloop flow, removed 10 redundant places. [2022-07-12 10:05:56,974 INFO L242 Difference]: Finished difference. Result has 138 places, 118 transitions, 496 flow [2022-07-12 10:05:56,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=496, PETRI_PLACES=138, PETRI_TRANSITIONS=118} [2022-07-12 10:05:56,975 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 17 predicate places. [2022-07-12 10:05:56,976 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 118 transitions, 496 flow [2022-07-12 10:05:56,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:56,976 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:56,977 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:56,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:05:56,977 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:56,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:56,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1179137140, now seen corresponding path program 1 times [2022-07-12 10:05:56,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:56,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132191261] [2022-07-12 10:05:56,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:56,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:57,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:57,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132191261] [2022-07-12 10:05:57,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132191261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:57,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:57,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:57,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558633868] [2022-07-12 10:05:57,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:57,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:57,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:57,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:57,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:57,112 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-07-12 10:05:57,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 118 transitions, 496 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:57,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:57,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-07-12 10:05:57,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:57,578 INFO L129 PetriNetUnfolder]: 339/1842 cut-off events. [2022-07-12 10:05:57,578 INFO L130 PetriNetUnfolder]: For 4037/4243 co-relation queries the response was YES. [2022-07-12 10:05:57,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5439 conditions, 1842 events. 339/1842 cut-off events. For 4037/4243 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17234 event pairs, 36 based on Foata normal form. 30/1782 useless extension candidates. Maximal degree in co-relation 5358. Up to 420 conditions per place. [2022-07-12 10:05:57,597 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 49 selfloop transitions, 18 changer transitions 22/176 dead transitions. [2022-07-12 10:05:57,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 176 transitions, 926 flow [2022-07-12 10:05:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:05:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:05:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1043 transitions. [2022-07-12 10:05:57,600 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.817398119122257 [2022-07-12 10:05:57,600 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1043 transitions. [2022-07-12 10:05:57,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1043 transitions. [2022-07-12 10:05:57,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:57,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1043 transitions. [2022-07-12 10:05:57,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.81818181818181) internal successors, (1043), 11 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:57,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:57,607 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:57,607 INFO L186 Difference]: Start difference. First operand has 138 places, 118 transitions, 496 flow. Second operand 11 states and 1043 transitions. [2022-07-12 10:05:57,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 176 transitions, 926 flow [2022-07-12 10:05:57,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 176 transitions, 886 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-07-12 10:05:57,633 INFO L242 Difference]: Finished difference. Result has 155 places, 127 transitions, 610 flow [2022-07-12 10:05:57,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=610, PETRI_PLACES=155, PETRI_TRANSITIONS=127} [2022-07-12 10:05:57,634 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 34 predicate places. [2022-07-12 10:05:57,634 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 127 transitions, 610 flow [2022-07-12 10:05:57,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:57,635 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:57,635 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:57,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:05:57,635 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:57,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash 117028846, now seen corresponding path program 2 times [2022-07-12 10:05:57,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:57,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957073924] [2022-07-12 10:05:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:57,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:57,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:57,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957073924] [2022-07-12 10:05:57,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957073924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:57,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:57,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943689668] [2022-07-12 10:05:57,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:57,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:57,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:57,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:57,804 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2022-07-12 10:05:57,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 127 transitions, 610 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:57,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:57,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2022-07-12 10:05:57,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:58,226 INFO L129 PetriNetUnfolder]: 383/2269 cut-off events. [2022-07-12 10:05:58,227 INFO L130 PetriNetUnfolder]: For 4905/5081 co-relation queries the response was YES. [2022-07-12 10:05:58,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6345 conditions, 2269 events. 383/2269 cut-off events. For 4905/5081 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 23709 event pairs, 54 based on Foata normal form. 30/2167 useless extension candidates. Maximal degree in co-relation 6255. Up to 381 conditions per place. [2022-07-12 10:05:58,249 INFO L132 encePairwiseOnDemand]: 110/116 looper letters, 37 selfloop transitions, 4 changer transitions 18/160 dead transitions. [2022-07-12 10:05:58,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 160 transitions, 866 flow [2022-07-12 10:05:58,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:05:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:05:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 704 transitions. [2022-07-12 10:05:58,252 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8669950738916257 [2022-07-12 10:05:58,252 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 704 transitions. [2022-07-12 10:05:58,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 704 transitions. [2022-07-12 10:05:58,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:58,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 704 transitions. [2022-07-12 10:05:58,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:58,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:58,256 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:58,256 INFO L186 Difference]: Start difference. First operand has 155 places, 127 transitions, 610 flow. Second operand 7 states and 704 transitions. [2022-07-12 10:05:58,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 160 transitions, 866 flow [2022-07-12 10:05:58,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 160 transitions, 816 flow, removed 25 selfloop flow, removed 6 redundant places. [2022-07-12 10:05:58,279 INFO L242 Difference]: Finished difference. Result has 153 places, 125 transitions, 586 flow [2022-07-12 10:05:58,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=586, PETRI_PLACES=153, PETRI_TRANSITIONS=125} [2022-07-12 10:05:58,280 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 32 predicate places. [2022-07-12 10:05:58,280 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 125 transitions, 586 flow [2022-07-12 10:05:58,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:58,280 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:58,280 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:58,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:05:58,281 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:58,281 INFO L85 PathProgramCache]: Analyzing trace with hash 946352364, now seen corresponding path program 3 times [2022-07-12 10:05:58,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:58,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221011936] [2022-07-12 10:05:58,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:58,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:58,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:58,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221011936] [2022-07-12 10:05:58,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221011936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:58,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:58,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:05:58,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503480973] [2022-07-12 10:05:58,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:58,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:05:58,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:58,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:05:58,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:05:58,412 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2022-07-12 10:05:58,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 125 transitions, 586 flow. Second operand has 8 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:58,413 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:58,413 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2022-07-12 10:05:58,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:59,009 INFO L129 PetriNetUnfolder]: 885/2643 cut-off events. [2022-07-12 10:05:59,010 INFO L130 PetriNetUnfolder]: For 6552/7106 co-relation queries the response was YES. [2022-07-12 10:05:59,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8209 conditions, 2643 events. 885/2643 cut-off events. For 6552/7106 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 24225 event pairs, 88 based on Foata normal form. 91/2652 useless extension candidates. Maximal degree in co-relation 8176. Up to 373 conditions per place. [2022-07-12 10:05:59,036 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 29 selfloop transitions, 14 changer transitions 47/179 dead transitions. [2022-07-12 10:05:59,036 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 179 transitions, 1134 flow [2022-07-12 10:05:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:05:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-12 10:05:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1379 transitions. [2022-07-12 10:05:59,040 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8491379310344828 [2022-07-12 10:05:59,041 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1379 transitions. [2022-07-12 10:05:59,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1379 transitions. [2022-07-12 10:05:59,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:59,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1379 transitions. [2022-07-12 10:05:59,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 98.5) internal successors, (1379), 14 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:59,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:59,049 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:59,049 INFO L186 Difference]: Start difference. First operand has 153 places, 125 transitions, 586 flow. Second operand 14 states and 1379 transitions. [2022-07-12 10:05:59,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 179 transitions, 1134 flow [2022-07-12 10:05:59,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 179 transitions, 1079 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-07-12 10:05:59,072 INFO L242 Difference]: Finished difference. Result has 162 places, 119 transitions, 553 flow [2022-07-12 10:05:59,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=553, PETRI_PLACES=162, PETRI_TRANSITIONS=119} [2022-07-12 10:05:59,075 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 41 predicate places. [2022-07-12 10:05:59,075 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 119 transitions, 553 flow [2022-07-12 10:05:59,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:59,076 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:59,076 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:59,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:05:59,077 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash 783024857, now seen corresponding path program 1 times [2022-07-12 10:05:59,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:59,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905256557] [2022-07-12 10:05:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:59,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:59,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905256557] [2022-07-12 10:05:59,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905256557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:59,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:59,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218435446] [2022-07-12 10:05:59,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:59,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:59,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:59,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:59,266 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116 [2022-07-12 10:05:59,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 119 transitions, 553 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:59,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:59,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116 [2022-07-12 10:05:59,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:59,571 INFO L129 PetriNetUnfolder]: 203/1370 cut-off events. [2022-07-12 10:05:59,571 INFO L130 PetriNetUnfolder]: For 3224/3290 co-relation queries the response was YES. [2022-07-12 10:05:59,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4013 conditions, 1370 events. 203/1370 cut-off events. For 3224/3290 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13966 event pairs, 20 based on Foata normal form. 1/1283 useless extension candidates. Maximal degree in co-relation 3921. Up to 273 conditions per place. [2022-07-12 10:05:59,581 INFO L132 encePairwiseOnDemand]: 107/116 looper letters, 19 selfloop transitions, 5 changer transitions 23/133 dead transitions. [2022-07-12 10:05:59,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 133 transitions, 725 flow [2022-07-12 10:05:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:05:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:05:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 660 transitions. [2022-07-12 10:05:59,583 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.812807881773399 [2022-07-12 10:05:59,583 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 660 transitions. [2022-07-12 10:05:59,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 660 transitions. [2022-07-12 10:05:59,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:59,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 660 transitions. [2022-07-12 10:05:59,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:59,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:59,588 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:59,588 INFO L186 Difference]: Start difference. First operand has 162 places, 119 transitions, 553 flow. Second operand 7 states and 660 transitions. [2022-07-12 10:05:59,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 133 transitions, 725 flow [2022-07-12 10:05:59,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 133 transitions, 599 flow, removed 44 selfloop flow, removed 21 redundant places. [2022-07-12 10:05:59,607 INFO L242 Difference]: Finished difference. Result has 143 places, 108 transitions, 362 flow [2022-07-12 10:05:59,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=143, PETRI_TRANSITIONS=108} [2022-07-12 10:05:59,609 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 22 predicate places. [2022-07-12 10:05:59,609 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 108 transitions, 362 flow [2022-07-12 10:05:59,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:59,609 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:59,610 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:59,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:05:59,610 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:59,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash -718897659, now seen corresponding path program 2 times [2022-07-12 10:05:59,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:59,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996563636] [2022-07-12 10:05:59,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:59,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:59,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:59,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996563636] [2022-07-12 10:05:59,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996563636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:59,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:59,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:05:59,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9309477] [2022-07-12 10:05:59,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:59,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:05:59,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:59,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:05:59,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:05:59,809 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 116 [2022-07-12 10:05:59,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 108 transitions, 362 flow. Second operand has 8 states, 8 states have (on average 88.25) internal successors, (706), 8 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:59,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:59,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 116 [2022-07-12 10:05:59,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:00,028 INFO L129 PetriNetUnfolder]: 60/499 cut-off events. [2022-07-12 10:06:00,029 INFO L130 PetriNetUnfolder]: For 320/347 co-relation queries the response was YES. [2022-07-12 10:06:00,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 499 events. 60/499 cut-off events. For 320/347 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3465 event pairs, 1 based on Foata normal form. 1/469 useless extension candidates. Maximal degree in co-relation 1067. Up to 90 conditions per place. [2022-07-12 10:06:00,032 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 25 selfloop transitions, 11 changer transitions 9/127 dead transitions. [2022-07-12 10:06:00,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 127 transitions, 535 flow [2022-07-12 10:06:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:06:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:06:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 896 transitions. [2022-07-12 10:06:00,035 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7724137931034483 [2022-07-12 10:06:00,035 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 896 transitions. [2022-07-12 10:06:00,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 896 transitions. [2022-07-12 10:06:00,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:00,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 896 transitions. [2022-07-12 10:06:00,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 89.6) internal successors, (896), 10 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:06:00,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:06:00,041 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:06:00,041 INFO L186 Difference]: Start difference. First operand has 143 places, 108 transitions, 362 flow. Second operand 10 states and 896 transitions. [2022-07-12 10:06:00,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 127 transitions, 535 flow [2022-07-12 10:06:00,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 127 transitions, 477 flow, removed 15 selfloop flow, removed 10 redundant places. [2022-07-12 10:06:00,046 INFO L242 Difference]: Finished difference. Result has 144 places, 114 transitions, 398 flow [2022-07-12 10:06:00,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=398, PETRI_PLACES=144, PETRI_TRANSITIONS=114} [2022-07-12 10:06:00,047 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 23 predicate places. [2022-07-12 10:06:00,047 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 114 transitions, 398 flow [2022-07-12 10:06:00,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.25) internal successors, (706), 8 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:06:00,048 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:00,048 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:00,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:06:00,048 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:00,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:00,049 INFO L85 PathProgramCache]: Analyzing trace with hash 733869143, now seen corresponding path program 3 times [2022-07-12 10:06:00,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:00,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580089415] [2022-07-12 10:06:00,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:00,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:06:00,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:00,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580089415] [2022-07-12 10:06:00,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580089415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:00,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:00,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:06:00,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111368379] [2022-07-12 10:06:00,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:00,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:06:00,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:00,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:06:00,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:06:00,247 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 116 [2022-07-12 10:06:00,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 114 transitions, 398 flow. Second operand has 11 states, 11 states have (on average 90.0909090909091) internal successors, (991), 11 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:06:00,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:00,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 116 [2022-07-12 10:06:00,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:00,473 INFO L129 PetriNetUnfolder]: 43/380 cut-off events. [2022-07-12 10:06:00,473 INFO L130 PetriNetUnfolder]: For 237/248 co-relation queries the response was YES. [2022-07-12 10:06:00,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 380 events. 43/380 cut-off events. For 237/248 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2182 event pairs, 1 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 803. Up to 61 conditions per place. [2022-07-12 10:06:00,475 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 22 selfloop transitions, 5 changer transitions 11/123 dead transitions. [2022-07-12 10:06:00,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 123 transitions, 508 flow [2022-07-12 10:06:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:06:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:06:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1001 transitions. [2022-07-12 10:06:00,478 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7844827586206896 [2022-07-12 10:06:00,478 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1001 transitions. [2022-07-12 10:06:00,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1001 transitions. [2022-07-12 10:06:00,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:00,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1001 transitions. [2022-07-12 10:06:00,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.0) internal successors, (1001), 11 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:06:00,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:06:00,483 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:06:00,484 INFO L186 Difference]: Start difference. First operand has 144 places, 114 transitions, 398 flow. Second operand 11 states and 1001 transitions. [2022-07-12 10:06:00,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 123 transitions, 508 flow [2022-07-12 10:06:00,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 123 transitions, 482 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-07-12 10:06:00,488 INFO L242 Difference]: Finished difference. Result has 150 places, 110 transitions, 376 flow [2022-07-12 10:06:00,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=376, PETRI_PLACES=150, PETRI_TRANSITIONS=110} [2022-07-12 10:06:00,488 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 29 predicate places. [2022-07-12 10:06:00,488 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 110 transitions, 376 flow [2022-07-12 10:06:00,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.0909090909091) internal successors, (991), 11 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:06:00,489 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:00,489 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:00,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:06:00,490 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:00,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:00,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1247292693, now seen corresponding path program 4 times [2022-07-12 10:06:00,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:00,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985351358] [2022-07-12 10:06:00,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:00,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:06:00,526 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:06:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:06:00,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:06:00,589 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:06:00,590 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-12 10:06:00,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-12 10:06:00,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-12 10:06:00,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-12 10:06:00,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-12 10:06:00,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 10:06:00,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:06:00,593 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2022-07-12 10:06:00,597 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:06:00,597 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:06:00,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:06:00 BasicIcfg [2022-07-12 10:06:00,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:06:00,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:06:00,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:06:00,709 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:06:00,709 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:05:52" (3/4) ... [2022-07-12 10:06:00,711 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:06:00,802 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:06:00,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:06:00,803 INFO L158 Benchmark]: Toolchain (without parser) took 10268.21ms. Allocated memory was 96.5MB in the beginning and 497.0MB in the end (delta: 400.6MB). Free memory was 58.7MB in the beginning and 101.0MB in the end (delta: -42.3MB). Peak memory consumption was 356.8MB. Max. memory is 16.1GB. [2022-07-12 10:06:00,803 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 96.5MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:06:00,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.07ms. Allocated memory is still 96.5MB. Free memory was 58.5MB in the beginning and 58.9MB in the end (delta: -348.6kB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-07-12 10:06:00,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.54ms. Allocated memory is still 96.5MB. Free memory was 58.9MB in the beginning and 56.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 10:06:00,804 INFO L158 Benchmark]: Boogie Preprocessor took 80.45ms. Allocated memory is still 96.5MB. Free memory was 56.2MB in the beginning and 54.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:06:00,804 INFO L158 Benchmark]: RCFGBuilder took 1001.66ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 54.1MB in the beginning and 57.3MB in the end (delta: -3.1MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2022-07-12 10:06:00,805 INFO L158 Benchmark]: TraceAbstraction took 8444.70ms. Allocated memory was 134.2MB in the beginning and 497.0MB in the end (delta: 362.8MB). Free memory was 56.6MB in the beginning and 133.5MB in the end (delta: -76.9MB). Peak memory consumption was 286.1MB. Max. memory is 16.1GB. [2022-07-12 10:06:00,805 INFO L158 Benchmark]: Witness Printer took 93.94ms. Allocated memory is still 497.0MB. Free memory was 133.5MB in the beginning and 101.0MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-07-12 10:06:00,806 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.64ms. Allocated memory is still 96.5MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.07ms. Allocated memory is still 96.5MB. Free memory was 58.5MB in the beginning and 58.9MB in the end (delta: -348.6kB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.54ms. Allocated memory is still 96.5MB. Free memory was 58.9MB in the beginning and 56.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.45ms. Allocated memory is still 96.5MB. Free memory was 56.2MB in the beginning and 54.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1001.66ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 54.1MB in the beginning and 57.3MB in the end (delta: -3.1MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8444.70ms. Allocated memory was 134.2MB in the beginning and 497.0MB in the end (delta: 362.8MB). Free memory was 56.6MB in the beginning and 133.5MB in the end (delta: -76.9MB). Peak memory consumption was 286.1MB. Max. memory is 16.1GB. * Witness Printer took 93.94ms. Allocated memory is still 497.0MB. Free memory was 133.5MB in the beginning and 101.0MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t666; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t666, ((void *)0), P0, ((void *)0))=-2, t666={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] 0 pthread_t t667; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t666={5:0}, t667={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t667, ((void *)0), P1, ((void *)0))=-1, t666={5:0}, t667={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] 0 pthread_t t668; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t668, ((void *)0), P2, ((void *)0))=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L816] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 835]: 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: 837]: 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: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 143 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 571 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 571 mSDsluCounter, 654 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1046 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1257 IncrementalHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 143 mSDtfsCounter, 1257 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=6, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 878 ConstructedInterpolants, 0 QuantifiedInterpolants, 3749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-12 10:06:00,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- 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