./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 18:37:39,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:37:39,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:37:39,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:37:39,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:37:39,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:37:39,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:37:39,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:37:39,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:37:39,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:37:39,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:37:39,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:37:39,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:37:39,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:37:39,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:37:39,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:37:39,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:37:39,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:37:39,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:37:39,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:37:39,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:37:39,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:37:39,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:37:39,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:37:39,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:37:39,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:37:39,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:37:39,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:37:39,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:37:39,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:37:39,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:37:39,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:37:39,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:37:39,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:37:39,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:37:39,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:37:39,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:37:39,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:37:39,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:37:39,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:37:39,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:37:39,350 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 18:37:39,390 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:37:39,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:37:39,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:37:39,391 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:37:39,392 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:37:39,392 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:37:39,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:37:39,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:37:39,393 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:37:39,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:37:39,394 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:37:39,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:37:39,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:37:39,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:37:39,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:37:39,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:37:39,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:37:39,395 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:37:39,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:37:39,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:37:39,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:37:39,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:37:39,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:37:39,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:37:39,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:37:39,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:37:39,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:37:39,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:37:39,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:37:39,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:37:39,399 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:37:39,399 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:37:39,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:37:39,400 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/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_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 [2022-11-18 18:37:39,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:37:39,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:37:39,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:37:39,723 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:37:39,724 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:37:39,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix055.opt.i [2022-11-18 18:37:39,808 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/data/871238cd1/dd6219957c6f42d6a77aefa71d1bb036/FLAG3d687a541 [2022-11-18 18:37:40,332 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:37:40,333 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/sv-benchmarks/c/pthread-wmm/mix055.opt.i [2022-11-18 18:37:40,346 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/data/871238cd1/dd6219957c6f42d6a77aefa71d1bb036/FLAG3d687a541 [2022-11-18 18:37:40,659 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/data/871238cd1/dd6219957c6f42d6a77aefa71d1bb036 [2022-11-18 18:37:40,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:37:40,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:37:40,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:37:40,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:37:40,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:37:40,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:37:40" (1/1) ... [2022-11-18 18:37:40,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526e5d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:40, skipping insertion in model container [2022-11-18 18:37:40,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:37:40" (1/1) ... [2022-11-18 18:37:40,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:37:40,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:37:40,931 WARN L234 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_3dbb8bb5-ab93-4300-8a47-614d7683d953/sv-benchmarks/c/pthread-wmm/mix055.opt.i[944,957] [2022-11-18 18:37:41,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:37:41,125 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:37:41,137 WARN L234 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_3dbb8bb5-ab93-4300-8a47-614d7683d953/sv-benchmarks/c/pthread-wmm/mix055.opt.i[944,957] [2022-11-18 18:37:41,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:37:41,269 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:37:41,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41 WrapperNode [2022-11-18 18:37:41,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:37:41,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:37:41,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:37:41,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:37:41,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41" (1/1) ... [2022-11-18 18:37:41,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41" (1/1) ... [2022-11-18 18:37:41,348 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-11-18 18:37:41,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:37:41,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:37:41,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:37:41,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:37:41,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41" (1/1) ... [2022-11-18 18:37:41,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41" (1/1) ... [2022-11-18 18:37:41,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41" (1/1) ... [2022-11-18 18:37:41,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41" (1/1) ... [2022-11-18 18:37:41,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41" (1/1) ... [2022-11-18 18:37:41,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41" (1/1) ... [2022-11-18 18:37:41,401 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41" (1/1) ... [2022-11-18 18:37:41,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41" (1/1) ... [2022-11-18 18:37:41,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:37:41,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:37:41,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:37:41,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:37:41,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41" (1/1) ... [2022-11-18 18:37:41,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:37:41,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:37:41,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:37:41,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:37:41,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:37:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 18:37:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:37:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:37:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:37:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 18:37:41,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 18:37:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 18:37:41,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 18:37:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 18:37:41,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 18:37:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 18:37:41,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 18:37:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:37:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 18:37:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:37:41,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:37:41,499 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 18:37:41,693 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:37:41,695 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:37:42,120 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:37:42,326 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:37:42,326 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 18:37:42,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:37:42 BoogieIcfgContainer [2022-11-18 18:37:42,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:37:42,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:37:42,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:37:42,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:37:42,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:37:40" (1/3) ... [2022-11-18 18:37:42,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2721ce7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:37:42, skipping insertion in model container [2022-11-18 18:37:42,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:41" (2/3) ... [2022-11-18 18:37:42,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2721ce7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:37:42, skipping insertion in model container [2022-11-18 18:37:42,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:37:42" (3/3) ... [2022-11-18 18:37:42,339 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2022-11-18 18:37:42,348 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 18:37:42,359 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:37:42,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 18:37:42,360 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 18:37:42,441 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 18:37:42,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-11-18 18:37:42,599 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-11-18 18:37:42,600 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:37:42,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-11-18 18:37:42,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-11-18 18:37:42,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-11-18 18:37:42,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:37:42,636 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6ec9ea7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:37:42,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-18 18:37:42,683 INFO L130 PetriNetUnfolder]: 0/88 cut-off events. [2022-11-18 18:37:42,685 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:37:42,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:42,686 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:42,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:37:42,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:42,695 INFO L85 PathProgramCache]: Analyzing trace with hash 661898298, now seen corresponding path program 1 times [2022-11-18 18:37:42,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:42,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036395627] [2022-11-18 18:37:42,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:42,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:43,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:43,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036395627] [2022-11-18 18:37:43,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036395627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:43,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:43,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45039675] [2022-11-18 18:37:43,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:43,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:43,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:43,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:43,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:43,479 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 133 [2022-11-18 18:37:43,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:43,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:43,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 133 [2022-11-18 18:37:43,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:43,628 INFO L130 PetriNetUnfolder]: 17/271 cut-off events. [2022-11-18 18:37:43,628 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-18 18:37:43,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 271 events. 17/271 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 816 event pairs, 7 based on Foata normal form. 8/267 useless extension candidates. Maximal degree in co-relation 271. Up to 27 conditions per place. [2022-11-18 18:37:43,632 INFO L137 encePairwiseOnDemand]: 128/133 looper letters, 11 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2022-11-18 18:37:43,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 128 transitions, 294 flow [2022-11-18 18:37:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2022-11-18 18:37:43,654 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9398496240601504 [2022-11-18 18:37:43,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2022-11-18 18:37:43,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2022-11-18 18:37:43,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:43,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2022-11-18 18:37:43,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:43,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:43,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:43,686 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 3 states and 375 transitions. [2022-11-18 18:37:43,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 128 transitions, 294 flow [2022-11-18 18:37:43,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 128 transitions, 290 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 18:37:43,698 INFO L231 Difference]: Finished difference. Result has 136 places, 125 transitions, 262 flow [2022-11-18 18:37:43,701 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=136, PETRI_TRANSITIONS=125} [2022-11-18 18:37:43,705 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, -4 predicate places. [2022-11-18 18:37:43,705 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 125 transitions, 262 flow [2022-11-18 18:37:43,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:43,706 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:43,706 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:43,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:37:43,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:37:43,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -884022198, now seen corresponding path program 1 times [2022-11-18 18:37:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:43,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389578990] [2022-11-18 18:37:43,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:43,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:45,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:45,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389578990] [2022-11-18 18:37:45,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389578990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:45,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:45,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 18:37:45,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850269347] [2022-11-18 18:37:45,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:45,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 18:37:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:45,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 18:37:45,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-18 18:37:45,972 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 133 [2022-11-18 18:37:45,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 262 flow. Second operand has 11 states, 11 states have (on average 100.9090909090909) internal successors, (1110), 11 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:45,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:45,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 133 [2022-11-18 18:37:45,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:48,328 INFO L130 PetriNetUnfolder]: 2512/6292 cut-off events. [2022-11-18 18:37:48,328 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2022-11-18 18:37:48,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10235 conditions, 6292 events. 2512/6292 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 56025 event pairs, 186 based on Foata normal form. 0/6142 useless extension candidates. Maximal degree in co-relation 10171. Up to 1522 conditions per place. [2022-11-18 18:37:48,372 INFO L137 encePairwiseOnDemand]: 116/133 looper letters, 50 selfloop transitions, 18 changer transitions 124/274 dead transitions. [2022-11-18 18:37:48,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 274 transitions, 944 flow [2022-11-18 18:37:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 18:37:48,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-18 18:37:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2560 transitions. [2022-11-18 18:37:48,379 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8020050125313283 [2022-11-18 18:37:48,379 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2560 transitions. [2022-11-18 18:37:48,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2560 transitions. [2022-11-18 18:37:48,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:48,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2560 transitions. [2022-11-18 18:37:48,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 106.66666666666667) internal successors, (2560), 24 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:48,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 133.0) internal successors, (3325), 25 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:48,400 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 133.0) internal successors, (3325), 25 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:48,400 INFO L175 Difference]: Start difference. First operand has 136 places, 125 transitions, 262 flow. Second operand 24 states and 2560 transitions. [2022-11-18 18:37:48,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 274 transitions, 944 flow [2022-11-18 18:37:48,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 274 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 18:37:48,413 INFO L231 Difference]: Finished difference. Result has 176 places, 122 transitions, 420 flow [2022-11-18 18:37:48,413 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=420, PETRI_PLACES=176, PETRI_TRANSITIONS=122} [2022-11-18 18:37:48,414 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 36 predicate places. [2022-11-18 18:37:48,414 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 122 transitions, 420 flow [2022-11-18 18:37:48,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.9090909090909) internal successors, (1110), 11 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:48,415 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:48,415 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:48,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:37:48,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:37:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:48,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1804499536, now seen corresponding path program 1 times [2022-11-18 18:37:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:48,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312180911] [2022-11-18 18:37:48,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:49,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:49,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312180911] [2022-11-18 18:37:49,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312180911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:49,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:49,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 18:37:49,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983968361] [2022-11-18 18:37:49,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:49,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 18:37:49,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:49,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 18:37:49,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-18 18:37:49,539 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2022-11-18 18:37:49,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 122 transitions, 420 flow. Second operand has 11 states, 11 states have (on average 109.54545454545455) internal successors, (1205), 11 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:49,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:49,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2022-11-18 18:37:49,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:50,427 INFO L130 PetriNetUnfolder]: 862/2107 cut-off events. [2022-11-18 18:37:50,428 INFO L131 PetriNetUnfolder]: For 12925/13170 co-relation queries the response was YES. [2022-11-18 18:37:50,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9037 conditions, 2107 events. 862/2107 cut-off events. For 12925/13170 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 15464 event pairs, 337 based on Foata normal form. 58/1989 useless extension candidates. Maximal degree in co-relation 8952. Up to 599 conditions per place. [2022-11-18 18:37:50,468 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 27 selfloop transitions, 10 changer transitions 22/156 dead transitions. [2022-11-18 18:37:50,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 156 transitions, 810 flow [2022-11-18 18:37:50,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 18:37:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 18:37:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1462 transitions. [2022-11-18 18:37:50,475 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8455754771544245 [2022-11-18 18:37:50,476 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1462 transitions. [2022-11-18 18:37:50,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1462 transitions. [2022-11-18 18:37:50,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:50,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1462 transitions. [2022-11-18 18:37:50,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.46153846153847) internal successors, (1462), 13 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:50,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 133.0) internal successors, (1862), 14 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:50,487 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 133.0) internal successors, (1862), 14 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:50,487 INFO L175 Difference]: Start difference. First operand has 176 places, 122 transitions, 420 flow. Second operand 13 states and 1462 transitions. [2022-11-18 18:37:50,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 156 transitions, 810 flow [2022-11-18 18:37:50,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 156 transitions, 716 flow, removed 41 selfloop flow, removed 10 redundant places. [2022-11-18 18:37:50,518 INFO L231 Difference]: Finished difference. Result has 156 places, 124 transitions, 443 flow [2022-11-18 18:37:50,519 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=443, PETRI_PLACES=156, PETRI_TRANSITIONS=124} [2022-11-18 18:37:50,521 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 16 predicate places. [2022-11-18 18:37:50,522 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 124 transitions, 443 flow [2022-11-18 18:37:50,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.54545454545455) internal successors, (1205), 11 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:50,523 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:50,523 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:50,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:37:50,524 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:37:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1678441564, now seen corresponding path program 1 times [2022-11-18 18:37:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:50,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147180999] [2022-11-18 18:37:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:50,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:50,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147180999] [2022-11-18 18:37:50,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147180999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:50,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:50,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:37:50,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471598014] [2022-11-18 18:37:50,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:50,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:37:50,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:37:50,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:37:50,864 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 133 [2022-11-18 18:37:50,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 124 transitions, 443 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:50,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:50,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 133 [2022-11-18 18:37:50,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:51,614 INFO L130 PetriNetUnfolder]: 1094/2336 cut-off events. [2022-11-18 18:37:51,614 INFO L131 PetriNetUnfolder]: For 12609/12714 co-relation queries the response was YES. [2022-11-18 18:37:51,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10240 conditions, 2336 events. 1094/2336 cut-off events. For 12609/12714 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15913 event pairs, 232 based on Foata normal form. 57/2321 useless extension candidates. Maximal degree in co-relation 10157. Up to 921 conditions per place. [2022-11-18 18:37:51,656 INFO L137 encePairwiseOnDemand]: 126/133 looper letters, 36 selfloop transitions, 6 changer transitions 52/193 dead transitions. [2022-11-18 18:37:51,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 193 transitions, 1195 flow [2022-11-18 18:37:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:37:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 18:37:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1064 transitions. [2022-11-18 18:37:51,660 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2022-11-18 18:37:51,661 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1064 transitions. [2022-11-18 18:37:51,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1064 transitions. [2022-11-18 18:37:51,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:51,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1064 transitions. [2022-11-18 18:37:51,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.22222222222223) internal successors, (1064), 9 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:51,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:51,672 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:51,673 INFO L175 Difference]: Start difference. First operand has 156 places, 124 transitions, 443 flow. Second operand 9 states and 1064 transitions. [2022-11-18 18:37:51,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 193 transitions, 1195 flow [2022-11-18 18:37:51,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 193 transitions, 1132 flow, removed 11 selfloop flow, removed 8 redundant places. [2022-11-18 18:37:51,708 INFO L231 Difference]: Finished difference. Result has 157 places, 129 transitions, 510 flow [2022-11-18 18:37:51,708 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=510, PETRI_PLACES=157, PETRI_TRANSITIONS=129} [2022-11-18 18:37:51,710 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 17 predicate places. [2022-11-18 18:37:51,710 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 129 transitions, 510 flow [2022-11-18 18:37:51,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:51,711 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:51,711 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:51,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:37:51,711 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:37:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:51,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2005554366, now seen corresponding path program 1 times [2022-11-18 18:37:51,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:51,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607064162] [2022-11-18 18:37:51,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:52,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:52,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607064162] [2022-11-18 18:37:52,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607064162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:52,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:52,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 18:37:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054440912] [2022-11-18 18:37:52,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:52,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 18:37:52,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:52,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 18:37:52,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:37:52,403 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-11-18 18:37:52,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 129 transitions, 510 flow. Second operand has 10 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:52,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:52,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-11-18 18:37:52,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:53,258 INFO L130 PetriNetUnfolder]: 795/1878 cut-off events. [2022-11-18 18:37:53,259 INFO L131 PetriNetUnfolder]: For 13131/13566 co-relation queries the response was YES. [2022-11-18 18:37:53,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8333 conditions, 1878 events. 795/1878 cut-off events. For 13131/13566 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 12674 event pairs, 150 based on Foata normal form. 42/1783 useless extension candidates. Maximal degree in co-relation 8246. Up to 591 conditions per place. [2022-11-18 18:37:53,296 INFO L137 encePairwiseOnDemand]: 123/133 looper letters, 26 selfloop transitions, 11 changer transitions 37/177 dead transitions. [2022-11-18 18:37:53,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 177 transitions, 1038 flow [2022-11-18 18:37:53,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 18:37:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-18 18:37:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1693 transitions. [2022-11-18 18:37:53,302 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8486215538847118 [2022-11-18 18:37:53,302 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1693 transitions. [2022-11-18 18:37:53,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1693 transitions. [2022-11-18 18:37:53,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:53,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1693 transitions. [2022-11-18 18:37:53,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 112.86666666666666) internal successors, (1693), 15 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:53,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 133.0) internal successors, (2128), 16 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:53,315 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 133.0) internal successors, (2128), 16 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:53,316 INFO L175 Difference]: Start difference. First operand has 157 places, 129 transitions, 510 flow. Second operand 15 states and 1693 transitions. [2022-11-18 18:37:53,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 177 transitions, 1038 flow [2022-11-18 18:37:53,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 177 transitions, 972 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-11-18 18:37:53,351 INFO L231 Difference]: Finished difference. Result has 168 places, 132 transitions, 557 flow [2022-11-18 18:37:53,351 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=557, PETRI_PLACES=168, PETRI_TRANSITIONS=132} [2022-11-18 18:37:53,355 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 28 predicate places. [2022-11-18 18:37:53,355 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 132 transitions, 557 flow [2022-11-18 18:37:53,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:53,356 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:53,356 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:53,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 18:37:53,356 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:37:53,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:53,358 INFO L85 PathProgramCache]: Analyzing trace with hash -423694717, now seen corresponding path program 1 times [2022-11-18 18:37:53,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:53,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361866010] [2022-11-18 18:37:53,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:53,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:54,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:54,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361866010] [2022-11-18 18:37:54,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361866010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:54,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:54,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 18:37:54,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506078885] [2022-11-18 18:37:54,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:54,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 18:37:54,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:54,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 18:37:54,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-18 18:37:54,394 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-11-18 18:37:54,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 132 transitions, 557 flow. Second operand has 11 states, 11 states have (on average 110.54545454545455) internal successors, (1216), 11 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:54,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:54,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-11-18 18:37:54,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:54,735 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L854-->L870: Formula: (let ((.cse11 (= (mod v_~z$r_buff1_thd0~0_66 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd0~0_68 256) 0))) (let ((.cse7 (not .cse5)) (.cse3 (and .cse5 (= (mod v_~z$w_buff1_used~0_107 256) 0))) (.cse4 (and .cse5 .cse11)) (.cse12 (= 0 (mod v_~z$w_buff0_used~0_114 256)))) (let ((.cse8 (or .cse3 .cse4 .cse12)) (.cse9 (and (not .cse12) .cse7))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_113 256) 0)) (.cse6 (= (mod v_~z$w_buff1_used~0_106 256) 0)) (.cse1 (ite .cse8 v_~z~0_65 (ite .cse9 v_~z$w_buff0~0_47 v_~z$w_buff1~0_42)))) (and (= v_~z~0_63 (ite .cse0 v_~z$mem_tmp~0_16 .cse1)) (= v_~z$w_buff1_used~0_106 (ite .cse0 v_~z$w_buff1_used~0_107 (ite (or .cse2 .cse3 .cse4) v_~z$w_buff1_used~0_107 0))) (= v_~weak$$choice2~0_30 |v_ULTIMATE.start_main_#t~nondet12#1_17|) (= v_~z$w_buff1~0_42 v_~z$w_buff1~0_41) (= v_~z$r_buff0_thd0~0_67 (ite .cse0 v_~z$r_buff0_thd0~0_68 (ite (or .cse2 (and .cse5 .cse6) .cse4) v_~z$r_buff0_thd0~0_68 (ite (and (not .cse2) .cse7) 0 v_~z$r_buff0_thd0~0_68)))) (= v_~weak$$choice0~0_7 |v_ULTIMATE.start_main_#t~nondet11#1_13|) (= v_~z$mem_tmp~0_16 v_~z~0_65) (= v_~z$w_buff0_used~0_113 (ite .cse0 v_~z$w_buff0_used~0_114 (ite .cse8 v_~z$w_buff0_used~0_114 (ite .cse9 0 v_~z$w_buff0_used~0_114)))) (= (ite .cse0 v_~z$r_buff1_thd0~0_66 (ite (let ((.cse10 (= (mod v_~z$r_buff0_thd0~0_67 256) 0))) (or .cse2 (and .cse10 .cse11) (and .cse10 .cse6))) v_~z$r_buff1_thd0~0_66 0)) v_~z$r_buff1_thd0~0_65) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~x~0_15 2) (= 2 .cse1) (= v_~__unbuffered_p3_EAX~0_14 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_114, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_107, ~z$w_buff1~0=v_~z$w_buff1~0_42, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_68, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_65, ~x~0=v_~x~0_15} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_106, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_65, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet11#1, ~z$r_buff1_thd0~0, ~z~0, ~weak$$choice2~0][128], [Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 276#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 312#true, 91#L870true, Black: 251#(= ~x~0 0), P1Thread1of1ForFork0InUse, Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 119#L752true, P0Thread1of1ForFork2InUse, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 181#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 195#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 48#L812true, 26#L789true, 71#P1ENTRYtrue, Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 288#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 298#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 292#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 294#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 286#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 300#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 284#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 296#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 290#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0))]) [2022-11-18 18:37:54,739 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-18 18:37:54,739 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:54,740 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:54,740 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:55,054 INFO L130 PetriNetUnfolder]: 594/1537 cut-off events. [2022-11-18 18:37:55,055 INFO L131 PetriNetUnfolder]: For 13845/14227 co-relation queries the response was YES. [2022-11-18 18:37:55,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7378 conditions, 1537 events. 594/1537 cut-off events. For 13845/14227 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10314 event pairs, 220 based on Foata normal form. 25/1444 useless extension candidates. Maximal degree in co-relation 7284. Up to 464 conditions per place. [2022-11-18 18:37:55,092 INFO L137 encePairwiseOnDemand]: 124/133 looper letters, 23 selfloop transitions, 9 changer transitions 16/151 dead transitions. [2022-11-18 18:37:55,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 151 transitions, 815 flow [2022-11-18 18:37:55,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 18:37:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-18 18:37:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1348 transitions. [2022-11-18 18:37:55,097 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8446115288220551 [2022-11-18 18:37:55,097 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1348 transitions. [2022-11-18 18:37:55,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1348 transitions. [2022-11-18 18:37:55,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:55,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1348 transitions. [2022-11-18 18:37:55,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 112.33333333333333) internal successors, (1348), 12 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:55,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 133.0) internal successors, (1729), 13 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:55,106 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 133.0) internal successors, (1729), 13 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:55,106 INFO L175 Difference]: Start difference. First operand has 168 places, 132 transitions, 557 flow. Second operand 12 states and 1348 transitions. [2022-11-18 18:37:55,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 151 transitions, 815 flow [2022-11-18 18:37:55,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 151 transitions, 731 flow, removed 34 selfloop flow, removed 15 redundant places. [2022-11-18 18:37:55,136 INFO L231 Difference]: Finished difference. Result has 162 places, 132 transitions, 548 flow [2022-11-18 18:37:55,136 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=548, PETRI_PLACES=162, PETRI_TRANSITIONS=132} [2022-11-18 18:37:55,138 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 22 predicate places. [2022-11-18 18:37:55,139 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 132 transitions, 548 flow [2022-11-18 18:37:55,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 110.54545454545455) internal successors, (1216), 11 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:55,140 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:55,140 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:55,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 18:37:55,140 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:37:55,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1188977014, now seen corresponding path program 1 times [2022-11-18 18:37:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:55,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942680017] [2022-11-18 18:37:55,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:55,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:55,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:55,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942680017] [2022-11-18 18:37:55,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942680017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:55,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:55,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:37:55,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034739673] [2022-11-18 18:37:55,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:55,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:37:55,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:55,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:37:55,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:37:55,432 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2022-11-18 18:37:55,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 132 transitions, 548 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:55,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:55,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2022-11-18 18:37:55,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:56,477 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][171], [88#L809true, Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 312#true, Black: 251#(= ~x~0 0), P1Thread1of1ForFork0InUse, Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, Black: 326#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 81#L792true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 119#L752true, Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 324#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 332#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 320#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 328#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 330#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 352#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 40#L847-1true, Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 135#L772true]) [2022-11-18 18:37:56,477 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-18 18:37:56,477 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-18 18:37:56,477 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-18 18:37:56,477 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-18 18:37:56,614 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][171], [88#L809true, Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 312#true, Black: 251#(= ~x~0 0), P1Thread1of1ForFork0InUse, Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, Black: 326#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 81#L792true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 119#L752true, Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 324#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 332#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 320#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 328#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 330#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 77#L2true, 352#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 135#L772true]) [2022-11-18 18:37:56,614 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-18 18:37:56,614 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-18 18:37:56,614 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-18 18:37:56,614 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-18 18:37:56,803 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][152], [Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 88#L809true, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 312#true, P1Thread1of1ForFork0InUse, Black: 251#(= ~x~0 0), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork1InUse, Black: 326#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 119#L752true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 324#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork3InUse, Black: 332#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 320#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 328#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 330#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 26#L789true, Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 135#L772true, 64#L3true]) [2022-11-18 18:37:56,804 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-18 18:37:56,804 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-18 18:37:56,804 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-18 18:37:56,804 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-18 18:37:56,831 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][197], [88#L809true, Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 312#true, Black: 251#(= ~x~0 0), P1Thread1of1ForFork0InUse, Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, Black: 326#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 81#L792true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 119#L752true, Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 324#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 332#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 320#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 328#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 330#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 135#L772true, 64#L3true]) [2022-11-18 18:37:56,831 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,831 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,832 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,832 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,931 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][152], [Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 88#L809true, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 312#true, 133#L3-1true, P1Thread1of1ForFork0InUse, Black: 251#(= ~x~0 0), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork1InUse, Black: 326#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 119#L752true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 324#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork3InUse, Black: 332#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 320#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 328#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 330#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 26#L789true, Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 135#L772true]) [2022-11-18 18:37:56,931 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,931 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,931 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,932 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,932 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([377] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][197], [Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 88#L809true, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 312#true, P1Thread1of1ForFork0InUse, Black: 251#(= ~x~0 0), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork1InUse, Black: 326#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 81#L792true, P0Thread1of1ForFork2InUse, 119#L752true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 324#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork3InUse, Black: 332#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 320#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 328#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 330#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 135#L772true, 64#L3true]) [2022-11-18 18:37:56,933 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,933 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,933 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,933 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,933 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:56,961 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][197], [88#L809true, Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 312#true, 133#L3-1true, Black: 251#(= ~x~0 0), P1Thread1of1ForFork0InUse, Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, Black: 326#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 81#L792true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 119#L752true, Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 324#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 332#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 320#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 328#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 330#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 135#L772true]) [2022-11-18 18:37:56,961 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-18 18:37:56,961 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 18:37:56,961 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 18:37:56,961 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 18:37:57,041 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([377] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][197], [Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 88#L809true, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 312#true, 133#L3-1true, P1Thread1of1ForFork0InUse, Black: 251#(= ~x~0 0), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork1InUse, Black: 326#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 81#L792true, P0Thread1of1ForFork2InUse, 119#L752true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 324#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork3InUse, Black: 332#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 320#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 328#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 330#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (= ~z$w_buff1_used~0 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 135#L772true]) [2022-11-18 18:37:57,041 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-18 18:37:57,041 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 18:37:57,041 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 18:37:57,041 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 18:37:57,042 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 18:37:57,477 INFO L130 PetriNetUnfolder]: 5608/9813 cut-off events. [2022-11-18 18:37:57,477 INFO L131 PetriNetUnfolder]: For 43918/50953 co-relation queries the response was YES. [2022-11-18 18:37:57,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33623 conditions, 9813 events. 5608/9813 cut-off events. For 43918/50953 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 79253 event pairs, 578 based on Foata normal form. 178/9043 useless extension candidates. Maximal degree in co-relation 33536. Up to 3165 conditions per place. [2022-11-18 18:37:57,628 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 118 selfloop transitions, 20 changer transitions 8/249 dead transitions. [2022-11-18 18:37:57,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 249 transitions, 1661 flow [2022-11-18 18:37:57,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:37:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 18:37:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1164 transitions. [2022-11-18 18:37:57,632 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8751879699248121 [2022-11-18 18:37:57,632 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1164 transitions. [2022-11-18 18:37:57,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1164 transitions. [2022-11-18 18:37:57,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:57,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1164 transitions. [2022-11-18 18:37:57,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.4) internal successors, (1164), 10 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:57,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 133.0) internal successors, (1463), 11 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:57,639 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 133.0) internal successors, (1463), 11 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:57,639 INFO L175 Difference]: Start difference. First operand has 162 places, 132 transitions, 548 flow. Second operand 10 states and 1164 transitions. [2022-11-18 18:37:57,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 249 transitions, 1661 flow [2022-11-18 18:37:57,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 249 transitions, 1594 flow, removed 6 selfloop flow, removed 10 redundant places. [2022-11-18 18:37:57,689 INFO L231 Difference]: Finished difference. Result has 161 places, 150 transitions, 666 flow [2022-11-18 18:37:57,690 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=666, PETRI_PLACES=161, PETRI_TRANSITIONS=150} [2022-11-18 18:37:57,690 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 21 predicate places. [2022-11-18 18:37:57,690 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 150 transitions, 666 flow [2022-11-18 18:37:57,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:57,691 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:57,691 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:57,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 18:37:57,692 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:37:57,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:57,693 INFO L85 PathProgramCache]: Analyzing trace with hash -974363050, now seen corresponding path program 1 times [2022-11-18 18:37:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:57,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270445550] [2022-11-18 18:37:57,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:57,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:58,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:58,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270445550] [2022-11-18 18:37:58,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270445550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:58,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:58,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:37:58,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203286861] [2022-11-18 18:37:58,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:58,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:37:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:58,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:37:58,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:37:58,072 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2022-11-18 18:37:58,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 150 transitions, 666 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:58,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:58,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2022-11-18 18:37:58,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:59,533 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][157], [88#L809true, Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork0InUse, Black: 251#(= ~x~0 0), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork1InUse, Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 119#L752true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork3InUse, Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 26#L789true, Black: 350#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 354#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 348#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 341#true, Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 382#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 135#L772true, 64#L3true]) [2022-11-18 18:37:59,533 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-18 18:37:59,534 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-18 18:37:59,534 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-18 18:37:59,534 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-18 18:37:59,648 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][157], [88#L809true, Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 133#L3-1true, P1Thread1of1ForFork0InUse, Black: 251#(= ~x~0 0), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork1InUse, Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 119#L752true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork3InUse, Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 26#L789true, Black: 350#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 354#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 348#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 341#true, Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 382#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 135#L772true]) [2022-11-18 18:37:59,648 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-18 18:37:59,649 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:59,649 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:59,649 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:59,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][204], [88#L809true, Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork0InUse, Black: 251#(= ~x~0 0), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork1InUse, 81#L792true, Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 119#L752true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork3InUse, Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 350#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 354#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 348#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 386#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 341#true, Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 135#L772true, 64#L3true]) [2022-11-18 18:37:59,650 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-18 18:37:59,650 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:59,650 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:59,650 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 18:37:59,753 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][204], [88#L809true, Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 133#L3-1true, P1Thread1of1ForFork0InUse, Black: 251#(= ~x~0 0), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork1InUse, 81#L792true, Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 119#L752true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork3InUse, Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 350#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 354#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 348#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 341#true, 386#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 135#L772true]) [2022-11-18 18:37:59,754 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-18 18:37:59,754 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 18:37:59,754 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 18:37:59,754 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 18:38:00,220 INFO L130 PetriNetUnfolder]: 5077/9545 cut-off events. [2022-11-18 18:38:00,220 INFO L131 PetriNetUnfolder]: For 48467/55992 co-relation queries the response was YES. [2022-11-18 18:38:00,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39228 conditions, 9545 events. 5077/9545 cut-off events. For 48467/55992 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 83509 event pairs, 235 based on Foata normal form. 554/9415 useless extension candidates. Maximal degree in co-relation 39142. Up to 2747 conditions per place. [2022-11-18 18:38:00,374 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 155 selfloop transitions, 38 changer transitions 11/307 dead transitions. [2022-11-18 18:38:00,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 307 transitions, 2364 flow [2022-11-18 18:38:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 18:38:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 18:38:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1516 transitions. [2022-11-18 18:38:00,379 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8768074031231926 [2022-11-18 18:38:00,380 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1516 transitions. [2022-11-18 18:38:00,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1516 transitions. [2022-11-18 18:38:00,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:38:00,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1516 transitions. [2022-11-18 18:38:00,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.61538461538461) internal successors, (1516), 13 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:00,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 133.0) internal successors, (1862), 14 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:00,393 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 133.0) internal successors, (1862), 14 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:00,393 INFO L175 Difference]: Start difference. First operand has 161 places, 150 transitions, 666 flow. Second operand 13 states and 1516 transitions. [2022-11-18 18:38:00,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 307 transitions, 2364 flow [2022-11-18 18:38:00,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 307 transitions, 2362 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 18:38:00,500 INFO L231 Difference]: Finished difference. Result has 178 places, 170 transitions, 957 flow [2022-11-18 18:38:00,501 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=957, PETRI_PLACES=178, PETRI_TRANSITIONS=170} [2022-11-18 18:38:00,503 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 38 predicate places. [2022-11-18 18:38:00,503 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 170 transitions, 957 flow [2022-11-18 18:38:00,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:00,504 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:38:00,504 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:38:00,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 18:38:00,505 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:38:00,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:38:00,505 INFO L85 PathProgramCache]: Analyzing trace with hash -89397895, now seen corresponding path program 1 times [2022-11-18 18:38:00,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:38:00,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274618220] [2022-11-18 18:38:00,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:38:00,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:38:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:38:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:38:01,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:38:01,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274618220] [2022-11-18 18:38:01,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274618220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:38:01,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:38:01,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:38:01,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499026682] [2022-11-18 18:38:01,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:38:01,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:38:01,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:38:01,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:38:01,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:38:01,443 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 133 [2022-11-18 18:38:01,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 170 transitions, 957 flow. Second operand has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:01,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:38:01,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 133 [2022-11-18 18:38:01,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:38:02,834 INFO L130 PetriNetUnfolder]: 1856/5973 cut-off events. [2022-11-18 18:38:02,834 INFO L131 PetriNetUnfolder]: For 27341/31080 co-relation queries the response was YES. [2022-11-18 18:38:02,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23961 conditions, 5973 events. 1856/5973 cut-off events. For 27341/31080 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 65467 event pairs, 190 based on Foata normal form. 121/5700 useless extension candidates. Maximal degree in co-relation 23858. Up to 1461 conditions per place. [2022-11-18 18:38:02,938 INFO L137 encePairwiseOnDemand]: 124/133 looper letters, 96 selfloop transitions, 22 changer transitions 6/244 dead transitions. [2022-11-18 18:38:02,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 244 transitions, 1925 flow [2022-11-18 18:38:02,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:38:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 18:38:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1083 transitions. [2022-11-18 18:38:02,943 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8142857142857143 [2022-11-18 18:38:02,943 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1083 transitions. [2022-11-18 18:38:02,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1083 transitions. [2022-11-18 18:38:02,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:38:02,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1083 transitions. [2022-11-18 18:38:02,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.3) internal successors, (1083), 10 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:02,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 133.0) internal successors, (1463), 11 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:02,952 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 133.0) internal successors, (1463), 11 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:02,952 INFO L175 Difference]: Start difference. First operand has 178 places, 170 transitions, 957 flow. Second operand 10 states and 1083 transitions. [2022-11-18 18:38:02,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 244 transitions, 1925 flow [2022-11-18 18:38:03,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 244 transitions, 1822 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-11-18 18:38:03,407 INFO L231 Difference]: Finished difference. Result has 191 places, 183 transitions, 1107 flow [2022-11-18 18:38:03,407 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1107, PETRI_PLACES=191, PETRI_TRANSITIONS=183} [2022-11-18 18:38:03,408 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 51 predicate places. [2022-11-18 18:38:03,408 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 183 transitions, 1107 flow [2022-11-18 18:38:03,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:03,409 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:38:03,409 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:38:03,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 18:38:03,409 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:38:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:38:03,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1884632781, now seen corresponding path program 1 times [2022-11-18 18:38:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:38:03,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460326606] [2022-11-18 18:38:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:38:03,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:38:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:38:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:38:03,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:38:03,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460326606] [2022-11-18 18:38:03,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460326606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:38:03,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:38:03,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:38:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176406078] [2022-11-18 18:38:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:38:03,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:38:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:38:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:38:03,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:38:03,711 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2022-11-18 18:38:03,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 183 transitions, 1107 flow. Second operand has 8 states, 8 states have (on average 110.125) internal successors, (881), 8 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:03,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:38:03,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2022-11-18 18:38:03,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:38:06,731 INFO L130 PetriNetUnfolder]: 7776/14453 cut-off events. [2022-11-18 18:38:06,732 INFO L131 PetriNetUnfolder]: For 93612/102855 co-relation queries the response was YES. [2022-11-18 18:38:06,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65620 conditions, 14453 events. 7776/14453 cut-off events. For 93612/102855 co-relation queries the response was YES. Maximal size of possible extension queue 1197. Compared 132616 event pairs, 286 based on Foata normal form. 675/14390 useless extension candidates. Maximal degree in co-relation 65518. Up to 2896 conditions per place. [2022-11-18 18:38:06,845 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 141 selfloop transitions, 54 changer transitions 51/351 dead transitions. [2022-11-18 18:38:06,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 351 transitions, 3221 flow [2022-11-18 18:38:06,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:38:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 18:38:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1867 transitions. [2022-11-18 18:38:06,849 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8773496240601504 [2022-11-18 18:38:06,849 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1867 transitions. [2022-11-18 18:38:06,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1867 transitions. [2022-11-18 18:38:06,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:38:06,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1867 transitions. [2022-11-18 18:38:06,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 116.6875) internal successors, (1867), 16 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:06,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 133.0) internal successors, (2261), 17 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:06,858 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 133.0) internal successors, (2261), 17 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:06,858 INFO L175 Difference]: Start difference. First operand has 191 places, 183 transitions, 1107 flow. Second operand 16 states and 1867 transitions. [2022-11-18 18:38:06,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 351 transitions, 3221 flow [2022-11-18 18:38:07,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 351 transitions, 3171 flow, removed 25 selfloop flow, removed 0 redundant places. [2022-11-18 18:38:07,706 INFO L231 Difference]: Finished difference. Result has 210 places, 197 transitions, 1374 flow [2022-11-18 18:38:07,707 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1374, PETRI_PLACES=210, PETRI_TRANSITIONS=197} [2022-11-18 18:38:07,707 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 70 predicate places. [2022-11-18 18:38:07,708 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 197 transitions, 1374 flow [2022-11-18 18:38:07,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.125) internal successors, (881), 8 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:07,709 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:38:07,709 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:38:07,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 18:38:07,709 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:38:07,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:38:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1952326163, now seen corresponding path program 1 times [2022-11-18 18:38:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:38:07,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146585509] [2022-11-18 18:38:07,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:38:07,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:38:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:38:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:38:08,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:38:08,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146585509] [2022-11-18 18:38:08,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146585509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:38:08,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:38:08,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:38:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433481018] [2022-11-18 18:38:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:38:08,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:38:08,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:38:08,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:38:08,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:38:08,523 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 133 [2022-11-18 18:38:08,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 197 transitions, 1374 flow. Second operand has 8 states, 8 states have (on average 100.625) internal successors, (805), 8 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:08,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:38:08,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 133 [2022-11-18 18:38:08,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:38:10,694 INFO L130 PetriNetUnfolder]: 3144/10297 cut-off events. [2022-11-18 18:38:10,694 INFO L131 PetriNetUnfolder]: For 55650/58271 co-relation queries the response was YES. [2022-11-18 18:38:10,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40686 conditions, 10297 events. 3144/10297 cut-off events. For 55650/58271 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 130015 event pairs, 54 based on Foata normal form. 13/9652 useless extension candidates. Maximal degree in co-relation 40567. Up to 2405 conditions per place. [2022-11-18 18:38:10,808 INFO L137 encePairwiseOnDemand]: 119/133 looper letters, 95 selfloop transitions, 31 changer transitions 28/294 dead transitions. [2022-11-18 18:38:10,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 294 transitions, 2611 flow [2022-11-18 18:38:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:38:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 18:38:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 973 transitions. [2022-11-18 18:38:10,811 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8128654970760234 [2022-11-18 18:38:10,811 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 973 transitions. [2022-11-18 18:38:10,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 973 transitions. [2022-11-18 18:38:10,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:38:10,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 973 transitions. [2022-11-18 18:38:10,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.11111111111111) internal successors, (973), 9 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:10,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:10,817 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:10,817 INFO L175 Difference]: Start difference. First operand has 210 places, 197 transitions, 1374 flow. Second operand 9 states and 973 transitions. [2022-11-18 18:38:10,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 294 transitions, 2611 flow [2022-11-18 18:38:12,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 294 transitions, 2230 flow, removed 148 selfloop flow, removed 17 redundant places. [2022-11-18 18:38:12,992 INFO L231 Difference]: Finished difference. Result has 201 places, 216 transitions, 1358 flow [2022-11-18 18:38:12,992 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1358, PETRI_PLACES=201, PETRI_TRANSITIONS=216} [2022-11-18 18:38:12,993 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 61 predicate places. [2022-11-18 18:38:12,993 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 216 transitions, 1358 flow [2022-11-18 18:38:12,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.625) internal successors, (805), 8 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:12,993 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:38:12,994 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:38:12,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 18:38:12,994 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:38:12,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:38:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2067351677, now seen corresponding path program 2 times [2022-11-18 18:38:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:38:12,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303943618] [2022-11-18 18:38:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:38:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:38:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:38:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:38:13,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:38:13,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303943618] [2022-11-18 18:38:13,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303943618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:38:13,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:38:13,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 18:38:13,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596194899] [2022-11-18 18:38:13,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:38:13,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 18:38:13,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:38:13,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 18:38:13,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:38:13,275 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2022-11-18 18:38:13,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 216 transitions, 1358 flow. Second operand has 9 states, 9 states have (on average 110.0) internal successors, (990), 9 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:13,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:38:13,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2022-11-18 18:38:13,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:38:13,984 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L809-->L812: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~a~0=v_~a~0_2} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][152], [Black: 368#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 382#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 386#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 47#L767true, Black: 364#true, P1Thread1of1ForFork0InUse, Black: 251#(= ~x~0 0), Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork1InUse, Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork3InUse, 21#L749true, 48#L812true, Black: 397#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 396#(= ~x~0 1), 132#L843-3true, 26#L789true, 394#true, Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 450#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 425#true, Black: 430#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 454#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 348#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 495#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 477#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 1)), Black: 462#(= ~a~0 1), Black: 475#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 1)), Black: 469#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 473#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1)), Black: 354#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 341#true, Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 471#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1))]) [2022-11-18 18:38:13,984 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-18 18:38:13,984 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-18 18:38:13,984 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-18 18:38:13,985 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-18 18:38:14,098 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([370] L749-->L752: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][70], [Black: 368#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 382#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 386#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 88#L809true, Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 450#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 47#L767true, Black: 425#true, Black: 364#true, Black: 430#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, Black: 454#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 251#(= ~x~0 0), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 348#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork1InUse, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 119#L752true, Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork3InUse, Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 495#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 469#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 477#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 1)), Black: 462#(= ~a~0 1), Black: 475#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 1)), Black: 471#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), Black: 397#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 132#L843-3true, 26#L789true, Black: 473#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1)), Black: 354#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 341#true, Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 396#(= ~x~0 1), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0))]) [2022-11-18 18:38:14,099 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-11-18 18:38:14,099 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-18 18:38:14,099 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-18 18:38:14,100 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-18 18:38:14,504 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L809-->L812: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~a~0=v_~a~0_2} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][152], [Black: 368#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 382#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 386#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 364#true, 47#L767true, P1Thread1of1ForFork0InUse, Black: 251#(= ~x~0 0), Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork1InUse, Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork3InUse, 21#L749true, 48#L812true, Black: 397#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 396#(= ~x~0 1), 26#L789true, 394#true, Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 450#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 425#true, Black: 430#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 454#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 348#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 495#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L846true, Black: 477#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 1)), Black: 462#(= ~a~0 1), Black: 475#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 1)), Black: 469#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 473#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1)), Black: 354#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 341#true, Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), 471#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1))]) [2022-11-18 18:38:14,504 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-11-18 18:38:14,505 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-18 18:38:14,505 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-18 18:38:14,505 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-18 18:38:14,876 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([370] L749-->L752: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][70], [Black: 368#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 382#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 386#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 88#L809true, Black: 157#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 450#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 425#true, Black: 364#true, 47#L767true, Black: 430#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, Black: 454#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 251#(= ~x~0 0), Black: 262#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 348#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, 119#L752true, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 256#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 317#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, Black: 258#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 179#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 165#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 495#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 163#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L846true, 469#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 477#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 1)), Black: 462#(= ~a~0 1), Black: 475#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p3_EAX~0 1)), Black: 471#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), Black: 397#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 26#L789true, Black: 473#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1)), Black: 354#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 341#true, Black: 278#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 396#(= ~x~0 1), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 228#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0))]) [2022-11-18 18:38:14,876 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is not cut-off event [2022-11-18 18:38:14,876 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-18 18:38:14,876 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-18 18:38:14,877 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-18 18:38:18,718 INFO L130 PetriNetUnfolder]: 12955/26385 cut-off events. [2022-11-18 18:38:18,718 INFO L131 PetriNetUnfolder]: For 151879/165919 co-relation queries the response was YES. [2022-11-18 18:38:18,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109928 conditions, 26385 events. 12955/26385 cut-off events. For 151879/165919 co-relation queries the response was YES. Maximal size of possible extension queue 2077. Compared 284196 event pairs, 355 based on Foata normal form. 1335/26762 useless extension candidates. Maximal degree in co-relation 109881. Up to 5322 conditions per place. [2022-11-18 18:38:18,959 INFO L137 encePairwiseOnDemand]: 122/133 looper letters, 83 selfloop transitions, 55 changer transitions 188/422 dead transitions. [2022-11-18 18:38:18,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 422 transitions, 4307 flow [2022-11-18 18:38:18,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 18:38:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-18 18:38:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2182 transitions. [2022-11-18 18:38:18,964 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8634744756628413 [2022-11-18 18:38:18,964 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2182 transitions. [2022-11-18 18:38:18,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2182 transitions. [2022-11-18 18:38:18,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:38:18,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2182 transitions. [2022-11-18 18:38:18,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 114.84210526315789) internal successors, (2182), 19 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:18,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 133.0) internal successors, (2660), 20 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:18,974 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 133.0) internal successors, (2660), 20 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:18,975 INFO L175 Difference]: Start difference. First operand has 201 places, 216 transitions, 1358 flow. Second operand 19 states and 2182 transitions. [2022-11-18 18:38:18,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 422 transitions, 4307 flow [2022-11-18 18:38:21,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 422 transitions, 3968 flow, removed 142 selfloop flow, removed 10 redundant places. [2022-11-18 18:38:21,522 INFO L231 Difference]: Finished difference. Result has 213 places, 180 transitions, 1034 flow [2022-11-18 18:38:21,523 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1034, PETRI_PLACES=213, PETRI_TRANSITIONS=180} [2022-11-18 18:38:21,523 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 73 predicate places. [2022-11-18 18:38:21,524 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 180 transitions, 1034 flow [2022-11-18 18:38:21,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.0) internal successors, (990), 9 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:21,524 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:38:21,524 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:38:21,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 18:38:21,525 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:38:21,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:38:21,525 INFO L85 PathProgramCache]: Analyzing trace with hash 582047865, now seen corresponding path program 1 times [2022-11-18 18:38:21,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:38:21,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135135252] [2022-11-18 18:38:21,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:38:21,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:38:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:38:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:38:22,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:38:22,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135135252] [2022-11-18 18:38:22,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135135252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:38:22,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:38:22,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:38:22,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137713059] [2022-11-18 18:38:22,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:38:22,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:38:22,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:38:22,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:38:22,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:38:22,322 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 133 [2022-11-18 18:38:22,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 180 transitions, 1034 flow. Second operand has 8 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:22,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:38:22,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 133 [2022-11-18 18:38:22,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:38:23,135 INFO L130 PetriNetUnfolder]: 1098/3953 cut-off events. [2022-11-18 18:38:23,135 INFO L131 PetriNetUnfolder]: For 9420/9660 co-relation queries the response was YES. [2022-11-18 18:38:23,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12764 conditions, 3953 events. 1098/3953 cut-off events. For 9420/9660 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 45081 event pairs, 11 based on Foata normal form. 1/3733 useless extension candidates. Maximal degree in co-relation 12701. Up to 387 conditions per place. [2022-11-18 18:38:23,155 INFO L137 encePairwiseOnDemand]: 121/133 looper letters, 43 selfloop transitions, 12 changer transitions 21/209 dead transitions. [2022-11-18 18:38:23,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 209 transitions, 1403 flow [2022-11-18 18:38:23,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:38:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 18:38:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 932 transitions. [2022-11-18 18:38:23,157 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7786131996658312 [2022-11-18 18:38:23,158 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 932 transitions. [2022-11-18 18:38:23,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 932 transitions. [2022-11-18 18:38:23,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:38:23,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 932 transitions. [2022-11-18 18:38:23,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.55555555555556) internal successors, (932), 9 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:23,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:23,162 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:23,162 INFO L175 Difference]: Start difference. First operand has 213 places, 180 transitions, 1034 flow. Second operand 9 states and 932 transitions. [2022-11-18 18:38:23,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 209 transitions, 1403 flow [2022-11-18 18:38:23,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 209 transitions, 1152 flow, removed 49 selfloop flow, removed 28 redundant places. [2022-11-18 18:38:23,291 INFO L231 Difference]: Finished difference. Result has 194 places, 177 transitions, 871 flow [2022-11-18 18:38:23,291 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=871, PETRI_PLACES=194, PETRI_TRANSITIONS=177} [2022-11-18 18:38:23,292 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 54 predicate places. [2022-11-18 18:38:23,292 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 177 transitions, 871 flow [2022-11-18 18:38:23,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:23,292 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:38:23,292 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:38:23,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 18:38:23,293 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:38:23,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:38:23,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1313760069, now seen corresponding path program 2 times [2022-11-18 18:38:23,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:38:23,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073689160] [2022-11-18 18:38:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:38:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:38:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:38:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:38:24,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:38:24,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073689160] [2022-11-18 18:38:24,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073689160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:38:24,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:38:24,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 18:38:24,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141499345] [2022-11-18 18:38:24,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:38:24,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 18:38:24,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:38:24,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 18:38:24,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-18 18:38:24,778 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 133 [2022-11-18 18:38:24,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 177 transitions, 871 flow. Second operand has 12 states, 12 states have (on average 100.5) internal successors, (1206), 12 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:24,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:38:24,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 133 [2022-11-18 18:38:24,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:38:25,667 INFO L130 PetriNetUnfolder]: 1354/5017 cut-off events. [2022-11-18 18:38:25,667 INFO L131 PetriNetUnfolder]: For 8044/8119 co-relation queries the response was YES. [2022-11-18 18:38:25,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13973 conditions, 5017 events. 1354/5017 cut-off events. For 8044/8119 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 60605 event pairs, 11 based on Foata normal form. 1/4744 useless extension candidates. Maximal degree in co-relation 13938. Up to 498 conditions per place. [2022-11-18 18:38:25,695 INFO L137 encePairwiseOnDemand]: 119/133 looper letters, 32 selfloop transitions, 19 changer transitions 9/195 dead transitions. [2022-11-18 18:38:25,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 195 transitions, 1114 flow [2022-11-18 18:38:25,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 18:38:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-18 18:38:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1223 transitions. [2022-11-18 18:38:25,697 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7662907268170426 [2022-11-18 18:38:25,698 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1223 transitions. [2022-11-18 18:38:25,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1223 transitions. [2022-11-18 18:38:25,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:38:25,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1223 transitions. [2022-11-18 18:38:25,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 101.91666666666667) internal successors, (1223), 12 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:25,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 133.0) internal successors, (1729), 13 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:25,704 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 133.0) internal successors, (1729), 13 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:25,704 INFO L175 Difference]: Start difference. First operand has 194 places, 177 transitions, 871 flow. Second operand 12 states and 1223 transitions. [2022-11-18 18:38:25,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 195 transitions, 1114 flow [2022-11-18 18:38:25,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 195 transitions, 1087 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-11-18 18:38:25,886 INFO L231 Difference]: Finished difference. Result has 200 places, 182 transitions, 969 flow [2022-11-18 18:38:25,886 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=969, PETRI_PLACES=200, PETRI_TRANSITIONS=182} [2022-11-18 18:38:25,887 INFO L288 CegarLoopForPetriNet]: 140 programPoint places, 60 predicate places. [2022-11-18 18:38:25,887 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 182 transitions, 969 flow [2022-11-18 18:38:25,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 100.5) internal successors, (1206), 12 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:38:25,888 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:38:25,888 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:38:25,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 18:38:25,888 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:38:25,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:38:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash 5511005, now seen corresponding path program 3 times [2022-11-18 18:38:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:38:25,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162842234] [2022-11-18 18:38:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:38:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:38:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:38:25,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:38:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:38:26,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 18:38:26,010 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:38:26,011 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-18 18:38:26,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-18 18:38:26,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-18 18:38:26,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-18 18:38:26,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-18 18:38:26,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-18 18:38:26,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-18 18:38:26,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 18:38:26,014 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:38:26,020 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 18:38:26,020 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 18:38:26,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:38:26 BasicIcfg [2022-11-18 18:38:26,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 18:38:26,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 18:38:26,155 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 18:38:26,155 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 18:38:26,155 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:37:42" (3/4) ... [2022-11-18 18:38:26,157 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 18:38:26,283 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 18:38:26,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 18:38:26,284 INFO L158 Benchmark]: Toolchain (without parser) took 45618.01ms. Allocated memory was 167.8MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 137.9MB in the beginning and 6.8GB in the end (delta: -6.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-18 18:38:26,284 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 92.3MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:38:26,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.25ms. Allocated memory is still 167.8MB. Free memory was 137.9MB in the beginning and 132.2MB in the end (delta: 5.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 18:38:26,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.77ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 129.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:38:26,285 INFO L158 Benchmark]: Boogie Preprocessor took 68.42ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 127.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:38:26,286 INFO L158 Benchmark]: RCFGBuilder took 910.83ms. Allocated memory is still 167.8MB. Free memory was 127.5MB in the beginning and 93.1MB in the end (delta: 34.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-18 18:38:26,286 INFO L158 Benchmark]: TraceAbstraction took 43822.02ms. Allocated memory was 167.8MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 92.5MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 974.6MB. Max. memory is 16.1GB. [2022-11-18 18:38:26,286 INFO L158 Benchmark]: Witness Printer took 129.17ms. Allocated memory is still 7.8GB. Free memory was 6.8GB in the beginning and 6.8GB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-18 18:38:26,288 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 92.3MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 602.25ms. Allocated memory is still 167.8MB. Free memory was 137.9MB in the beginning and 132.2MB in the end (delta: 5.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.77ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 129.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.42ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 127.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 910.83ms. Allocated memory is still 167.8MB. Free memory was 127.5MB in the beginning and 93.1MB in the end (delta: 34.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 43822.02ms. Allocated memory was 167.8MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 92.5MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 974.6MB. Max. memory is 16.1GB. * Witness Printer took 129.17ms. Allocated memory is still 7.8GB. Free memory was 6.8GB in the beginning and 6.8GB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L736] 0 _Bool z$r_buff1_thd4; VAL [z$r_buff1_thd4=0] [L734] 0 _Bool z$r_buff1_thd2; VAL [z$r_buff1_thd2=0, z$r_buff1_thd4=0] [L735] 0 _Bool z$r_buff1_thd3; VAL [z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L732] 0 _Bool z$r_buff1_thd0; VAL [z$r_buff1_thd0=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L733] 0 _Bool z$r_buff1_thd1; VAL [z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L743] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L741] 0 int z$w_buff1; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L744] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L725] 0 _Bool z$flush_delayed; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L739] 0 int z$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L728] 0 _Bool z$r_buff0_thd1; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L729] 0 _Bool z$r_buff0_thd2; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L727] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L730] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L726] 0 int z$mem_tmp; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L731] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L737] 0 _Bool z$read_delayed; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L716] 0 int a = 0; VAL [__unbuffered_p1_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L738] 0 int *z$read_delayed_var; VAL [__unbuffered_p1_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0] [L742] 0 _Bool z$w_buff1_used; VAL [__unbuffered_p1_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, a=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L740] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1461; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=-3, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1462; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=-2, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1463; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=-1, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1464; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 locations, 7 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: 43.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 31.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1134 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1134 mSDsluCounter, 1124 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 904 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1928 IncrementalHoareTripleChecker+Invalid, 2056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 220 mSDtfsCounter, 1928 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1374occurred in iteration=10, InterpolantAutomatonStates: 174, 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.7s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 1374 NumberOfCodeBlocks, 1374 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1258 ConstructedInterpolants, 0 QuantifiedInterpolants, 6456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 18:38:26,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dbb8bb5-ab93-4300-8a47-614d7683d953/bin/uautomizer-TMbwUNV5ro/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