./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --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 3e08637578a960e5117d483812e56de1a390e4c3bc66da607109cc6e10390727 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:27:40,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:27:40,570 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:27:40,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:27:40,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:27:40,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:27:40,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:27:40,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:27:40,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:27:40,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:27:40,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:27:40,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:27:40,612 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:27:40,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:27:40,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:27:40,614 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:27:40,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:27:40,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:27:40,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:27:40,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:27:40,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:27:40,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:27:40,619 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:27:40,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:27:40,620 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:27:40,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:27:40,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:27:40,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:27:40,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:27:40,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:27:40,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:27:40,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:27:40,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:27:40,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:27:40,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:27:40,626 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:27:40,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:27:40,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:27:40,628 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:27:40,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 3e08637578a960e5117d483812e56de1a390e4c3bc66da607109cc6e10390727 [2023-11-12 02:27:40,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:27:40,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:27:40,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:27:40,988 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:27:40,989 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:27:40,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-12 02:27:44,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:27:44,607 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:27:44,608 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-12 02:27:44,628 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/data/e9a9df9bd/9840d04629aa431b99239d95f31174a5/FLAG0f0ec46a9 [2023-11-12 02:27:44,643 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/data/e9a9df9bd/9840d04629aa431b99239d95f31174a5 [2023-11-12 02:27:44,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:27:44,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:27:44,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:27:44,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:27:44,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:27:44,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:27:44" (1/1) ... [2023-11-12 02:27:44,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fd98cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:44, skipping insertion in model container [2023-11-12 02:27:44,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:27:44" (1/1) ... [2023-11-12 02:27:44,707 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:27:44,919 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-11-12 02:27:45,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:27:45,195 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:27:45,211 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-11-12 02:27:45,301 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:27:45,360 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:27:45,360 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:27:45,369 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:27:45,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45 WrapperNode [2023-11-12 02:27:45,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:27:45,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:27:45,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:27:45,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:27:45,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45" (1/1) ... [2023-11-12 02:27:45,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45" (1/1) ... [2023-11-12 02:27:45,467 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-11-12 02:27:45,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:27:45,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:27:45,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:27:45,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:27:45,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45" (1/1) ... [2023-11-12 02:27:45,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45" (1/1) ... [2023-11-12 02:27:45,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45" (1/1) ... [2023-11-12 02:27:45,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45" (1/1) ... [2023-11-12 02:27:45,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45" (1/1) ... [2023-11-12 02:27:45,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45" (1/1) ... [2023-11-12 02:27:45,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45" (1/1) ... [2023-11-12 02:27:45,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45" (1/1) ... [2023-11-12 02:27:45,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:27:45,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:27:45,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:27:45,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:27:45,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45" (1/1) ... [2023-11-12 02:27:45,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:27:45,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:27:45,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:27:45,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:27:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:27:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:27:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:27:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:27:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:27:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:27:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:27:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:27:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:27:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:27:45,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:27:45,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:27:45,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:27:45,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:27:45,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:27:45,643 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:27:45,803 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:27:45,805 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:27:46,222 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:27:46,366 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:27:46,367 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:27:46,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:27:46 BoogieIcfgContainer [2023-11-12 02:27:46,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:27:46,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:27:46,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:27:46,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:27:46,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:27:44" (1/3) ... [2023-11-12 02:27:46,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1360a21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:27:46, skipping insertion in model container [2023-11-12 02:27:46,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:45" (2/3) ... [2023-11-12 02:27:46,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1360a21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:27:46, skipping insertion in model container [2023-11-12 02:27:46,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:27:46" (3/3) ... [2023-11-12 02:27:46,380 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-12 02:27:46,390 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:27:46,398 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:27:46,398 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 02:27:46,399 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:27:46,476 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:27:46,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 238 flow [2023-11-12 02:27:46,606 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2023-11-12 02:27:46,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:27:46,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-12 02:27:46,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 238 flow [2023-11-12 02:27:46,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2023-11-12 02:27:46,624 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:27:46,643 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2023-11-12 02:27:46,647 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2023-11-12 02:27:46,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2023-11-12 02:27:46,706 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2023-11-12 02:27:46,706 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:27:46,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-12 02:27:46,711 INFO L119 LiptonReduction]: Number of co-enabled transitions 2128 [2023-11-12 02:27:51,561 INFO L134 LiptonReduction]: Checked pairs total: 5487 [2023-11-12 02:27:51,561 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-11-12 02:27:51,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:27:51,599 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4779459, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:27:51,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-12 02:27:51,608 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:27:51,609 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-12 02:27:51,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:27:51,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:27:51,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:51,611 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:27:51,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:51,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1443133493, now seen corresponding path program 1 times [2023-11-12 02:27:51,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:51,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136907922] [2023-11-12 02:27:51,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:27:52,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136907922] [2023-11-12 02:27:52,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136907922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:27:52,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:27:52,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:27:52,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47545507] [2023-11-12 02:27:52,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:27:52,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:27:52,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:52,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:27:52,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:27:52,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 210 [2023-11-12 02:27:52,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:52,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:27:52,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 210 [2023-11-12 02:27:52,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:27:52,717 INFO L124 PetriNetUnfolderBase]: 615/1082 cut-off events. [2023-11-12 02:27:52,717 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:27:52,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 1082 events. 615/1082 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5712 event pairs, 129 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 2042. Up to 703 conditions per place. [2023-11-12 02:27:52,732 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 25 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-11-12 02:27:52,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 133 flow [2023-11-12 02:27:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:27:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:27:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-11-12 02:27:52,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526984126984127 [2023-11-12 02:27:52,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-11-12 02:27:52,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-11-12 02:27:52,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:27:52,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-11-12 02:27:52,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:52,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:52,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:52,780 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 332 transitions. [2023-11-12 02:27:52,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 133 flow [2023-11-12 02:27:52,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-12 02:27:52,792 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-11-12 02:27:52,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-12 02:27:52,800 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-12 02:27:52,800 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-11-12 02:27:52,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:52,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:27:52,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:52,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:27:52,803 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:27:52,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash -231207808, now seen corresponding path program 1 times [2023-11-12 02:27:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:52,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157290700] [2023-11-12 02:27:52,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:52,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:27:54,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:54,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157290700] [2023-11-12 02:27:54,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157290700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:27:54,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:27:54,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:27:54,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499911606] [2023-11-12 02:27:54,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:27:54,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:27:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:54,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:27:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:27:54,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-11-12 02:27:54,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:54,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:27:54,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-11-12 02:27:54,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:27:55,068 INFO L124 PetriNetUnfolderBase]: 1612/2579 cut-off events. [2023-11-12 02:27:55,069 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2023-11-12 02:27:55,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5242 conditions, 2579 events. 1612/2579 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13896 event pairs, 141 based on Foata normal form. 142/2721 useless extension candidates. Maximal degree in co-relation 5232. Up to 1571 conditions per place. [2023-11-12 02:27:55,086 INFO L140 encePairwiseOnDemand]: 199/210 looper letters, 38 selfloop transitions, 11 changer transitions 30/80 dead transitions. [2023-11-12 02:27:55,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 80 transitions, 344 flow [2023-11-12 02:27:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:27:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:27:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions. [2023-11-12 02:27:55,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748299319727891 [2023-11-12 02:27:55,092 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 698 transitions. [2023-11-12 02:27:55,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 698 transitions. [2023-11-12 02:27:55,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:27:55,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 698 transitions. [2023-11-12 02:27:55,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.71428571428571) internal successors, (698), 7 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:55,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:55,103 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:55,103 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 7 states and 698 transitions. [2023-11-12 02:27:55,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 80 transitions, 344 flow [2023-11-12 02:27:55,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 80 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:27:55,106 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 136 flow [2023-11-12 02:27:55,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-11-12 02:27:55,108 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2023-11-12 02:27:55,108 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 136 flow [2023-11-12 02:27:55,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:55,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:27:55,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:55,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:27:55,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:27:55,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:55,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1422482228, now seen corresponding path program 1 times [2023-11-12 02:27:55,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:55,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351222112] [2023-11-12 02:27:55,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:55,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:27:56,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351222112] [2023-11-12 02:27:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351222112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:27:56,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:27:56,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:27:56,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783777412] [2023-11-12 02:27:56,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:27:56,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:27:56,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:56,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:27:56,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:27:56,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-11-12 02:27:56,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:56,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:27:56,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-11-12 02:27:56,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:27:56,770 INFO L124 PetriNetUnfolderBase]: 1369/2138 cut-off events. [2023-11-12 02:27:56,771 INFO L125 PetriNetUnfolderBase]: For 1785/1785 co-relation queries the response was YES. [2023-11-12 02:27:56,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6591 conditions, 2138 events. 1369/2138 cut-off events. For 1785/1785 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10379 event pairs, 313 based on Foata normal form. 120/2256 useless extension candidates. Maximal degree in co-relation 6576. Up to 1085 conditions per place. [2023-11-12 02:27:56,791 INFO L140 encePairwiseOnDemand]: 200/210 looper letters, 38 selfloop transitions, 10 changer transitions 27/76 dead transitions. [2023-11-12 02:27:56,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 465 flow [2023-11-12 02:27:56,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:27:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:27:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 682 transitions. [2023-11-12 02:27:56,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639455782312925 [2023-11-12 02:27:56,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 682 transitions. [2023-11-12 02:27:56,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 682 transitions. [2023-11-12 02:27:56,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:27:56,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 682 transitions. [2023-11-12 02:27:56,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:56,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:56,804 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:56,804 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 136 flow. Second operand 7 states and 682 transitions. [2023-11-12 02:27:56,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 465 flow [2023-11-12 02:27:56,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 76 transitions, 457 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-12 02:27:56,829 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 220 flow [2023-11-12 02:27:56,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-11-12 02:27:56,830 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-11-12 02:27:56,830 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 220 flow [2023-11-12 02:27:56,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:56,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:27:56,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:56,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:27:56,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:27:56,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1280134365, now seen corresponding path program 1 times [2023-11-12 02:27:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:56,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705352348] [2023-11-12 02:27:56,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:56,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:27:57,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:57,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705352348] [2023-11-12 02:27:57,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705352348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:27:57,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:27:57,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:27:57,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386703955] [2023-11-12 02:27:57,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:27:57,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:27:57,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:57,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:27:57,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:27:57,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-11-12 02:27:57,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:57,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:27:57,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-11-12 02:27:57,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:27:58,059 INFO L124 PetriNetUnfolderBase]: 1303/2067 cut-off events. [2023-11-12 02:27:58,060 INFO L125 PetriNetUnfolderBase]: For 3521/3671 co-relation queries the response was YES. [2023-11-12 02:27:58,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 2067 events. 1303/2067 cut-off events. For 3521/3671 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10579 event pairs, 425 based on Foata normal form. 149/2121 useless extension candidates. Maximal degree in co-relation 6861. Up to 1449 conditions per place. [2023-11-12 02:27:58,084 INFO L140 encePairwiseOnDemand]: 205/210 looper letters, 40 selfloop transitions, 4 changer transitions 17/69 dead transitions. [2023-11-12 02:27:58,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 497 flow [2023-11-12 02:27:58,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:27:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:27:58,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2023-11-12 02:27:58,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-12 02:27:58,087 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2023-11-12 02:27:58,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2023-11-12 02:27:58,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:27:58,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2023-11-12 02:27:58,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:58,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:58,095 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:58,095 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 220 flow. Second operand 5 states and 525 transitions. [2023-11-12 02:27:58,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 497 flow [2023-11-12 02:27:58,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 488 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-12 02:27:58,115 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 258 flow [2023-11-12 02:27:58,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-11-12 02:27:58,116 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-11-12 02:27:58,117 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 258 flow [2023-11-12 02:27:58,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:58,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:27:58,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:58,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:27:58,118 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:27:58,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:58,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1029521861, now seen corresponding path program 1 times [2023-11-12 02:27:58,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:58,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483659334] [2023-11-12 02:27:58,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:58,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:27:58,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:58,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483659334] [2023-11-12 02:27:58,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483659334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:27:58,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:27:58,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:27:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226995721] [2023-11-12 02:27:58,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:27:58,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:27:58,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:58,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:27:58,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:27:58,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-11-12 02:27:58,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:58,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:27:58,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-11-12 02:27:58,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:27:59,472 INFO L124 PetriNetUnfolderBase]: 1462/2422 cut-off events. [2023-11-12 02:27:59,473 INFO L125 PetriNetUnfolderBase]: For 4220/4252 co-relation queries the response was YES. [2023-11-12 02:27:59,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8651 conditions, 2422 events. 1462/2422 cut-off events. For 4220/4252 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13165 event pairs, 207 based on Foata normal form. 121/2538 useless extension candidates. Maximal degree in co-relation 8627. Up to 1264 conditions per place. [2023-11-12 02:27:59,509 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 52 selfloop transitions, 13 changer transitions 17/90 dead transitions. [2023-11-12 02:27:59,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 90 transitions, 689 flow [2023-11-12 02:27:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:27:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:27:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 826 transitions. [2023-11-12 02:27:59,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2023-11-12 02:27:59,540 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 826 transitions. [2023-11-12 02:27:59,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 826 transitions. [2023-11-12 02:27:59,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:27:59,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 826 transitions. [2023-11-12 02:27:59,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.25) internal successors, (826), 8 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:59,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:59,553 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:59,553 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 258 flow. Second operand 8 states and 826 transitions. [2023-11-12 02:27:59,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 90 transitions, 689 flow [2023-11-12 02:27:59,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 674 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-12 02:27:59,579 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 367 flow [2023-11-12 02:27:59,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=367, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2023-11-12 02:27:59,583 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2023-11-12 02:27:59,583 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 367 flow [2023-11-12 02:27:59,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:59,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:27:59,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:59,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:27:59,585 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:27:59,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash -383705492, now seen corresponding path program 1 times [2023-11-12 02:27:59,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:59,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407844049] [2023-11-12 02:27:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:28:01,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:01,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407844049] [2023-11-12 02:28:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407844049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:01,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:01,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:28:01,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591550983] [2023-11-12 02:28:01,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:01,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:28:01,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:01,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:28:01,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:28:01,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 210 [2023-11-12 02:28:01,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 367 flow. Second operand has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:01,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:28:01,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 210 [2023-11-12 02:28:01,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:28:02,775 INFO L124 PetriNetUnfolderBase]: 2413/3712 cut-off events. [2023-11-12 02:28:02,775 INFO L125 PetriNetUnfolderBase]: For 9482/9482 co-relation queries the response was YES. [2023-11-12 02:28:02,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15099 conditions, 3712 events. 2413/3712 cut-off events. For 9482/9482 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 19154 event pairs, 414 based on Foata normal form. 56/3768 useless extension candidates. Maximal degree in co-relation 15074. Up to 1936 conditions per place. [2023-11-12 02:28:02,838 INFO L140 encePairwiseOnDemand]: 198/210 looper letters, 81 selfloop transitions, 61 changer transitions 22/164 dead transitions. [2023-11-12 02:28:02,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 164 transitions, 1461 flow [2023-11-12 02:28:02,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 02:28:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-12 02:28:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1197 transitions. [2023-11-12 02:28:02,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43846153846153846 [2023-11-12 02:28:02,847 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1197 transitions. [2023-11-12 02:28:02,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1197 transitions. [2023-11-12 02:28:02,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:28:02,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1197 transitions. [2023-11-12 02:28:02,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.07692307692308) internal successors, (1197), 13 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:02,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 210.0) internal successors, (2940), 14 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:02,861 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 210.0) internal successors, (2940), 14 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:02,862 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 367 flow. Second operand 13 states and 1197 transitions. [2023-11-12 02:28:02,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 164 transitions, 1461 flow [2023-11-12 02:28:02,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 164 transitions, 1432 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-11-12 02:28:02,927 INFO L231 Difference]: Finished difference. Result has 70 places, 95 transitions, 1080 flow [2023-11-12 02:28:02,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1080, PETRI_PLACES=70, PETRI_TRANSITIONS=95} [2023-11-12 02:28:02,930 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2023-11-12 02:28:02,930 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 95 transitions, 1080 flow [2023-11-12 02:28:02,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:02,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:28:02,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:28:02,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:28:02,931 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:28:02,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:02,932 INFO L85 PathProgramCache]: Analyzing trace with hash -822923370, now seen corresponding path program 2 times [2023-11-12 02:28:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:02,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093907771] [2023-11-12 02:28:02,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:02,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:28:03,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:03,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093907771] [2023-11-12 02:28:03,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093907771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:03,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:03,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:28:03,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572780383] [2023-11-12 02:28:03,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:03,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:28:03,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:03,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:28:03,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:28:04,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2023-11-12 02:28:04,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 95 transitions, 1080 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:04,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:28:04,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2023-11-12 02:28:04,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:28:05,096 INFO L124 PetriNetUnfolderBase]: 1759/2881 cut-off events. [2023-11-12 02:28:05,096 INFO L125 PetriNetUnfolderBase]: For 17706/18050 co-relation queries the response was YES. [2023-11-12 02:28:05,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14867 conditions, 2881 events. 1759/2881 cut-off events. For 17706/18050 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16205 event pairs, 251 based on Foata normal form. 374/3186 useless extension candidates. Maximal degree in co-relation 14833. Up to 1377 conditions per place. [2023-11-12 02:28:05,144 INFO L140 encePairwiseOnDemand]: 202/210 looper letters, 77 selfloop transitions, 45 changer transitions 12/159 dead transitions. [2023-11-12 02:28:05,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 159 transitions, 1837 flow [2023-11-12 02:28:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:28:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-12 02:28:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 988 transitions. [2023-11-12 02:28:05,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704761904761905 [2023-11-12 02:28:05,151 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 988 transitions. [2023-11-12 02:28:05,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 988 transitions. [2023-11-12 02:28:05,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:28:05,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 988 transitions. [2023-11-12 02:28:05,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.8) internal successors, (988), 10 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:05,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 210.0) internal successors, (2310), 11 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:05,166 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 210.0) internal successors, (2310), 11 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:05,166 INFO L175 Difference]: Start difference. First operand has 70 places, 95 transitions, 1080 flow. Second operand 10 states and 988 transitions. [2023-11-12 02:28:05,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 159 transitions, 1837 flow [2023-11-12 02:28:05,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 159 transitions, 1748 flow, removed 44 selfloop flow, removed 5 redundant places. [2023-11-12 02:28:05,278 INFO L231 Difference]: Finished difference. Result has 76 places, 106 transitions, 1335 flow [2023-11-12 02:28:05,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1335, PETRI_PLACES=76, PETRI_TRANSITIONS=106} [2023-11-12 02:28:05,281 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2023-11-12 02:28:05,281 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 106 transitions, 1335 flow [2023-11-12 02:28:05,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:05,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:28:05,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:28:05,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:28:05,283 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:28:05,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash -616107612, now seen corresponding path program 1 times [2023-11-12 02:28:05,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:05,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284129033] [2023-11-12 02:28:05,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:05,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:28:05,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:05,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284129033] [2023-11-12 02:28:05,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284129033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:05,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:05,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:28:05,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327586674] [2023-11-12 02:28:05,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:05,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:28:05,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:05,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:28:05,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:28:05,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 210 [2023-11-12 02:28:05,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 106 transitions, 1335 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:05,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:28:05,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 210 [2023-11-12 02:28:05,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:28:05,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][125], [229#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), 95#L806true, Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 81#L828-3true, 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 39#L764true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 128#true, Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 70#P0EXITtrue, Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 253#true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), Black: 243#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0)), P0Thread1of1ForFork2InUse, Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:05,823 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-11-12 02:28:05,827 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:28:05,827 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:28:05,827 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:28:05,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][84], [229#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), 95#L806true, Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 39#L764true, 21#L749true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 128#true, Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), 258#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 5#L832true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), Black: 243#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0)), P0Thread1of1ForFork2InUse, Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:05,849 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-11-12 02:28:05,850 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:28:05,850 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:28:05,850 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:28:05,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([341] L764-->L771: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_109 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_110 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_97 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_96 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= v_~y~0_71 (ite .cse2 v_~y$w_buff0~0_54 (ite .cse3 v_~y$w_buff1~0_47 v_~y~0_72))) (= v_~y$w_buff1_used~0_96 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_97)) (= v_~y$r_buff0_thd2~0_27 (ite .cse4 0 v_~y$r_buff0_thd2~0_28))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][89], [91#L771true, Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 81#L828-3true, 65#L799true, 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 128#true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), 70#P0EXITtrue, Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 253#true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), Black: 243#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0)), P0Thread1of1ForFork2InUse, Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:05,871 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is not cut-off event [2023-11-12 02:28:05,871 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:28:05,871 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:28:05,871 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:28:05,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([341] L764-->L771: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_109 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_110 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_97 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_96 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= v_~y~0_71 (ite .cse2 v_~y$w_buff0~0_54 (ite .cse3 v_~y$w_buff1~0_47 v_~y~0_72))) (= v_~y$w_buff1_used~0_96 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_97)) (= v_~y$r_buff0_thd2~0_27 (ite .cse4 0 v_~y$r_buff0_thd2~0_28))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][56], [91#L771true, Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 65#L799true, 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 21#L749true, 128#true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 258#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 5#L832true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), Black: 243#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0)), P0Thread1of1ForFork2InUse, Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:05,884 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is not cut-off event [2023-11-12 02:28:05,885 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:28:05,885 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:28:05,885 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:28:05,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([437] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_157 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_94 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_90 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_137 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_158 256) 0)) .cse5)) (.cse2 (and .cse5 .cse4))) (and (= v_~y~0_99 (ite .cse0 v_~y$w_buff0~0_94 (ite .cse1 v_~y$w_buff1~0_79 v_~y~0_100))) (= v_~y$w_buff1_used~0_136 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_137)) (= v_~y$w_buff0_used~0_157 (ite .cse0 0 v_~y$w_buff0_used~0_158)) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| 0)) (= v_~y$r_buff0_thd0~0_93 (ite .cse2 0 v_~y$r_buff0_thd0~0_94)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_136 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd0~0_93 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_90) v_~y$r_buff1_thd0~0_89)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_158, ~y$w_buff1~0=v_~y$w_buff1~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_94, ~y~0=v_~y~0_100, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_90, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_137, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, ~y$w_buff1~0=v_~y$w_buff1~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, ~y$w_buff0~0=v_~y$w_buff0~0_94, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_24|, ~y~0=v_~y~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_136} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][87], [Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 65#L799true, 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 39#L764true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 128#true, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 70#P0EXITtrue, Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 253#true, 143#true, 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), P1Thread1of1ForFork0InUse, Black: 243#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0)), P0Thread1of1ForFork2InUse, Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 31#L839true, P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:05,899 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,899 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,899 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,899 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([341] L764-->L771: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_109 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_110 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_97 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_96 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= v_~y~0_71 (ite .cse2 v_~y$w_buff0~0_54 (ite .cse3 v_~y$w_buff1~0_47 v_~y~0_72))) (= v_~y$w_buff1_used~0_96 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_97)) (= v_~y$r_buff0_thd2~0_27 (ite .cse4 0 v_~y$r_buff0_thd2~0_28))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][89], [91#L771true, Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 65#L799true, 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 128#true, Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 70#P0EXITtrue, Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 5#L832true, 253#true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), Black: 243#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0)), P0Thread1of1ForFork2InUse, Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:05,900 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,900 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,900 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,900 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][125], [229#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 95#L806true, Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 39#L764true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 128#true, Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 70#P0EXITtrue, Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 253#true, 5#L832true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), Black: 243#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0)), P0Thread1of1ForFork2InUse, Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:05,901 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,901 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,901 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,901 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([341] L764-->L771: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_109 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_110 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_97 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_96 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= v_~y~0_71 (ite .cse2 v_~y$w_buff0~0_54 (ite .cse3 v_~y$w_buff1~0_47 v_~y~0_72))) (= v_~y$w_buff1_used~0_96 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_97)) (= v_~y$r_buff0_thd2~0_27 (ite .cse4 0 v_~y$r_buff0_thd2~0_28))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][124], [91#L771true, Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 65#L799true, 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 128#true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), 256#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 70#P0EXITtrue, Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 5#L832true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), Black: 243#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0)), P0Thread1of1ForFork2InUse, Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:05,916 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,916 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,917 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,917 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][126], [229#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), 95#L806true, Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 39#L764true, 128#true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), 256#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 70#P0EXITtrue, Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 5#L832true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), Black: 243#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= 2 ~y$w_buff0~0)), P0Thread1of1ForFork2InUse, Black: 245#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:05,917 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,918 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,918 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:05,918 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,043 INFO L124 PetriNetUnfolderBase]: 1172/2003 cut-off events. [2023-11-12 02:28:06,043 INFO L125 PetriNetUnfolderBase]: For 18894/19718 co-relation queries the response was YES. [2023-11-12 02:28:06,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10840 conditions, 2003 events. 1172/2003 cut-off events. For 18894/19718 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 11845 event pairs, 188 based on Foata normal form. 667/2576 useless extension candidates. Maximal degree in co-relation 10803. Up to 1133 conditions per place. [2023-11-12 02:28:06,070 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 138 selfloop transitions, 8 changer transitions 52/228 dead transitions. [2023-11-12 02:28:06,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 228 transitions, 3309 flow [2023-11-12 02:28:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:28:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:28:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2023-11-12 02:28:06,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4990476190476191 [2023-11-12 02:28:06,073 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 524 transitions. [2023-11-12 02:28:06,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 524 transitions. [2023-11-12 02:28:06,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:28:06,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 524 transitions. [2023-11-12 02:28:06,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:06,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:06,079 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:06,079 INFO L175 Difference]: Start difference. First operand has 76 places, 106 transitions, 1335 flow. Second operand 5 states and 524 transitions. [2023-11-12 02:28:06,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 228 transitions, 3309 flow [2023-11-12 02:28:06,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 228 transitions, 3203 flow, removed 47 selfloop flow, removed 4 redundant places. [2023-11-12 02:28:06,127 INFO L231 Difference]: Finished difference. Result has 77 places, 106 transitions, 1281 flow [2023-11-12 02:28:06,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1281, PETRI_PLACES=77, PETRI_TRANSITIONS=106} [2023-11-12 02:28:06,130 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2023-11-12 02:28:06,130 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 106 transitions, 1281 flow [2023-11-12 02:28:06,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:06,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:28:06,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:28:06,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:28:06,131 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:28:06,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:06,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1305403415, now seen corresponding path program 1 times [2023-11-12 02:28:06,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:06,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035452792] [2023-11-12 02:28:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:06,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:28:06,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:06,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035452792] [2023-11-12 02:28:06,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035452792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:06,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:06,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:28:06,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311756592] [2023-11-12 02:28:06,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:06,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:28:06,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:06,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:28:06,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:28:06,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 210 [2023-11-12 02:28:06,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 106 transitions, 1281 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:06,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:28:06,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 210 [2023-11-12 02:28:06,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:28:06,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][124], [Black: 255#(= ~__unbuffered_cnt~0 0), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 256#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 229#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), 95#L806true, Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 81#L828-3true, 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 39#L764true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 128#true, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 70#P0EXITtrue, Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 266#(<= ~__unbuffered_cnt~0 1), 253#true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:06,704 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-11-12 02:28:06,704 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:28:06,704 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:28:06,705 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:28:06,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][123], [Black: 255#(= ~__unbuffered_cnt~0 0), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 256#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 229#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), 95#L806true, Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 271#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 39#L764true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 128#true, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 70#P0EXITtrue, Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 5#L832true, 253#true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:06,707 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,707 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,707 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,707 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][83], [Black: 255#(= ~__unbuffered_cnt~0 0), Black: 256#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 229#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), 95#L806true, Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 39#L764true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 128#true, 21#L749true, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), 258#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 269#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 5#L832true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:06,727 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-11-12 02:28:06,727 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:28:06,727 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:28:06,728 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-12 02:28:06,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([341] L764-->L771: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_109 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_110 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_97 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_96 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= v_~y~0_71 (ite .cse2 v_~y$w_buff0~0_54 (ite .cse3 v_~y$w_buff1~0_47 v_~y~0_72))) (= v_~y$w_buff1_used~0_96 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_97)) (= v_~y$r_buff0_thd2~0_27 (ite .cse4 0 v_~y$r_buff0_thd2~0_28))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][91], [Black: 255#(= ~__unbuffered_cnt~0 0), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 256#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 91#L771true, Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), 81#L828-3true, 65#L799true, 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 128#true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 70#P0EXITtrue, Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 266#(<= ~__unbuffered_cnt~0 1), 253#true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:06,739 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is not cut-off event [2023-11-12 02:28:06,739 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:28:06,739 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:28:06,740 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:28:06,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([341] L764-->L771: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_109 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_110 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_97 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_96 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= v_~y~0_71 (ite .cse2 v_~y$w_buff0~0_54 (ite .cse3 v_~y$w_buff1~0_47 v_~y~0_72))) (= v_~y$w_buff1_used~0_96 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_97)) (= v_~y$r_buff0_thd2~0_27 (ite .cse4 0 v_~y$r_buff0_thd2~0_28))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][121], [Black: 255#(= ~__unbuffered_cnt~0 0), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 256#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 91#L771true, Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 65#L799true, 271#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 128#true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 70#P0EXITtrue, Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 5#L832true, 253#true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:06,740 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,740 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,741 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,741 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([341] L764-->L771: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_109 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_110 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_97 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_96 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= v_~y~0_71 (ite .cse2 v_~y$w_buff0~0_54 (ite .cse3 v_~y$w_buff1~0_47 v_~y~0_72))) (= v_~y$w_buff1_used~0_96 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_97)) (= v_~y$r_buff0_thd2~0_27 (ite .cse4 0 v_~y$r_buff0_thd2~0_28))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][56], [Black: 255#(= ~__unbuffered_cnt~0 0), Black: 256#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 91#L771true, Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 65#L799true, 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 128#true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 21#L749true, Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 258#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 269#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 5#L832true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:06,758 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is not cut-off event [2023-11-12 02:28:06,758 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:28:06,758 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:28:06,758 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-11-12 02:28:06,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([341] L764-->L771: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_109 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_110 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_97 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd2~0_27 256) 0))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_96 256) 0)))) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= v_~y~0_71 (ite .cse2 v_~y$w_buff0~0_54 (ite .cse3 v_~y$w_buff1~0_47 v_~y~0_72))) (= v_~y$w_buff1_used~0_96 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_97)) (= v_~y$r_buff0_thd2~0_27 (ite .cse4 0 v_~y$r_buff0_thd2~0_28))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_27, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][121], [Black: 255#(= ~__unbuffered_cnt~0 0), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 91#L771true, Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 65#L799true, 271#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 128#true, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 256#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), 70#P0EXITtrue, Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 5#L832true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:06,782 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,782 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,782 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,782 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][123], [Black: 255#(= ~__unbuffered_cnt~0 0), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 229#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 136#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 130#(= ~x~0 0), 174#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), 95#L806true, Black: 131#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 271#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 194#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 39#L764true, Black: 146#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 128#true, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 145#(= ~__unbuffered_p2_EAX~0 0), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 256#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), 70#P0EXITtrue, Black: 162#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 166#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 5#L832true, 143#true, P1Thread1of1ForFork0InUse, Black: 241#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0) (= ~y~0 1)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 230#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 239#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (not (= 2 ~y$w_buff1~0))) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= 2 ~y$w_buff0~0)), Black: 237#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y~0 1)), Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1))]) [2023-11-12 02:28:06,783 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,783 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,783 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,783 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-12 02:28:06,874 INFO L124 PetriNetUnfolderBase]: 836/1516 cut-off events. [2023-11-12 02:28:06,875 INFO L125 PetriNetUnfolderBase]: For 16979/18063 co-relation queries the response was YES. [2023-11-12 02:28:06,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8933 conditions, 1516 events. 836/1516 cut-off events. For 16979/18063 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 9213 event pairs, 60 based on Foata normal form. 663/2115 useless extension candidates. Maximal degree in co-relation 8895. Up to 676 conditions per place. [2023-11-12 02:28:06,893 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 152 selfloop transitions, 14 changer transitions 64/260 dead transitions. [2023-11-12 02:28:06,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 260 transitions, 3702 flow [2023-11-12 02:28:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:28:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:28:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions. [2023-11-12 02:28:06,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49863945578231295 [2023-11-12 02:28:06,897 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 733 transitions. [2023-11-12 02:28:06,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 733 transitions. [2023-11-12 02:28:06,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:28:06,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 733 transitions. [2023-11-12 02:28:06,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:06,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:06,904 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:06,904 INFO L175 Difference]: Start difference. First operand has 77 places, 106 transitions, 1281 flow. Second operand 7 states and 733 transitions. [2023-11-12 02:28:06,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 260 transitions, 3702 flow [2023-11-12 02:28:06,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 260 transitions, 3577 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-11-12 02:28:06,942 INFO L231 Difference]: Finished difference. Result has 83 places, 103 transitions, 1231 flow [2023-11-12 02:28:06,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1231, PETRI_PLACES=83, PETRI_TRANSITIONS=103} [2023-11-12 02:28:06,943 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 49 predicate places. [2023-11-12 02:28:06,943 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 103 transitions, 1231 flow [2023-11-12 02:28:06,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:06,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:28:06,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:28:06,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:28:06,944 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:28:06,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1414653930, now seen corresponding path program 1 times [2023-11-12 02:28:06,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:06,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604832922] [2023-11-12 02:28:06,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:28:07,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:07,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604832922] [2023-11-12 02:28:07,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604832922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:07,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:07,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:28:07,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294742491] [2023-11-12 02:28:07,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:07,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:28:07,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:07,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:28:07,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:28:07,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-11-12 02:28:07,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 103 transitions, 1231 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:07,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:28:07,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-11-12 02:28:07,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:28:08,480 INFO L124 PetriNetUnfolderBase]: 1494/2661 cut-off events. [2023-11-12 02:28:08,480 INFO L125 PetriNetUnfolderBase]: For 19715/19832 co-relation queries the response was YES. [2023-11-12 02:28:08,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16541 conditions, 2661 events. 1494/2661 cut-off events. For 19715/19832 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 16583 event pairs, 282 based on Foata normal form. 127/2772 useless extension candidates. Maximal degree in co-relation 16501. Up to 1351 conditions per place. [2023-11-12 02:28:08,505 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 66 selfloop transitions, 11 changer transitions 81/161 dead transitions. [2023-11-12 02:28:08,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 161 transitions, 2098 flow [2023-11-12 02:28:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:28:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:28:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 582 transitions. [2023-11-12 02:28:08,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2023-11-12 02:28:08,509 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 582 transitions. [2023-11-12 02:28:08,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 582 transitions. [2023-11-12 02:28:08,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:28:08,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 582 transitions. [2023-11-12 02:28:08,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:08,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:08,515 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:08,515 INFO L175 Difference]: Start difference. First operand has 83 places, 103 transitions, 1231 flow. Second operand 6 states and 582 transitions. [2023-11-12 02:28:08,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 161 transitions, 2098 flow [2023-11-12 02:28:08,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 161 transitions, 2039 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-11-12 02:28:08,637 INFO L231 Difference]: Finished difference. Result has 90 places, 62 transitions, 682 flow [2023-11-12 02:28:08,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=682, PETRI_PLACES=90, PETRI_TRANSITIONS=62} [2023-11-12 02:28:08,639 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 56 predicate places. [2023-11-12 02:28:08,639 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 62 transitions, 682 flow [2023-11-12 02:28:08,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:08,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:28:08,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:28:08,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:28:08,641 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:28:08,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:08,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1991437266, now seen corresponding path program 1 times [2023-11-12 02:28:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:08,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899638424] [2023-11-12 02:28:08,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:08,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:28:09,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899638424] [2023-11-12 02:28:09,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899638424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:09,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:09,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:28:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055680895] [2023-11-12 02:28:09,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:09,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:28:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:09,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:28:09,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:28:09,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-11-12 02:28:09,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 62 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:09,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:28:09,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-11-12 02:28:09,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:28:10,097 INFO L124 PetriNetUnfolderBase]: 529/1100 cut-off events. [2023-11-12 02:28:10,097 INFO L125 PetriNetUnfolderBase]: For 8050/8096 co-relation queries the response was YES. [2023-11-12 02:28:10,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6768 conditions, 1100 events. 529/1100 cut-off events. For 8050/8096 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6297 event pairs, 56 based on Foata normal form. 56/1152 useless extension candidates. Maximal degree in co-relation 6723. Up to 452 conditions per place. [2023-11-12 02:28:10,108 INFO L140 encePairwiseOnDemand]: 199/210 looper letters, 72 selfloop transitions, 9 changer transitions 68/152 dead transitions. [2023-11-12 02:28:10,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 152 transitions, 1890 flow [2023-11-12 02:28:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:28:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:28:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 674 transitions. [2023-11-12 02:28:10,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45850340136054424 [2023-11-12 02:28:10,112 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 674 transitions. [2023-11-12 02:28:10,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 674 transitions. [2023-11-12 02:28:10,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:28:10,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 674 transitions. [2023-11-12 02:28:10,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:10,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:10,119 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:10,119 INFO L175 Difference]: Start difference. First operand has 90 places, 62 transitions, 682 flow. Second operand 7 states and 674 transitions. [2023-11-12 02:28:10,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 152 transitions, 1890 flow [2023-11-12 02:28:10,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 152 transitions, 1773 flow, removed 56 selfloop flow, removed 7 redundant places. [2023-11-12 02:28:10,153 INFO L231 Difference]: Finished difference. Result has 85 places, 55 transitions, 585 flow [2023-11-12 02:28:10,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=585, PETRI_PLACES=85, PETRI_TRANSITIONS=55} [2023-11-12 02:28:10,154 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2023-11-12 02:28:10,154 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 55 transitions, 585 flow [2023-11-12 02:28:10,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:10,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:28:10,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:28:10,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:28:10,155 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:28:10,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1100098738, now seen corresponding path program 2 times [2023-11-12 02:28:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:10,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710286768] [2023-11-12 02:28:10,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:10,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:28:10,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:10,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710286768] [2023-11-12 02:28:10,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710286768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:10,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:10,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:28:10,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926922674] [2023-11-12 02:28:10,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:10,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:28:10,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:10,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:28:10,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:28:10,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 210 [2023-11-12 02:28:10,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 55 transitions, 585 flow. Second operand has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:10,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:28:10,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 210 [2023-11-12 02:28:10,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:28:10,541 INFO L124 PetriNetUnfolderBase]: 156/373 cut-off events. [2023-11-12 02:28:10,541 INFO L125 PetriNetUnfolderBase]: For 2811/2852 co-relation queries the response was YES. [2023-11-12 02:28:10,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 373 events. 156/373 cut-off events. For 2811/2852 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1882 event pairs, 27 based on Foata normal form. 68/435 useless extension candidates. Maximal degree in co-relation 2068. Up to 117 conditions per place. [2023-11-12 02:28:10,544 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 35 selfloop transitions, 10 changer transitions 36/86 dead transitions. [2023-11-12 02:28:10,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 1073 flow [2023-11-12 02:28:10,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:28:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:28:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 710 transitions. [2023-11-12 02:28:10,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48299319727891155 [2023-11-12 02:28:10,550 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 710 transitions. [2023-11-12 02:28:10,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 710 transitions. [2023-11-12 02:28:10,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:28:10,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 710 transitions. [2023-11-12 02:28:10,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:10,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:10,557 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:10,557 INFO L175 Difference]: Start difference. First operand has 85 places, 55 transitions, 585 flow. Second operand 7 states and 710 transitions. [2023-11-12 02:28:10,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 1073 flow [2023-11-12 02:28:10,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 86 transitions, 895 flow, removed 29 selfloop flow, removed 13 redundant places. [2023-11-12 02:28:10,568 INFO L231 Difference]: Finished difference. Result has 79 places, 35 transitions, 313 flow [2023-11-12 02:28:10,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=313, PETRI_PLACES=79, PETRI_TRANSITIONS=35} [2023-11-12 02:28:10,570 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 45 predicate places. [2023-11-12 02:28:10,570 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 35 transitions, 313 flow [2023-11-12 02:28:10,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:28:10,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:28:10,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:28:10,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:28:10,571 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:28:10,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 508240289, now seen corresponding path program 1 times [2023-11-12 02:28:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420239819] [2023-11-12 02:28:10,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:28:10,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:28:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:28:10,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:28:10,758 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:28:10,759 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-12 02:28:10,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-12 02:28:10,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-12 02:28:10,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-12 02:28:10,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-12 02:28:10,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-12 02:28:10,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:28:10,763 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:28:10,770 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:28:10,771 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:28:10,841 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 02:28:10,846 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:28:10,850 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:28:10,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:28:10 BasicIcfg [2023-11-12 02:28:10,888 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:28:10,889 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:28:10,889 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:28:10,889 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:28:10,890 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:27:46" (3/4) ... [2023-11-12 02:28:10,891 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:28:10,910 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 02:28:10,911 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:28:10,911 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:28:10,999 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:28:10,999 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:28:11,000 INFO L158 Benchmark]: Toolchain (without parser) took 26351.75ms. Allocated memory was 163.6MB in the beginning and 379.6MB in the end (delta: 216.0MB). Free memory was 117.5MB in the beginning and 149.7MB in the end (delta: -32.2MB). Peak memory consumption was 186.3MB. Max. memory is 16.1GB. [2023-11-12 02:28:11,000 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 121.6MB. Free memory was 88.4MB in the beginning and 88.4MB in the end (delta: 30.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:28:11,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 720.55ms. Allocated memory is still 163.6MB. Free memory was 117.5MB in the beginning and 94.1MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 02:28:11,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.59ms. Allocated memory is still 163.6MB. Free memory was 94.1MB in the beginning and 91.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:28:11,001 INFO L158 Benchmark]: Boogie Preprocessor took 81.54ms. Allocated memory is still 163.6MB. Free memory was 91.2MB in the beginning and 89.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:28:11,002 INFO L158 Benchmark]: RCFGBuilder took 817.44ms. Allocated memory is still 163.6MB. Free memory was 89.7MB in the beginning and 112.5MB in the end (delta: -22.8MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2023-11-12 02:28:11,002 INFO L158 Benchmark]: TraceAbstraction took 24516.06ms. Allocated memory was 163.6MB in the beginning and 379.6MB in the end (delta: 216.0MB). Free memory was 111.4MB in the beginning and 159.2MB in the end (delta: -47.8MB). Peak memory consumption was 167.1MB. Max. memory is 16.1GB. [2023-11-12 02:28:11,002 INFO L158 Benchmark]: Witness Printer took 110.33ms. Allocated memory is still 379.6MB. Free memory was 159.2MB in the beginning and 149.7MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-12 02:28:11,005 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 121.6MB. Free memory was 88.4MB in the beginning and 88.4MB in the end (delta: 30.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 720.55ms. Allocated memory is still 163.6MB. Free memory was 117.5MB in the beginning and 94.1MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.59ms. Allocated memory is still 163.6MB. Free memory was 94.1MB in the beginning and 91.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.54ms. Allocated memory is still 163.6MB. Free memory was 91.2MB in the beginning and 89.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 817.44ms. Allocated memory is still 163.6MB. Free memory was 89.7MB in the beginning and 112.5MB in the end (delta: -22.8MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24516.06ms. Allocated memory was 163.6MB in the beginning and 379.6MB in the end (delta: 216.0MB). Free memory was 111.4MB in the beginning and 159.2MB in the end (delta: -47.8MB). Peak memory consumption was 167.1MB. Max. memory is 16.1GB. * Witness Printer took 110.33ms. Allocated memory is still 379.6MB. Free memory was 159.2MB in the beginning and 149.7MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 118 PlacesBefore, 34 PlacesAfterwards, 110 TransitionsBefore, 25 TransitionsAfterwards, 2128 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 5487 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2578, independent: 2398, independent conditional: 0, independent unconditional: 2398, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1196, independent: 1164, independent conditional: 0, independent unconditional: 1164, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2578, independent: 1234, independent conditional: 0, independent unconditional: 1234, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 1196, unknown conditional: 0, unknown unconditional: 1196] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 76, Positive conditional cache size: 0, Positive unconditional cache size: 76, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1196; [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t1197; [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1198; [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 803 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 624 mSDsluCounter, 632 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 518 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1717 IncrementalHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 114 mSDtfsCounter, 1717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1335occurred in iteration=7, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-12 02:28:11,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5caefe2-8e99-468f-a296-be96b089a8de/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE