/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:37:54,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:37:54,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:37:54,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:37:54,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:37:54,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:37:54,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:37:54,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:37:54,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:37:54,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:37:54,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:37:54,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:37:54,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:37:54,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:37:54,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:37:54,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:37:54,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:37:54,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:37:54,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:37:54,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:37:54,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:37:54,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:37:54,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:37:54,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:37:54,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:37:54,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:37:54,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:37:54,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:37:54,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:37:54,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:37:54,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:37:54,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:37:54,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:37:54,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:37:54,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:37:54,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:37:54,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:37:54,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:37:54,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:37:54,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:37:54,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:37:54,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 23:37:54,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:37:54,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:37:54,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:37:54,131 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:37:54,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:37:54,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:37:54,131 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:37:54,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:37:54,132 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:37:54,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:37:54,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:37:54,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:37:54,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:37:54,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:37:54,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:37:54,132 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:37:54,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:37:54,132 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:37:54,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:37:54,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:37:54,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:37:54,133 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:37:54,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:37:54,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:37:54,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:37:54,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:37:54,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:37:54,133 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:37:54,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:37:54,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:37:54,134 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:37:54,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:37:54,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:37:54,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:37:54,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:37:54,415 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:37:54,416 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:37:54,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2022-12-11 23:37:55,439 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:37:55,693 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:37:55,693 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2022-12-11 23:37:55,706 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23da2ee80/a94f4a174bcc400d8ba97e24b870d855/FLAG5de6ce96e [2022-12-11 23:37:56,011 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23da2ee80/a94f4a174bcc400d8ba97e24b870d855 [2022-12-11 23:37:56,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:37:56,014 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:37:56,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:37:56,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:37:56,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:37:56,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564bd54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56, skipping insertion in model container [2022-12-11 23:37:56,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:37:56,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:37:56,169 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i[944,957] [2022-12-11 23:37:56,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:37:56,355 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:37:56,364 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i[944,957] [2022-12-11 23:37:56,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:56,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:56,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:37:56,445 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:37:56,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56 WrapperNode [2022-12-11 23:37:56,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:37:56,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:37:56,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:37:56,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:37:56,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,512 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-12-11 23:37:56,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:37:56,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:37:56,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:37:56,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:37:56,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,544 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:37:56,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:37:56,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:37:56,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:37:56,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56" (1/1) ... [2022-12-11 23:37:56,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:37:56,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:37:56,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 23:37:56,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 23:37:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:37:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 23:37:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:37:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:37:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:37:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 23:37:56,615 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 23:37:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 23:37:56,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 23:37:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 23:37:56,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 23:37:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 23:37:56,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 23:37:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:37:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 23:37:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:37:56,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:37:56,617 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:37:56,761 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:37:56,763 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:37:57,002 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:37:57,069 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:37:57,070 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 23:37:57,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:37:57 BoogieIcfgContainer [2022-12-11 23:37:57,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:37:57,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:37:57,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:37:57,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:37:57,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:37:56" (1/3) ... [2022-12-11 23:37:57,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df099f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:37:57, skipping insertion in model container [2022-12-11 23:37:57,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:56" (2/3) ... [2022-12-11 23:37:57,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df099f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:37:57, skipping insertion in model container [2022-12-11 23:37:57,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:37:57" (3/3) ... [2022-12-11 23:37:57,078 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2022-12-11 23:37:57,092 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:37:57,093 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 23:37:57,093 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:37:57,151 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 23:37:57,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-11 23:37:57,256 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-11 23:37:57,258 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:37:57,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-11 23:37:57,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-11 23:37:57,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-11 23:37:57,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:37:57,284 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75909394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:37:57,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 23:37:57,316 INFO L130 PetriNetUnfolder]: 0/87 cut-off events. [2022-12-11 23:37:57,316 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:37:57,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:57,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:37:57,317 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-12-11 23:37:57,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:57,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1157691485, now seen corresponding path program 1 times [2022-12-11 23:37:57,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:57,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024529183] [2022-12-11 23:37:57,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:57,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:37:57,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:57,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024529183] [2022-12-11 23:37:57,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024529183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:57,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:57,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 23:37:57,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200662533] [2022-12-11 23:37:57,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:57,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:37:57,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:57,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:37:57,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:37:57,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 130 [2022-12-11 23:37:57,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:37:57,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:57,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 130 [2022-12-11 23:37:57,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:57,990 INFO L130 PetriNetUnfolder]: 10/164 cut-off events. [2022-12-11 23:37:57,991 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-11 23:37:57,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 164 events. 10/164 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 263 event pairs, 2 based on Foata normal form. 7/165 useless extension candidates. Maximal degree in co-relation 151. Up to 17 conditions per place. [2022-12-11 23:37:57,994 INFO L137 encePairwiseOnDemand]: 125/130 looper letters, 9 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2022-12-11 23:37:57,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 124 transitions, 282 flow [2022-12-11 23:37:57,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:37:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:37:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-12-11 23:37:58,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.941025641025641 [2022-12-11 23:37:58,013 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 0 predicate places. [2022-12-11 23:37:58,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 124 transitions, 282 flow [2022-12-11 23:37:58,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 124 transitions, 282 flow [2022-12-11 23:37:58,018 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 124 transitions, 282 flow [2022-12-11 23:37:58,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:37:58,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:58,019 INFO L214 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] [2022-12-11 23:37:58,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:37:58,019 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-12-11 23:37:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1514350168, now seen corresponding path program 1 times [2022-12-11 23:37:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:58,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753251819] [2022-12-11 23:37:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:37:58,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:58,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753251819] [2022-12-11 23:37:58,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753251819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:58,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:58,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:37:58,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937671615] [2022-12-11 23:37:58,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:58,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:37:58,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:58,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:37:58,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:37:58,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 130 [2022-12-11 23:37:58,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 124 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:37:58,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:58,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 130 [2022-12-11 23:37:58,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:59,376 INFO L130 PetriNetUnfolder]: 2388/6048 cut-off events. [2022-12-11 23:37:59,376 INFO L131 PetriNetUnfolder]: For 855/1364 co-relation queries the response was YES. [2022-12-11 23:37:59,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10596 conditions, 6048 events. 2388/6048 cut-off events. For 855/1364 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 56083 event pairs, 325 based on Foata normal form. 1/5892 useless extension candidates. Maximal degree in co-relation 10532. Up to 1636 conditions per place. [2022-12-11 23:37:59,410 INFO L137 encePairwiseOnDemand]: 117/130 looper letters, 34 selfloop transitions, 10 changer transitions 76/206 dead transitions. [2022-12-11 23:37:59,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 206 transitions, 739 flow [2022-12-11 23:37:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:37:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:37:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1010 transitions. [2022-12-11 23:37:59,413 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8632478632478633 [2022-12-11 23:37:59,414 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 8 predicate places. [2022-12-11 23:37:59,414 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 206 transitions, 739 flow [2022-12-11 23:37:59,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 130 transitions, 409 flow [2022-12-11 23:37:59,430 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 130 transitions, 409 flow [2022-12-11 23:37:59,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:37:59,430 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:59,430 INFO L214 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-12-11 23:37:59,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:37:59,431 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-12-11 23:37:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1668296663, now seen corresponding path program 1 times [2022-12-11 23:37:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:59,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234238519] [2022-12-11 23:37:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:37:59,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:59,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234238519] [2022-12-11 23:37:59,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234238519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:59,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:59,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:37:59,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571973696] [2022-12-11 23:37:59,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:59,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:37:59,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:59,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:37:59,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:37:59,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 130 [2022-12-11 23:37:59,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 130 transitions, 409 flow. Second operand has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:37:59,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:59,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 130 [2022-12-11 23:37:59,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:38:00,319 INFO L130 PetriNetUnfolder]: 1497/3326 cut-off events. [2022-12-11 23:38:00,320 INFO L131 PetriNetUnfolder]: For 800/4881 co-relation queries the response was YES. [2022-12-11 23:38:00,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8600 conditions, 3326 events. 1497/3326 cut-off events. For 800/4881 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25574 event pairs, 142 based on Foata normal form. 81/3356 useless extension candidates. Maximal degree in co-relation 8528. Up to 1727 conditions per place. [2022-12-11 23:38:00,338 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 45 selfloop transitions, 8 changer transitions 85/224 dead transitions. [2022-12-11 23:38:00,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 224 transitions, 1129 flow [2022-12-11 23:38:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:38:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:38:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1416 transitions. [2022-12-11 23:38:00,344 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8378698224852071 [2022-12-11 23:38:00,345 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-12-11 23:38:00,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 224 transitions, 1129 flow [2022-12-11 23:38:00,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 139 transitions, 559 flow [2022-12-11 23:38:00,367 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 139 transitions, 559 flow [2022-12-11 23:38:00,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:00,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:38:00,368 INFO L214 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] [2022-12-11 23:38:00,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:38:00,368 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-12-11 23:38:00,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:38:00,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1538171083, now seen corresponding path program 1 times [2022-12-11 23:38:00,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:38:00,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421757079] [2022-12-11 23:38:00,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:38:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:38:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:38:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:38:00,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:38:00,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421757079] [2022-12-11 23:38:00,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421757079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:38:00,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:38:00,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:38:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113927199] [2022-12-11 23:38:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:38:00,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:38:00,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:38:00,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:38:00,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:38:00,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 130 [2022-12-11 23:38:00,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 139 transitions, 559 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:00,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:38:00,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 130 [2022-12-11 23:38:00,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:38:01,004 INFO L130 PetriNetUnfolder]: 1167/2743 cut-off events. [2022-12-11 23:38:01,005 INFO L131 PetriNetUnfolder]: For 1573/4350 co-relation queries the response was YES. [2022-12-11 23:38:01,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8223 conditions, 2743 events. 1167/2743 cut-off events. For 1573/4350 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 20566 event pairs, 150 based on Foata normal form. 78/2755 useless extension candidates. Maximal degree in co-relation 8147. Up to 1378 conditions per place. [2022-12-11 23:38:01,016 INFO L137 encePairwiseOnDemand]: 123/130 looper letters, 51 selfloop transitions, 7 changer transitions 40/196 dead transitions. [2022-12-11 23:38:01,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 196 transitions, 1163 flow [2022-12-11 23:38:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:38:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:38:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1026 transitions. [2022-12-11 23:38:01,019 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8769230769230769 [2022-12-11 23:38:01,020 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 1 predicate places. [2022-12-11 23:38:01,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 196 transitions, 1163 flow [2022-12-11 23:38:01,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 156 transitions, 813 flow [2022-12-11 23:38:01,028 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 156 transitions, 813 flow [2022-12-11 23:38:01,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:01,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:38:01,028 INFO L214 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-12-11 23:38:01,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:38:01,028 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-12-11 23:38:01,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:38:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash -797059572, now seen corresponding path program 1 times [2022-12-11 23:38:01,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:38:01,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942484044] [2022-12-11 23:38:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:38:01,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:38:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:38:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:38:01,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:38:01,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942484044] [2022-12-11 23:38:01,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942484044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:38:01,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:38:01,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:38:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968682498] [2022-12-11 23:38:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:38:01,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:38:01,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:38:01,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:38:01,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:38:01,204 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 130 [2022-12-11 23:38:01,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 156 transitions, 813 flow. Second operand has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:01,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:38:01,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 130 [2022-12-11 23:38:01,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:38:02,777 INFO L130 PetriNetUnfolder]: 7861/13996 cut-off events. [2022-12-11 23:38:02,777 INFO L131 PetriNetUnfolder]: For 31581/35488 co-relation queries the response was YES. [2022-12-11 23:38:02,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42892 conditions, 13996 events. 7861/13996 cut-off events. For 31581/35488 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 116142 event pairs, 413 based on Foata normal form. 125/13381 useless extension candidates. Maximal degree in co-relation 42812. Up to 4450 conditions per place. [2022-12-11 23:38:02,923 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 137 selfloop transitions, 20 changer transitions 18/284 dead transitions. [2022-12-11 23:38:02,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 284 transitions, 2168 flow [2022-12-11 23:38:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:38:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:38:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1143 transitions. [2022-12-11 23:38:02,926 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8792307692307693 [2022-12-11 23:38:02,926 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 4 predicate places. [2022-12-11 23:38:02,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 284 transitions, 2168 flow [2022-12-11 23:38:02,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 266 transitions, 1952 flow [2022-12-11 23:38:02,969 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 266 transitions, 1952 flow [2022-12-11 23:38:02,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:02,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:38:02,970 INFO L214 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-12-11 23:38:02,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:38:02,970 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-12-11 23:38:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:38:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash -518699543, now seen corresponding path program 1 times [2022-12-11 23:38:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:38:02,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135064252] [2022-12-11 23:38:02,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:38:02,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:38:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:38:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:38:03,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:38:03,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135064252] [2022-12-11 23:38:03,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135064252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:38:03,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:38:03,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:38:03,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823068108] [2022-12-11 23:38:03,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:38:03,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:38:03,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:38:03,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:38:03,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:38:03,105 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 130 [2022-12-11 23:38:03,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 266 transitions, 1952 flow. Second operand has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:03,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:38:03,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 130 [2022-12-11 23:38:03,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:38:05,077 INFO L130 PetriNetUnfolder]: 10043/18375 cut-off events. [2022-12-11 23:38:05,077 INFO L131 PetriNetUnfolder]: For 59749/65982 co-relation queries the response was YES. [2022-12-11 23:38:05,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61229 conditions, 18375 events. 10043/18375 cut-off events. For 59749/65982 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 162562 event pairs, 633 based on Foata normal form. 728/18257 useless extension candidates. Maximal degree in co-relation 61145. Up to 6459 conditions per place. [2022-12-11 23:38:05,204 INFO L137 encePairwiseOnDemand]: 124/130 looper letters, 125 selfloop transitions, 17 changer transitions 60/333 dead transitions. [2022-12-11 23:38:05,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 333 transitions, 3102 flow [2022-12-11 23:38:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:38:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:38:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1024 transitions. [2022-12-11 23:38:05,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8752136752136752 [2022-12-11 23:38:05,207 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 12 predicate places. [2022-12-11 23:38:05,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 333 transitions, 3102 flow [2022-12-11 23:38:05,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 273 transitions, 2302 flow [2022-12-11 23:38:05,271 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 273 transitions, 2302 flow [2022-12-11 23:38:05,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:05,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:38:05,272 INFO L214 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-12-11 23:38:05,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:38:05,272 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-12-11 23:38:05,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:38:05,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1525875367, now seen corresponding path program 1 times [2022-12-11 23:38:05,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:38:05,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982845888] [2022-12-11 23:38:05,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:38:05,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:38:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:38:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:38:05,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:38:05,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982845888] [2022-12-11 23:38:05,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982845888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:38:05,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:38:05,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:38:05,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875953101] [2022-12-11 23:38:05,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:38:05,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:38:05,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:38:05,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:38:05,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:38:05,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 130 [2022-12-11 23:38:05,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 273 transitions, 2302 flow. Second operand has 7 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:05,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:38:05,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 130 [2022-12-11 23:38:05,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:38:06,624 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][297], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, 186#true, P0Thread1of1ForFork1InUse, 53#L801true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 115#L763true, 147#true, 103#L778true, 11#L866true, 238#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 144#true, 163#true, 202#true]) [2022-12-11 23:38:06,624 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-11 23:38:06,624 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:38:06,624 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:38:06,624 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:38:06,626 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][227], [220#(= ~y~0 1), 248#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 59#L839true, 110#L867true, P2Thread1of1ForFork0InUse, 6#L773true, P0Thread1of1ForFork1InUse, 53#L801true, 186#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 115#L763true, 147#true, 144#true, 163#true, 202#true]) [2022-12-11 23:38:06,626 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-11 23:38:06,626 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:38:06,626 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:38:06,626 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:38:06,865 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][319], [220#(= ~y~0 1), 59#L839true, 110#L867true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 186#true, 53#L801true, 254#(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)), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 115#L763true, 147#true, 103#L778true, 144#true, 163#true, 202#true]) [2022-12-11 23:38:06,865 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,865 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,865 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,865 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,866 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][297], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 186#true, P3Thread1of1ForFork2InUse, 95#L806true, P1Thread1of1ForFork3InUse, 115#L763true, 147#true, 103#L778true, 11#L866true, 238#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 144#true, 163#true, 202#true]) [2022-12-11 23:38:06,866 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,866 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,866 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,866 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,867 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][227], [220#(= ~y~0 1), 248#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 59#L839true, P2Thread1of1ForFork0InUse, 6#L773true, 186#true, P0Thread1of1ForFork1InUse, 53#L801true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 69#L2true, 115#L763true, 147#true, 144#true, 163#true, 202#true]) [2022-12-11 23:38:06,867 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,867 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,867 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,867 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,868 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][319], [220#(= ~y~0 1), 59#L839true, 110#L867true, P2Thread1of1ForFork0InUse, 6#L773true, P0Thread1of1ForFork1InUse, 186#true, 254#(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)), P3Thread1of1ForFork2InUse, 95#L806true, P1Thread1of1ForFork3InUse, 115#L763true, 147#true, 144#true, 163#true, 202#true]) [2022-12-11 23:38:06,868 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,868 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,868 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,868 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:38:06,968 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][319], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 186#true, 53#L801true, 254#(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)), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 69#L2true, 115#L763true, 147#true, 103#L778true, 144#true, 163#true, 202#true]) [2022-12-11 23:38:06,969 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,969 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,969 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,969 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,969 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][319], [220#(= ~y~0 1), 59#L839true, 110#L867true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 186#true, 254#(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)), P3Thread1of1ForFork2InUse, 95#L806true, P1Thread1of1ForFork3InUse, 115#L763true, 147#true, 103#L778true, 144#true, 202#true, 163#true]) [2022-12-11 23:38:06,970 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,970 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,970 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,970 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,971 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][284], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, 6#L773true, P0Thread1of1ForFork1InUse, 53#L801true, 186#true, P3Thread1of1ForFork2InUse, 252#(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)), P1Thread1of1ForFork3InUse, 57#L3true, 115#L763true, 147#true, 144#true, 163#true, 202#true]) [2022-12-11 23:38:06,971 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,971 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,971 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,971 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,972 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][319], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, 6#L773true, P0Thread1of1ForFork1InUse, 186#true, 254#(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)), P3Thread1of1ForFork2InUse, 95#L806true, P1Thread1of1ForFork3InUse, 69#L2true, 115#L763true, 147#true, 144#true, 202#true, 163#true]) [2022-12-11 23:38:06,972 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,972 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,972 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:38:06,972 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:38:07,059 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][362], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, 186#true, P0Thread1of1ForFork1InUse, 53#L801true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 57#L3true, 115#L763true, 147#true, 103#L778true, 144#true, 163#true, 202#true, 256#(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))]) [2022-12-11 23:38:07,059 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,059 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,059 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,059 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,060 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][319], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, 186#true, P0Thread1of1ForFork1InUse, 254#(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)), P3Thread1of1ForFork2InUse, 95#L806true, P1Thread1of1ForFork3InUse, 69#L2true, 115#L763true, 147#true, 103#L778true, 144#true, 163#true, 202#true]) [2022-12-11 23:38:07,060 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,060 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,060 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,060 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,061 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][309], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, 6#L773true, P0Thread1of1ForFork1InUse, 53#L801true, 186#true, P3Thread1of1ForFork2InUse, 252#(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)), P1Thread1of1ForFork3InUse, 115#L763true, 147#true, 128#L3-1true, 207#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 144#true, 163#true]) [2022-12-11 23:38:07,061 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,061 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,061 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,061 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,061 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][362], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, 6#L773true, 186#true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 95#L806true, P1Thread1of1ForFork3InUse, 57#L3true, 115#L763true, 147#true, 144#true, 163#true, 202#true, 256#(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))]) [2022-12-11 23:38:07,062 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,062 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,062 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,062 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:38:07,140 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][362], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 186#true, P3Thread1of1ForFork2InUse, 95#L806true, P1Thread1of1ForFork3InUse, 57#L3true, 115#L763true, 147#true, 103#L778true, 144#true, 163#true, 202#true, 256#(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))]) [2022-12-11 23:38:07,140 INFO L382 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-12-11 23:38:07,140 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 23:38:07,140 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 23:38:07,140 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 23:38:07,141 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][379], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 186#true, 53#L801true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 115#L763true, 147#true, 128#L3-1true, 103#L778true, 207#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 144#true, 163#true, 256#(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))]) [2022-12-11 23:38:07,141 INFO L382 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-12-11 23:38:07,141 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 23:38:07,141 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 23:38:07,141 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 23:38:07,142 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][379], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, 6#L773true, P0Thread1of1ForFork1InUse, 186#true, P3Thread1of1ForFork2InUse, 95#L806true, P1Thread1of1ForFork3InUse, 115#L763true, 147#true, 128#L3-1true, 207#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 144#true, 163#true, 256#(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))]) [2022-12-11 23:38:07,142 INFO L382 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-12-11 23:38:07,142 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 23:38:07,142 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 23:38:07,142 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 23:38:07,195 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][379], [220#(= ~y~0 1), 59#L839true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 186#true, P3Thread1of1ForFork2InUse, 95#L806true, P1Thread1of1ForFork3InUse, 115#L763true, 147#true, 128#L3-1true, 103#L778true, 207#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 144#true, 163#true, 256#(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))]) [2022-12-11 23:38:07,195 INFO L382 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-12-11 23:38:07,195 INFO L385 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-12-11 23:38:07,195 INFO L385 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-12-11 23:38:07,195 INFO L385 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-12-11 23:38:07,474 INFO L130 PetriNetUnfolder]: 7909/15911 cut-off events. [2022-12-11 23:38:07,474 INFO L131 PetriNetUnfolder]: For 57358/73237 co-relation queries the response was YES. [2022-12-11 23:38:07,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59226 conditions, 15911 events. 7909/15911 cut-off events. For 57358/73237 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 156933 event pairs, 162 based on Foata normal form. 1757/16967 useless extension candidates. Maximal degree in co-relation 59138. Up to 5715 conditions per place. [2022-12-11 23:38:07,536 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 232 selfloop transitions, 50 changer transitions 29/434 dead transitions. [2022-12-11 23:38:07,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 434 transitions, 4643 flow [2022-12-11 23:38:07,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:38:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:38:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1485 transitions. [2022-12-11 23:38:07,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.878698224852071 [2022-12-11 23:38:07,539 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 24 predicate places. [2022-12-11 23:38:07,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 434 transitions, 4643 flow [2022-12-11 23:38:07,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 405 transitions, 4199 flow [2022-12-11 23:38:07,571 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 405 transitions, 4199 flow [2022-12-11 23:38:07,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:07,572 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:38:07,572 INFO L214 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-12-11 23:38:07,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:38:07,572 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-12-11 23:38:07,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:38:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1684305337, now seen corresponding path program 1 times [2022-12-11 23:38:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:38:07,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401694102] [2022-12-11 23:38:07,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:38:07,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:38:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:38:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:38:07,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:38:07,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401694102] [2022-12-11 23:38:07,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401694102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:38:07,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:38:07,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:38:07,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371200223] [2022-12-11 23:38:07,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:38:07,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:38:07,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:38:07,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:38:07,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:38:07,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 130 [2022-12-11 23:38:07,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 405 transitions, 4199 flow. Second operand has 8 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:07,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:38:07,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 130 [2022-12-11 23:38:07,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:38:09,699 INFO L130 PetriNetUnfolder]: 6043/14017 cut-off events. [2022-12-11 23:38:09,700 INFO L131 PetriNetUnfolder]: For 43154/54027 co-relation queries the response was YES. [2022-12-11 23:38:09,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56485 conditions, 14017 events. 6043/14017 cut-off events. For 43154/54027 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 149731 event pairs, 63 based on Foata normal form. 1703/15411 useless extension candidates. Maximal degree in co-relation 56393. Up to 4442 conditions per place. [2022-12-11 23:38:09,874 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 204 selfloop transitions, 88 changer transitions 175/576 dead transitions. [2022-12-11 23:38:09,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 576 transitions, 7152 flow [2022-12-11 23:38:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:38:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:38:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1830 transitions. [2022-12-11 23:38:09,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8798076923076923 [2022-12-11 23:38:09,884 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 39 predicate places. [2022-12-11 23:38:09,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 576 transitions, 7152 flow [2022-12-11 23:38:09,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 401 transitions, 4596 flow [2022-12-11 23:38:09,908 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 401 transitions, 4596 flow [2022-12-11 23:38:09,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:09,909 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:38:09,909 INFO L214 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-12-11 23:38:09,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:38:09,909 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-12-11 23:38:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:38:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1120061893, now seen corresponding path program 1 times [2022-12-11 23:38:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:38:09,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311251039] [2022-12-11 23:38:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:38:09,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:38:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:38:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:38:10,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:38:10,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311251039] [2022-12-11 23:38:10,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311251039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:38:10,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:38:10,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:38:10,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138931414] [2022-12-11 23:38:10,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:38:10,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:38:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:38:10,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:38:10,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:38:10,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 130 [2022-12-11 23:38:10,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 401 transitions, 4596 flow. Second operand has 7 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:10,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:38:10,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 130 [2022-12-11 23:38:10,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:38:12,273 INFO L130 PetriNetUnfolder]: 9233/23140 cut-off events. [2022-12-11 23:38:12,273 INFO L131 PetriNetUnfolder]: For 71687/81151 co-relation queries the response was YES. [2022-12-11 23:38:12,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90321 conditions, 23140 events. 9233/23140 cut-off events. For 71687/81151 co-relation queries the response was YES. Maximal size of possible extension queue 2199. Compared 283806 event pairs, 157 based on Foata normal form. 467/23011 useless extension candidates. Maximal degree in co-relation 90224. Up to 7163 conditions per place. [2022-12-11 23:38:12,376 INFO L137 encePairwiseOnDemand]: 124/130 looper letters, 255 selfloop transitions, 3 changer transitions 145/612 dead transitions. [2022-12-11 23:38:12,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 612 transitions, 9073 flow [2022-12-11 23:38:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 23:38:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 23:38:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 798 transitions. [2022-12-11 23:38:12,378 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8769230769230769 [2022-12-11 23:38:12,379 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 39 predicate places. [2022-12-11 23:38:12,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 612 transitions, 9073 flow [2022-12-11 23:38:12,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 467 transitions, 6274 flow [2022-12-11 23:38:12,410 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 467 transitions, 6274 flow [2022-12-11 23:38:12,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:12,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:38:12,411 INFO L214 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-12-11 23:38:12,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:38:12,411 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-12-11 23:38:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:38:12,411 INFO L85 PathProgramCache]: Analyzing trace with hash -289043621, now seen corresponding path program 2 times [2022-12-11 23:38:12,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:38:12,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135344152] [2022-12-11 23:38:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:38:12,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:38:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:38:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:38:12,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:38:12,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135344152] [2022-12-11 23:38:12,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135344152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:38:12,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:38:12,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 23:38:12,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604254024] [2022-12-11 23:38:12,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:38:12,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 23:38:12,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:38:12,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 23:38:12,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 23:38:12,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 130 [2022-12-11 23:38:12,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 467 transitions, 6274 flow. Second operand has 9 states, 9 states have (on average 108.0) internal successors, (972), 9 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:12,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:38:12,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 130 [2022-12-11 23:38:12,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:38:14,851 INFO L130 PetriNetUnfolder]: 5693/14409 cut-off events. [2022-12-11 23:38:14,851 INFO L131 PetriNetUnfolder]: For 58292/72854 co-relation queries the response was YES. [2022-12-11 23:38:14,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67980 conditions, 14409 events. 5693/14409 cut-off events. For 58292/72854 co-relation queries the response was YES. Maximal size of possible extension queue 1420. Compared 167251 event pairs, 61 based on Foata normal form. 2723/16765 useless extension candidates. Maximal degree in co-relation 67879. Up to 4720 conditions per place. [2022-12-11 23:38:14,909 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 125 selfloop transitions, 75 changer transitions 179/476 dead transitions. [2022-12-11 23:38:14,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 476 transitions, 7092 flow [2022-12-11 23:38:14,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 23:38:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 23:38:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2135 transitions. [2022-12-11 23:38:14,913 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8643724696356275 [2022-12-11 23:38:14,914 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 54 predicate places. [2022-12-11 23:38:14,914 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 476 transitions, 7092 flow [2022-12-11 23:38:14,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 297 transitions, 3655 flow [2022-12-11 23:38:14,932 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 297 transitions, 3655 flow [2022-12-11 23:38:14,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.0) internal successors, (972), 9 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:14,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:38:14,932 INFO L214 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] [2022-12-11 23:38:14,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 23:38:14,932 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-12-11 23:38:14,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:38:14,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1155931483, now seen corresponding path program 1 times [2022-12-11 23:38:14,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:38:14,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147054062] [2022-12-11 23:38:14,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:38:14,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:38:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:38:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:38:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:38:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147054062] [2022-12-11 23:38:15,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147054062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:38:15,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:38:15,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:38:15,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185396239] [2022-12-11 23:38:15,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:38:15,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:38:15,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:38:15,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:38:15,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:38:15,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2022-12-11 23:38:15,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 297 transitions, 3655 flow. Second operand has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:15,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:38:15,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2022-12-11 23:38:15,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:38:15,941 INFO L130 PetriNetUnfolder]: 2465/6783 cut-off events. [2022-12-11 23:38:15,942 INFO L131 PetriNetUnfolder]: For 28815/32715 co-relation queries the response was YES. [2022-12-11 23:38:15,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32006 conditions, 6783 events. 2465/6783 cut-off events. For 28815/32715 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 71574 event pairs, 61 based on Foata normal form. 191/6891 useless extension candidates. Maximal degree in co-relation 31896. Up to 2608 conditions per place. [2022-12-11 23:38:15,965 INFO L137 encePairwiseOnDemand]: 116/130 looper letters, 109 selfloop transitions, 18 changer transitions 88/374 dead transitions. [2022-12-11 23:38:15,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 374 transitions, 5615 flow [2022-12-11 23:38:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 23:38:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 23:38:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 843 transitions. [2022-12-11 23:38:15,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8105769230769231 [2022-12-11 23:38:15,967 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 47 predicate places. [2022-12-11 23:38:15,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 374 transitions, 5615 flow [2022-12-11 23:38:15,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 286 transitions, 3652 flow [2022-12-11 23:38:15,978 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 286 transitions, 3652 flow [2022-12-11 23:38:15,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:15,978 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:38:15,978 INFO L214 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] [2022-12-11 23:38:15,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 23:38:15,978 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-12-11 23:38:15,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:38:15,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1452964283, now seen corresponding path program 2 times [2022-12-11 23:38:15,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:38:15,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111400129] [2022-12-11 23:38:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:38:15,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:38:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:38:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:38:16,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:38:16,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111400129] [2022-12-11 23:38:16,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111400129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:38:16,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:38:16,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:38:16,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037763122] [2022-12-11 23:38:16,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:38:16,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:38:16,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:38:16,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:38:16,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:38:16,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2022-12-11 23:38:16,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 286 transitions, 3652 flow. Second operand has 8 states, 8 states have (on average 102.25) internal successors, (818), 8 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:16,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:38:16,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2022-12-11 23:38:16,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:38:16,813 INFO L130 PetriNetUnfolder]: 2111/6960 cut-off events. [2022-12-11 23:38:16,813 INFO L131 PetriNetUnfolder]: For 19584/21494 co-relation queries the response was YES. [2022-12-11 23:38:16,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29911 conditions, 6960 events. 2111/6960 cut-off events. For 19584/21494 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 81126 event pairs, 38 based on Foata normal form. 165/7060 useless extension candidates. Maximal degree in co-relation 29792. Up to 2513 conditions per place. [2022-12-11 23:38:16,844 INFO L137 encePairwiseOnDemand]: 117/130 looper letters, 45 selfloop transitions, 7 changer transitions 145/315 dead transitions. [2022-12-11 23:38:16,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 315 transitions, 4608 flow [2022-12-11 23:38:16,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:38:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:38:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 944 transitions. [2022-12-11 23:38:16,846 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8068376068376069 [2022-12-11 23:38:16,846 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 52 predicate places. [2022-12-11 23:38:16,846 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 315 transitions, 4608 flow [2022-12-11 23:38:16,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 170 transitions, 1706 flow [2022-12-11 23:38:16,856 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 170 transitions, 1706 flow [2022-12-11 23:38:16,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.25) internal successors, (818), 8 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:16,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:38:16,857 INFO L214 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] [2022-12-11 23:38:16,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 23:38:16,857 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-12-11 23:38:16,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:38:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash 993696175, now seen corresponding path program 3 times [2022-12-11 23:38:16,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:38:16,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929209656] [2022-12-11 23:38:16,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:38:16,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:38:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:38:17,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-12-11 23:38:17,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:38:17,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929209656] [2022-12-11 23:38:17,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929209656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:38:17,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:38:17,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:38:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891053817] [2022-12-11 23:38:17,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:38:17,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:38:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:38:17,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:38:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:38:17,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2022-12-11 23:38:17,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 170 transitions, 1706 flow. Second operand has 8 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:17,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:38:17,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2022-12-11 23:38:17,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:38:17,620 INFO L130 PetriNetUnfolder]: 581/2831 cut-off events. [2022-12-11 23:38:17,620 INFO L131 PetriNetUnfolder]: For 8459/8651 co-relation queries the response was YES. [2022-12-11 23:38:17,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12055 conditions, 2831 events. 581/2831 cut-off events. For 8459/8651 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 31108 event pairs, 33 based on Foata normal form. 21/2841 useless extension candidates. Maximal degree in co-relation 11924. Up to 830 conditions per place. [2022-12-11 23:38:17,629 INFO L137 encePairwiseOnDemand]: 116/130 looper letters, 23 selfloop transitions, 10 changer transitions 60/186 dead transitions. [2022-12-11 23:38:17,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 186 transitions, 2158 flow [2022-12-11 23:38:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:38:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:38:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1012 transitions. [2022-12-11 23:38:17,631 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7784615384615384 [2022-12-11 23:38:17,631 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 52 predicate places. [2022-12-11 23:38:17,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 186 transitions, 2158 flow [2022-12-11 23:38:17,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 126 transitions, 1020 flow [2022-12-11 23:38:17,635 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 126 transitions, 1020 flow [2022-12-11 23:38:17,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:38:17,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:38:17,635 INFO L214 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] [2022-12-11 23:38:17,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 23:38:17,635 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-12-11 23:38:17,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:38:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash -864730591, now seen corresponding path program 4 times [2022-12-11 23:38:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:38:17,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264020736] [2022-12-11 23:38:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:38:17,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:38:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:38:17,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:38:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:38:17,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:38:17,727 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:38:17,728 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 23:38:17,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 23:38:17,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 23:38:17,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 23:38:17,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 23:38:17,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 23:38:17,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 23:38:17,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 23:38:17,735 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:38:17,740 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:38:17,740 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:38:17,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:38:17 BasicIcfg [2022-12-11 23:38:17,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:38:17,846 INFO L158 Benchmark]: Toolchain (without parser) took 21831.30ms. Allocated memory was 212.9MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 187.4MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-11 23:38:17,846 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 212.9MB. Free memory was 189.4MB in the beginning and 189.3MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:38:17,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.87ms. Allocated memory is still 212.9MB. Free memory was 187.4MB in the beginning and 160.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-11 23:38:17,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.27ms. Allocated memory is still 212.9MB. Free memory was 160.1MB in the beginning and 157.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:38:17,847 INFO L158 Benchmark]: Boogie Preprocessor took 45.05ms. Allocated memory is still 212.9MB. Free memory was 157.5MB in the beginning and 155.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:38:17,847 INFO L158 Benchmark]: RCFGBuilder took 513.05ms. Allocated memory is still 212.9MB. Free memory was 155.4MB in the beginning and 124.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-11 23:38:17,847 INFO L158 Benchmark]: TraceAbstraction took 20771.18ms. Allocated memory was 212.9MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 122.4MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 966.2MB. Max. memory is 8.0GB. [2022-12-11 23:38:17,849 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.12ms. Allocated memory is still 212.9MB. Free memory was 189.4MB in the beginning and 189.3MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 431.87ms. Allocated memory is still 212.9MB. Free memory was 187.4MB in the beginning and 160.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.27ms. Allocated memory is still 212.9MB. Free memory was 160.1MB in the beginning and 157.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.05ms. Allocated memory is still 212.9MB. Free memory was 157.5MB in the beginning and 155.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 513.05ms. Allocated memory is still 212.9MB. Free memory was 155.4MB in the beginning and 124.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 20771.18ms. Allocated memory was 212.9MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 122.4MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 966.2MB. Max. memory is 8.0GB. * 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L722] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L731] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L734] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L735] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L737] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L742] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L743] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L744] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L745] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L746] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L747] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L748] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L856] 0 pthread_t t1029; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={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] [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1029, ((void *)0), P0, ((void *)0))=-3, t1029={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] [L858] 0 pthread_t t1030; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, t1030={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] [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1030, ((void *)0), P1, ((void *)0))=-2, t1029={5:0}, t1030={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] [L860] 0 pthread_t t1031; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={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] [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1031, ((void *)0), P2, ((void *)0))=-1, t1029={5:0}, t1030={6:0}, t1031={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] [L862] 0 pthread_t t1032; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={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] [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1032, ((void *)0), P3, ((void *)0))=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] 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) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 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 [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 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 [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, 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=1, 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: 861]: 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: 857]: 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: 863]: 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: 859]: 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, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.3s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 828 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 828 mSDsluCounter, 825 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 647 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1563 IncrementalHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 178 mSDtfsCounter, 1563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6274occurred in iteration=9, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 17505 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1280 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1166 ConstructedInterpolants, 0 QuantifiedInterpolants, 5001 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 23:38:17,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...