/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_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 12:05:06,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 12:05:06,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 12:05:06,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 12:05:06,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 12:05:06,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 12:05:06,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 12:05:06,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 12:05:06,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 12:05:06,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 12:05:06,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 12:05:06,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 12:05:06,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 12:05:06,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 12:05:06,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 12:05:06,252 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 12:05:06,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 12:05:06,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 12:05:06,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 12:05:06,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 12:05:06,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 12:05:06,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 12:05:06,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 12:05:06,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 12:05:06,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 12:05:06,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 12:05:06,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 12:05:06,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 12:05:06,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 12:05:06,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 12:05:06,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 12:05:06,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 12:05:06,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 12:05:06,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 12:05:06,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 12:05:06,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 12:05:06,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 12:05:06,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 12:05:06,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 12:05:06,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 12:05:06,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 12:05:06,280 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-12 12:05:06,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 12:05:06,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 12:05:06,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 12:05:06,304 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 12:05:06,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 12:05:06,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 12:05:06,306 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 12:05:06,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 12:05:06,306 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 12:05:06,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 12:05:06,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 12:05:06,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 12:05:06,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 12:05:06,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 12:05:06,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 12:05:06,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 12:05:06,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 12:05:06,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 12:05:06,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 12:05:06,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 12:05:06,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 12:05:06,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 12:05:06,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 12:05:06,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:05:06,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 12:05:06,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 12:05:06,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 12:05:06,308 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 12:05:06,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 12:05:06,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 12:05:06,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 12:05:06,309 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_REDUNDANT_FLOW [2022-12-12 12:05:06,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 12:05:06,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 12:05:06,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 12:05:06,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 12:05:06,593 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 12:05:06,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 12:05:07,629 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 12:05:07,881 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 12:05:07,881 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 12:05:07,898 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d53aff7c/b04de4daae1c4e7f83afcb40fc229ec9/FLAGb421367b3 [2022-12-12 12:05:07,914 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d53aff7c/b04de4daae1c4e7f83afcb40fc229ec9 [2022-12-12 12:05:07,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 12:05:07,917 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 12:05:07,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 12:05:07,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 12:05:07,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 12:05:07,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:05:07" (1/1) ... [2022-12-12 12:05:07,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bbbf7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:07, skipping insertion in model container [2022-12-12 12:05:07,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:05:07" (1/1) ... [2022-12-12 12:05:07,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 12:05:07,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 12:05:08,095 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-12 12:05:08,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:05:08,263 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 12:05:08,272 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-12 12:05:08,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:05:08,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:05:08,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:05:08,361 INFO L208 MainTranslator]: Completed translation [2022-12-12 12:05:08,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08 WrapperNode [2022-12-12 12:05:08,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 12:05:08,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 12:05:08,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 12:05:08,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 12:05:08,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08" (1/1) ... [2022-12-12 12:05:08,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08" (1/1) ... [2022-12-12 12:05:08,416 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-12 12:05:08,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 12:05:08,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 12:05:08,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 12:05:08,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 12:05:08,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08" (1/1) ... [2022-12-12 12:05:08,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08" (1/1) ... [2022-12-12 12:05:08,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08" (1/1) ... [2022-12-12 12:05:08,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08" (1/1) ... [2022-12-12 12:05:08,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08" (1/1) ... [2022-12-12 12:05:08,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08" (1/1) ... [2022-12-12 12:05:08,450 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08" (1/1) ... [2022-12-12 12:05:08,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08" (1/1) ... [2022-12-12 12:05:08,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 12:05:08,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 12:05:08,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 12:05:08,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 12:05:08,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08" (1/1) ... [2022-12-12 12:05:08,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:05:08,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 12:05:08,481 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-12 12:05:08,487 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-12 12:05:08,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 12:05:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 12:05:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 12:05:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 12:05:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 12:05:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 12:05:08,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 12:05:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 12:05:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 12:05:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 12:05:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 12:05:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 12:05:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 12:05:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 12:05:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 12:05:08,512 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 12:05:08,659 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 12:05:08,660 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 12:05:08,905 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 12:05:08,971 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 12:05:08,972 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 12:05:08,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:05:08 BoogieIcfgContainer [2022-12-12 12:05:08,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 12:05:08,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 12:05:08,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 12:05:08,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 12:05:08,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 12:05:07" (1/3) ... [2022-12-12 12:05:08,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fcb9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:05:08, skipping insertion in model container [2022-12-12 12:05:08,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:05:08" (2/3) ... [2022-12-12 12:05:08,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fcb9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:05:08, skipping insertion in model container [2022-12-12 12:05:08,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:05:08" (3/3) ... [2022-12-12 12:05:08,979 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 12:05:09,014 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 12:05:09,014 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 12:05:09,015 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 12:05:09,057 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 12:05:09,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 12:05:09,134 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 12:05:09,134 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 12:05:09,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-12 12:05:09,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 12:05:09,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-12 12:05:09,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 12:05:09,160 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;@76cae835, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 12:05:09,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 12:05:09,181 INFO L130 PetriNetUnfolder]: 0/68 cut-off events. [2022-12-12 12:05:09,182 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 12:05:09,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:09,183 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] [2022-12-12 12:05:09,183 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:09,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:09,187 INFO L85 PathProgramCache]: Analyzing trace with hash 522631231, now seen corresponding path program 1 times [2022-12-12 12:05:09,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:09,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835480211] [2022-12-12 12:05:09,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:09,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:05:09,600 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-12 12:05:09,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:05:09,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835480211] [2022-12-12 12:05:09,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835480211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:05:09,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:05:09,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 12:05:09,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521293953] [2022-12-12 12:05:09,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:05:09,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 12:05:09,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:05:09,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 12:05:09,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 12:05:09,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2022-12-12 12:05:09,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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-12 12:05:09,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:05:09,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2022-12-12 12:05:09,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:05:09,728 INFO L130 PetriNetUnfolder]: 10/165 cut-off events. [2022-12-12 12:05:09,728 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 12:05:09,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 165 events. 10/165 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 328 event pairs, 4 based on Foata normal form. 5/161 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2022-12-12 12:05:09,732 INFO L137 encePairwiseOnDemand]: 101/106 looper letters, 8 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2022-12-12 12:05:09,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 101 transitions, 231 flow [2022-12-12 12:05:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 12:05:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 12:05:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-12-12 12:05:09,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9339622641509434 [2022-12-12 12:05:09,747 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2022-12-12 12:05:09,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 101 transitions, 231 flow [2022-12-12 12:05:09,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 101 transitions, 224 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-12 12:05:09,751 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 101 transitions, 224 flow [2022-12-12 12:05:09,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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-12 12:05:09,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:09,752 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-12 12:05:09,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 12:05:09,752 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -890217232, now seen corresponding path program 1 times [2022-12-12 12:05:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:09,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233951758] [2022-12-12 12:05:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:05:10,022 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-12 12:05:10,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:05:10,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233951758] [2022-12-12 12:05:10,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233951758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:05:10,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:05:10,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 12:05:10,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353408055] [2022-12-12 12:05:10,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:05:10,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 12:05:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:05:10,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 12:05:10,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 12:05:10,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-12 12:05:10,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 101 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 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-12 12:05:10,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:05:10,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-12 12:05:10,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:05:10,568 INFO L130 PetriNetUnfolder]: 673/2013 cut-off events. [2022-12-12 12:05:10,568 INFO L131 PetriNetUnfolder]: For 334/648 co-relation queries the response was YES. [2022-12-12 12:05:10,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3577 conditions, 2013 events. 673/2013 cut-off events. For 334/648 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15793 event pairs, 113 based on Foata normal form. 3/1952 useless extension candidates. Maximal degree in co-relation 3526. Up to 496 conditions per place. [2022-12-12 12:05:10,600 INFO L137 encePairwiseOnDemand]: 97/106 looper letters, 30 selfloop transitions, 6 changer transitions 62/168 dead transitions. [2022-12-12 12:05:10,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 168 transitions, 602 flow [2022-12-12 12:05:10,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 12:05:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 12:05:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 819 transitions. [2022-12-12 12:05:10,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8584905660377359 [2022-12-12 12:05:10,603 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places. [2022-12-12 12:05:10,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 168 transitions, 602 flow [2022-12-12 12:05:10,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 168 transitions, 594 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-12 12:05:10,606 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 168 transitions, 594 flow [2022-12-12 12:05:10,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 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-12 12:05:10,607 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:10,607 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] [2022-12-12 12:05:10,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 12:05:10,607 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:10,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2049478961, now seen corresponding path program 1 times [2022-12-12 12:05:10,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:10,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68236016] [2022-12-12 12:05:10,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:10,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:05:10,832 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-12 12:05:10,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:05:10,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68236016] [2022-12-12 12:05:10,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68236016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:05:10,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:05:10,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 12:05:10,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314395236] [2022-12-12 12:05:10,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:05:10,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 12:05:10,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:05:10,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 12:05:10,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 12:05:10,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-12 12:05:10,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 168 transitions, 594 flow. Second operand has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 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-12 12:05:10,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:05:10,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-12 12:05:10,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:05:11,368 INFO L130 PetriNetUnfolder]: 1796/4369 cut-off events. [2022-12-12 12:05:11,368 INFO L131 PetriNetUnfolder]: For 2783/2931 co-relation queries the response was YES. [2022-12-12 12:05:11,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9577 conditions, 4369 events. 1796/4369 cut-off events. For 2783/2931 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 35928 event pairs, 105 based on Foata normal form. 75/4259 useless extension candidates. Maximal degree in co-relation 9526. Up to 1088 conditions per place. [2022-12-12 12:05:11,388 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 58 selfloop transitions, 9 changer transitions 53/227 dead transitions. [2022-12-12 12:05:11,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 227 transitions, 1076 flow [2022-12-12 12:05:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 12:05:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 12:05:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 913 transitions. [2022-12-12 12:05:11,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8613207547169811 [2022-12-12 12:05:11,391 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 14 predicate places. [2022-12-12 12:05:11,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 227 transitions, 1076 flow [2022-12-12 12:05:11,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 227 transitions, 1048 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-12 12:05:11,395 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 227 transitions, 1048 flow [2022-12-12 12:05:11,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 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-12 12:05:11,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:11,396 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] [2022-12-12 12:05:11,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 12:05:11,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:11,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash -287078866, now seen corresponding path program 1 times [2022-12-12 12:05:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:11,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462207117] [2022-12-12 12:05:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:11,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:05:11,540 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-12 12:05:11,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:05:11,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462207117] [2022-12-12 12:05:11,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462207117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:05:11,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:05:11,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:05:11,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133294806] [2022-12-12 12:05:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:05:11,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:05:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:05:11,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:05:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:05:11,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-12 12:05:11,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 227 transitions, 1048 flow. Second operand has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 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-12 12:05:11,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:05:11,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-12 12:05:11,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:05:11,981 INFO L130 PetriNetUnfolder]: 1250/3120 cut-off events. [2022-12-12 12:05:11,981 INFO L131 PetriNetUnfolder]: For 2573/2921 co-relation queries the response was YES. [2022-12-12 12:05:11,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8811 conditions, 3120 events. 1250/3120 cut-off events. For 2573/2921 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 25061 event pairs, 46 based on Foata normal form. 195/3220 useless extension candidates. Maximal degree in co-relation 8758. Up to 671 conditions per place. [2022-12-12 12:05:11,992 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 78 selfloop transitions, 28 changer transitions 128/322 dead transitions. [2022-12-12 12:05:11,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 322 transitions, 2080 flow [2022-12-12 12:05:11,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:05:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:05:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1189 transitions. [2022-12-12 12:05:11,995 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.862844702467344 [2022-12-12 12:05:11,996 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 25 predicate places. [2022-12-12 12:05:11,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 322 transitions, 2080 flow [2022-12-12 12:05:12,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 322 transitions, 1942 flow, removed 61 selfloop flow, removed 4 redundant places. [2022-12-12 12:05:12,002 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 322 transitions, 1942 flow [2022-12-12 12:05:12,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 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-12 12:05:12,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:12,003 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] [2022-12-12 12:05:12,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 12:05:12,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:12,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1216898596, now seen corresponding path program 1 times [2022-12-12 12:05:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:12,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488269621] [2022-12-12 12:05:12,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:12,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:05:12,192 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-12 12:05:12,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:05:12,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488269621] [2022-12-12 12:05:12,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488269621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:05:12,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:05:12,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 12:05:12,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698653365] [2022-12-12 12:05:12,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:05:12,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 12:05:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:05:12,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 12:05:12,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-12 12:05:12,194 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-12 12:05:12,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 322 transitions, 1942 flow. Second operand has 8 states, 8 states have (on average 82.25) internal successors, (658), 8 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:05:12,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:05:12,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-12 12:05:12,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:05:13,002 INFO L130 PetriNetUnfolder]: 2439/5682 cut-off events. [2022-12-12 12:05:13,002 INFO L131 PetriNetUnfolder]: For 8556/10277 co-relation queries the response was YES. [2022-12-12 12:05:13,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17121 conditions, 5682 events. 2439/5682 cut-off events. For 8556/10277 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 49088 event pairs, 43 based on Foata normal form. 581/6145 useless extension candidates. Maximal degree in co-relation 17064. Up to 1258 conditions per place. [2022-12-12 12:05:13,022 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 92 selfloop transitions, 19 changer transitions 311/536 dead transitions. [2022-12-12 12:05:13,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 536 transitions, 4426 flow [2022-12-12 12:05:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-12 12:05:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-12 12:05:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1557 transitions. [2022-12-12 12:05:13,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8160377358490566 [2022-12-12 12:05:13,028 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 38 predicate places. [2022-12-12 12:05:13,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 536 transitions, 4426 flow [2022-12-12 12:05:13,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 536 transitions, 4074 flow, removed 176 selfloop flow, removed 0 redundant places. [2022-12-12 12:05:13,042 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 536 transitions, 4074 flow [2022-12-12 12:05:13,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.25) internal successors, (658), 8 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:05:13,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:13,043 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] [2022-12-12 12:05:13,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 12:05:13,043 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:13,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:13,044 INFO L85 PathProgramCache]: Analyzing trace with hash 57099626, now seen corresponding path program 2 times [2022-12-12 12:05:13,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:13,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251361950] [2022-12-12 12:05:13,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:13,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:05:13,229 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-12 12:05:13,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:05:13,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251361950] [2022-12-12 12:05:13,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251361950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:05:13,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:05:13,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 12:05:13,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334489895] [2022-12-12 12:05:13,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:05:13,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 12:05:13,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:05:13,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 12:05:13,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 12:05:13,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-12 12:05:13,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 536 transitions, 4074 flow. Second operand has 8 states, 8 states have (on average 85.75) internal successors, (686), 8 states have internal predecessors, (686), 0 states have call successors, (0), 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-12 12:05:13,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:05:13,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-12 12:05:13,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:05:13,919 INFO L130 PetriNetUnfolder]: 2282/4970 cut-off events. [2022-12-12 12:05:13,919 INFO L131 PetriNetUnfolder]: For 7617/9564 co-relation queries the response was YES. [2022-12-12 12:05:13,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18471 conditions, 4970 events. 2282/4970 cut-off events. For 7617/9564 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 42401 event pairs, 45 based on Foata normal form. 600/5476 useless extension candidates. Maximal degree in co-relation 18415. Up to 1147 conditions per place. [2022-12-12 12:05:13,938 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 46 selfloop transitions, 20 changer transitions 362/503 dead transitions. [2022-12-12 12:05:13,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 503 transitions, 4676 flow [2022-12-12 12:05:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 12:05:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 12:05:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1434 transitions. [2022-12-12 12:05:13,941 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8455188679245284 [2022-12-12 12:05:13,941 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 44 predicate places. [2022-12-12 12:05:13,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 503 transitions, 4676 flow [2022-12-12 12:05:13,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 503 transitions, 4232 flow, removed 195 selfloop flow, removed 7 redundant places. [2022-12-12 12:05:13,956 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 503 transitions, 4232 flow [2022-12-12 12:05:13,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.75) internal successors, (686), 8 states have internal predecessors, (686), 0 states have call successors, (0), 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-12 12:05:13,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:13,957 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-12 12:05:13,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 12:05:13,957 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash 200791002, now seen corresponding path program 1 times [2022-12-12 12:05:13,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:13,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548901781] [2022-12-12 12:05:13,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:05:14,125 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-12 12:05:14,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:05:14,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548901781] [2022-12-12 12:05:14,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548901781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:05:14,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:05:14,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:05:14,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803321424] [2022-12-12 12:05:14,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:05:14,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:05:14,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:05:14,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:05:14,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:05:14,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-12 12:05:14,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 503 transitions, 4232 flow. Second operand has 7 states, 7 states have (on average 84.71428571428571) internal successors, (593), 7 states have internal predecessors, (593), 0 states have call successors, (0), 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-12 12:05:14,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:05:14,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-12 12:05:14,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:05:14,524 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([305] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][137], [120#true, 235#(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)), 44#L761true, 66#L754true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 151#(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)), 117#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 244#true, 98#L810true, 48#L3true]) [2022-12-12 12:05:14,524 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:05:14,524 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:05:14,525 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:05:14,525 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:05:14,525 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([310] L761-->L779: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_96 256) 0)) (.cse5 (and .cse10 .cse2)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_83 256) 0) .cse10))) (let ((.cse7 (or .cse12 .cse5 .cse6)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse7 v_~y~0_53 (ite .cse8 v_~y$w_buff0~0_34 v_~y$w_buff1~0_25))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_82 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_95 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_34) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse1 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1_used~0_82 (ite .cse0 v_~y$w_buff1_used~0_83 (ite (or .cse3 .cse5 .cse6) v_~y$w_buff1_used~0_83 0))) (= (ite .cse0 v_~y$w_buff0_used~0_96 (ite .cse7 v_~y$w_buff0_used~0_96 (ite .cse8 0 v_~y$w_buff0_used~0_96))) v_~y$w_buff0_used~0_95) (= .cse9 v_~__unbuffered_p1_EAX~0_18) (= v_~y$w_buff1~0_25 v_~y$w_buff1~0_24) (= v_~y$w_buff0~0_34 v_~y$w_buff0~0_33) (= v_~y~0_52 (ite .cse0 v_~y$mem_tmp~0_20 .cse9)) (= v_~y~0_53 v_~y$mem_tmp~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse3 .cse5 (and .cse4 .cse10)) v_~y$r_buff0_thd2~0_42 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd2~0_42))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_25, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][243], [120#true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 231#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 63#L749true, 244#true, 84#L779true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 98#L810true, 117#true, 48#L3true, P1Thread1of1ForFork2InUse]) [2022-12-12 12:05:14,525 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:05:14,525 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:05:14,525 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:05:14,525 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:05:14,584 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([305] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][137], [120#true, 235#(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)), 44#L761true, 66#L754true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 151#(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)), 117#true, 105#L3-1true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 244#true, 98#L810true]) [2022-12-12 12:05:14,584 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,584 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,584 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,584 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,585 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([310] L761-->L779: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_96 256) 0)) (.cse5 (and .cse10 .cse2)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_83 256) 0) .cse10))) (let ((.cse7 (or .cse12 .cse5 .cse6)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse7 v_~y~0_53 (ite .cse8 v_~y$w_buff0~0_34 v_~y$w_buff1~0_25))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_82 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_95 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_34) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse1 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1_used~0_82 (ite .cse0 v_~y$w_buff1_used~0_83 (ite (or .cse3 .cse5 .cse6) v_~y$w_buff1_used~0_83 0))) (= (ite .cse0 v_~y$w_buff0_used~0_96 (ite .cse7 v_~y$w_buff0_used~0_96 (ite .cse8 0 v_~y$w_buff0_used~0_96))) v_~y$w_buff0_used~0_95) (= .cse9 v_~__unbuffered_p1_EAX~0_18) (= v_~y$w_buff1~0_25 v_~y$w_buff1~0_24) (= v_~y$w_buff0~0_34 v_~y$w_buff0~0_33) (= v_~y~0_52 (ite .cse0 v_~y$mem_tmp~0_20 .cse9)) (= v_~y~0_53 v_~y$mem_tmp~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse3 .cse5 (and .cse4 .cse10)) v_~y$r_buff0_thd2~0_42 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd2~0_42))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_25, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][243], [120#true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 231#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 63#L749true, 244#true, 84#L779true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 98#L810true, 117#true, 105#L3-1true, P1Thread1of1ForFork2InUse]) [2022-12-12 12:05:14,585 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,585 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,585 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,585 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,585 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([305] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][301], [120#true, 44#L761true, 88#L813true, 66#L754true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 151#(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)), 117#true, 239#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 174#(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)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 244#true, 48#L3true]) [2022-12-12 12:05:14,585 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,585 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,586 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,586 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,586 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([310] L761-->L779: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_96 256) 0)) (.cse5 (and .cse10 .cse2)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_83 256) 0) .cse10))) (let ((.cse7 (or .cse12 .cse5 .cse6)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse7 v_~y~0_53 (ite .cse8 v_~y$w_buff0~0_34 v_~y$w_buff1~0_25))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_82 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_95 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_34) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse1 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1_used~0_82 (ite .cse0 v_~y$w_buff1_used~0_83 (ite (or .cse3 .cse5 .cse6) v_~y$w_buff1_used~0_83 0))) (= (ite .cse0 v_~y$w_buff0_used~0_96 (ite .cse7 v_~y$w_buff0_used~0_96 (ite .cse8 0 v_~y$w_buff0_used~0_96))) v_~y$w_buff0_used~0_95) (= .cse9 v_~__unbuffered_p1_EAX~0_18) (= v_~y$w_buff1~0_25 v_~y$w_buff1~0_24) (= v_~y$w_buff0~0_34 v_~y$w_buff0~0_33) (= v_~y~0_52 (ite .cse0 v_~y$mem_tmp~0_20 .cse9)) (= v_~y~0_53 v_~y$mem_tmp~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse3 .cse5 (and .cse4 .cse10)) v_~y$r_buff0_thd2~0_42 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd2~0_42))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_25, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][341], [120#true, 235#(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)), 88#L813true, 63#L749true, 84#L779true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 117#true, 151#(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)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 244#true, 48#L3true]) [2022-12-12 12:05:14,586 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,586 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,586 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,586 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:14,675 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([305] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][301], [120#true, 44#L761true, 88#L813true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 66#L754true, 117#true, 151#(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)), 105#L3-1true, 239#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 174#(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)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 244#true]) [2022-12-12 12:05:14,675 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-12 12:05:14,676 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 12:05:14,676 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 12:05:14,676 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 12:05:14,676 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([310] L761-->L779: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_96 256) 0)) (.cse5 (and .cse10 .cse2)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_83 256) 0) .cse10))) (let ((.cse7 (or .cse12 .cse5 .cse6)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse7 v_~y~0_53 (ite .cse8 v_~y$w_buff0~0_34 v_~y$w_buff1~0_25))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_82 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_95 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_34) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse1 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1_used~0_82 (ite .cse0 v_~y$w_buff1_used~0_83 (ite (or .cse3 .cse5 .cse6) v_~y$w_buff1_used~0_83 0))) (= (ite .cse0 v_~y$w_buff0_used~0_96 (ite .cse7 v_~y$w_buff0_used~0_96 (ite .cse8 0 v_~y$w_buff0_used~0_96))) v_~y$w_buff0_used~0_95) (= .cse9 v_~__unbuffered_p1_EAX~0_18) (= v_~y$w_buff1~0_25 v_~y$w_buff1~0_24) (= v_~y$w_buff0~0_34 v_~y$w_buff0~0_33) (= v_~y~0_52 (ite .cse0 v_~y$mem_tmp~0_20 .cse9)) (= v_~y~0_53 v_~y$mem_tmp~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse3 .cse5 (and .cse4 .cse10)) v_~y$r_buff0_thd2~0_42 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd2~0_42))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_25, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][341], [120#true, 235#(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)), 88#L813true, 63#L749true, 84#L779true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 117#true, 151#(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)), 105#L3-1true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 244#true]) [2022-12-12 12:05:14,676 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-12 12:05:14,676 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 12:05:14,676 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 12:05:14,676 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 12:05:14,794 INFO L130 PetriNetUnfolder]: 3151/6685 cut-off events. [2022-12-12 12:05:14,794 INFO L131 PetriNetUnfolder]: For 13856/16576 co-relation queries the response was YES. [2022-12-12 12:05:14,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23862 conditions, 6685 events. 3151/6685 cut-off events. For 13856/16576 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 60433 event pairs, 48 based on Foata normal form. 638/7125 useless extension candidates. Maximal degree in co-relation 23803. Up to 1563 conditions per place. [2022-12-12 12:05:14,813 INFO L137 encePairwiseOnDemand]: 98/106 looper letters, 23 selfloop transitions, 3 changer transitions 515/616 dead transitions. [2022-12-12 12:05:14,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 616 transitions, 6266 flow [2022-12-12 12:05:14,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 12:05:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 12:05:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 611 transitions. [2022-12-12 12:05:14,815 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8234501347708895 [2022-12-12 12:05:14,816 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 43 predicate places. [2022-12-12 12:05:14,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 616 transitions, 6266 flow [2022-12-12 12:05:14,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 616 transitions, 5714 flow, removed 276 selfloop flow, removed 0 redundant places. [2022-12-12 12:05:14,837 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 616 transitions, 5714 flow [2022-12-12 12:05:14,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.71428571428571) internal successors, (593), 7 states have internal predecessors, (593), 0 states have call successors, (0), 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-12 12:05:14,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:14,837 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-12 12:05:14,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 12:05:14,838 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:14,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2133447726, now seen corresponding path program 2 times [2022-12-12 12:05:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:14,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505233006] [2022-12-12 12:05:14,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:05:15,237 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-12 12:05:15,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:05:15,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505233006] [2022-12-12 12:05:15,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505233006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:05:15,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:05:15,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 12:05:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401095392] [2022-12-12 12:05:15,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:05:15,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 12:05:15,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:05:15,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 12:05:15,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-12 12:05:15,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 106 [2022-12-12 12:05:15,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 616 transitions, 5714 flow. Second operand has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 states have internal predecessors, (749), 0 states have call successors, (0), 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-12 12:05:15,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:05:15,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 106 [2022-12-12 12:05:15,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:05:15,779 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([305] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][173], [120#true, 235#(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)), 44#L761true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 66#L754true, 117#true, 151#(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)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 244#true, 98#L810true, 48#L3true, 261#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1))]) [2022-12-12 12:05:15,779 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:05:15,779 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:05:15,779 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:05:15,779 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:05:15,853 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([310] L761-->L779: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_96 256) 0)) (.cse5 (and .cse10 .cse2)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_83 256) 0) .cse10))) (let ((.cse7 (or .cse12 .cse5 .cse6)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse7 v_~y~0_53 (ite .cse8 v_~y$w_buff0~0_34 v_~y$w_buff1~0_25))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_82 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_95 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_34) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse1 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1_used~0_82 (ite .cse0 v_~y$w_buff1_used~0_83 (ite (or .cse3 .cse5 .cse6) v_~y$w_buff1_used~0_83 0))) (= (ite .cse0 v_~y$w_buff0_used~0_96 (ite .cse7 v_~y$w_buff0_used~0_96 (ite .cse8 0 v_~y$w_buff0_used~0_96))) v_~y$w_buff0_used~0_95) (= .cse9 v_~__unbuffered_p1_EAX~0_18) (= v_~y$w_buff1~0_25 v_~y$w_buff1~0_24) (= v_~y$w_buff0~0_34 v_~y$w_buff0~0_33) (= v_~y~0_52 (ite .cse0 v_~y$mem_tmp~0_20 .cse9)) (= v_~y~0_53 v_~y$mem_tmp~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse3 .cse5 (and .cse4 .cse10)) v_~y$r_buff0_thd2~0_42 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd2~0_42))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_25, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][376], [120#true, 63#L749true, 84#L779true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 117#true, 267#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 231#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 244#true, 98#L810true, 48#L3true]) [2022-12-12 12:05:15,853 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event [2022-12-12 12:05:15,853 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-12 12:05:15,853 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-12 12:05:15,853 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-12 12:05:15,855 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([305] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][173], [120#true, 235#(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)), 44#L761true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 66#L754true, 117#true, 151#(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)), 105#L3-1true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 244#true, 98#L810true, 261#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1))]) [2022-12-12 12:05:15,855 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-12 12:05:15,855 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:15,855 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:15,855 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:15,856 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([305] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][321], [120#true, 44#L761true, 88#L813true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 66#L754true, 117#true, 151#(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)), 239#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 174#(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)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 244#true, 48#L3true, 261#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1))]) [2022-12-12 12:05:15,856 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-12 12:05:15,856 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:15,856 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:15,856 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:15,856 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([310] L761-->L779: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_96 256) 0)) (.cse5 (and .cse10 .cse2)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_83 256) 0) .cse10))) (let ((.cse7 (or .cse12 .cse5 .cse6)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse7 v_~y~0_53 (ite .cse8 v_~y$w_buff0~0_34 v_~y$w_buff1~0_25))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_82 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_95 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_34) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse1 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1_used~0_82 (ite .cse0 v_~y$w_buff1_used~0_83 (ite (or .cse3 .cse5 .cse6) v_~y$w_buff1_used~0_83 0))) (= (ite .cse0 v_~y$w_buff0_used~0_96 (ite .cse7 v_~y$w_buff0_used~0_96 (ite .cse8 0 v_~y$w_buff0_used~0_96))) v_~y$w_buff0_used~0_95) (= .cse9 v_~__unbuffered_p1_EAX~0_18) (= v_~y$w_buff1~0_25 v_~y$w_buff1~0_24) (= v_~y$w_buff0~0_34 v_~y$w_buff0~0_33) (= v_~y~0_52 (ite .cse0 v_~y$mem_tmp~0_20 .cse9)) (= v_~y~0_53 v_~y$mem_tmp~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse3 .cse5 (and .cse4 .cse10)) v_~y$r_buff0_thd2~0_42 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd2~0_42))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_25, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][379], [120#true, 235#(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)), 88#L813true, 63#L749true, 84#L779true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 117#true, 151#(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)), 267#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 244#true, 48#L3true]) [2022-12-12 12:05:15,856 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-12 12:05:15,856 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:15,856 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:15,856 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:05:15,919 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([310] L761-->L779: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_96 256) 0)) (.cse5 (and .cse10 .cse2)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_83 256) 0) .cse10))) (let ((.cse7 (or .cse12 .cse5 .cse6)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse7 v_~y~0_53 (ite .cse8 v_~y$w_buff0~0_34 v_~y$w_buff1~0_25))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_82 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_95 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_34) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse1 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1_used~0_82 (ite .cse0 v_~y$w_buff1_used~0_83 (ite (or .cse3 .cse5 .cse6) v_~y$w_buff1_used~0_83 0))) (= (ite .cse0 v_~y$w_buff0_used~0_96 (ite .cse7 v_~y$w_buff0_used~0_96 (ite .cse8 0 v_~y$w_buff0_used~0_96))) v_~y$w_buff0_used~0_95) (= .cse9 v_~__unbuffered_p1_EAX~0_18) (= v_~y$w_buff1~0_25 v_~y$w_buff1~0_24) (= v_~y$w_buff0~0_34 v_~y$w_buff0~0_33) (= v_~y~0_52 (ite .cse0 v_~y$mem_tmp~0_20 .cse9)) (= v_~y~0_53 v_~y$mem_tmp~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse3 .cse5 (and .cse4 .cse10)) v_~y$r_buff0_thd2~0_42 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd2~0_42))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_25, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][376], [120#true, 63#L749true, 84#L779true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 117#true, 105#L3-1true, 267#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 231#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 244#true, 98#L810true]) [2022-12-12 12:05:15,919 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-12-12 12:05:15,919 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-12 12:05:15,919 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-12 12:05:15,919 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-12 12:05:15,920 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([305] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][321], [120#true, 44#L761true, 88#L813true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 66#L754true, 117#true, 151#(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)), 239#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 105#L3-1true, 174#(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)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 244#true, 261#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1))]) [2022-12-12 12:05:15,920 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-12 12:05:15,920 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 12:05:15,921 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 12:05:15,921 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 12:05:15,921 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([310] L761-->L779: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_96 256) 0)) (.cse5 (and .cse10 .cse2)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_83 256) 0) .cse10))) (let ((.cse7 (or .cse12 .cse5 .cse6)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse7 v_~y~0_53 (ite .cse8 v_~y$w_buff0~0_34 v_~y$w_buff1~0_25))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_82 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_95 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_34) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse1 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1_used~0_82 (ite .cse0 v_~y$w_buff1_used~0_83 (ite (or .cse3 .cse5 .cse6) v_~y$w_buff1_used~0_83 0))) (= (ite .cse0 v_~y$w_buff0_used~0_96 (ite .cse7 v_~y$w_buff0_used~0_96 (ite .cse8 0 v_~y$w_buff0_used~0_96))) v_~y$w_buff0_used~0_95) (= .cse9 v_~__unbuffered_p1_EAX~0_18) (= v_~y$w_buff1~0_25 v_~y$w_buff1~0_24) (= v_~y$w_buff0~0_34 v_~y$w_buff0~0_33) (= v_~y~0_52 (ite .cse0 v_~y$mem_tmp~0_20 .cse9)) (= v_~y~0_53 v_~y$mem_tmp~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse3 .cse5 (and .cse4 .cse10)) v_~y$r_buff0_thd2~0_42 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd2~0_42))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_25, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][379], [120#true, 235#(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)), 88#L813true, 63#L749true, 84#L779true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 117#true, 151#(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)), 105#L3-1true, 267#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 244#true]) [2022-12-12 12:05:15,921 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-12 12:05:15,921 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 12:05:15,921 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 12:05:15,921 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 12:05:16,120 INFO L130 PetriNetUnfolder]: 3620/8324 cut-off events. [2022-12-12 12:05:16,120 INFO L131 PetriNetUnfolder]: For 17800/19708 co-relation queries the response was YES. [2022-12-12 12:05:16,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28568 conditions, 8324 events. 3620/8324 cut-off events. For 17800/19708 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 82317 event pairs, 61 based on Foata normal form. 353/8529 useless extension candidates. Maximal degree in co-relation 28503. Up to 1497 conditions per place. [2022-12-12 12:05:16,164 INFO L137 encePairwiseOnDemand]: 97/106 looper letters, 17 selfloop transitions, 6 changer transitions 603/700 dead transitions. [2022-12-12 12:05:16,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 700 transitions, 7552 flow [2022-12-12 12:05:16,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 12:05:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 12:05:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 840 transitions. [2022-12-12 12:05:16,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7924528301886793 [2022-12-12 12:05:16,185 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 52 predicate places. [2022-12-12 12:05:16,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 700 transitions, 7552 flow [2022-12-12 12:05:16,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 700 transitions, 7210 flow, removed 141 selfloop flow, removed 2 redundant places. [2022-12-12 12:05:16,217 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 700 transitions, 7210 flow [2022-12-12 12:05:16,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 states have internal predecessors, (749), 0 states have call successors, (0), 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-12 12:05:16,218 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:16,218 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-12 12:05:16,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 12:05:16,218 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:16,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:16,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1860901728, now seen corresponding path program 3 times [2022-12-12 12:05:16,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:16,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126539057] [2022-12-12 12:05:16,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:16,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 12:05:16,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 12:05:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 12:05:16,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 12:05:16,300 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 12:05:16,301 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 12:05:16,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 12:05:16,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 12:05:16,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 12:05:16,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 12:05:16,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 12:05:16,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 12:05:16,305 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-12-12 12:05:16,309 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 12:05:16,309 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 12:05:16,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 12:05:16 BasicIcfg [2022-12-12 12:05:16,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 12:05:16,400 INFO L158 Benchmark]: Toolchain (without parser) took 8482.96ms. Allocated memory was 175.1MB in the beginning and 540.0MB in the end (delta: 364.9MB). Free memory was 150.6MB in the beginning and 215.3MB in the end (delta: -64.7MB). Peak memory consumption was 301.5MB. Max. memory is 8.0GB. [2022-12-12 12:05:16,401 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory was 153.4MB in the beginning and 153.3MB in the end (delta: 62.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 12:05:16,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.38ms. Allocated memory is still 175.1MB. Free memory was 150.6MB in the beginning and 124.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 12:05:16,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.47ms. Allocated memory is still 175.1MB. Free memory was 124.4MB in the beginning and 121.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 12:05:16,404 INFO L158 Benchmark]: Boogie Preprocessor took 35.47ms. Allocated memory is still 175.1MB. Free memory was 121.9MB in the beginning and 120.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 12:05:16,404 INFO L158 Benchmark]: RCFGBuilder took 520.26ms. Allocated memory is still 175.1MB. Free memory was 120.4MB in the beginning and 90.5MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-12 12:05:16,404 INFO L158 Benchmark]: TraceAbstraction took 7424.71ms. Allocated memory was 175.1MB in the beginning and 540.0MB in the end (delta: 364.9MB). Free memory was 89.4MB in the beginning and 215.3MB in the end (delta: -125.8MB). Peak memory consumption was 240.6MB. Max. memory is 8.0GB. [2022-12-12 12:05:16,406 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.13ms. Allocated memory is still 175.1MB. Free memory was 153.4MB in the beginning and 153.3MB in the end (delta: 62.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 443.38ms. Allocated memory is still 175.1MB. Free memory was 150.6MB in the beginning and 124.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.47ms. Allocated memory is still 175.1MB. Free memory was 124.4MB in the beginning and 121.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.47ms. Allocated memory is still 175.1MB. Free memory was 121.9MB in the beginning and 120.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 520.26ms. Allocated memory is still 175.1MB. Free memory was 120.4MB in the beginning and 90.5MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 7424.71ms. Allocated memory was 175.1MB in the beginning and 540.0MB in the end (delta: 364.9MB). Free memory was 89.4MB in the beginning and 215.3MB in the end (delta: -125.8MB). Peak memory consumption was 240.6MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t2577; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2577, ((void *)0), P0, ((void *)0))=-2, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t2578; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2578, ((void *)0), P1, ((void *)0))=-1, t2577={5:0}, t2578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L831] 0 pthread_t t2579; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2579, ((void *)0), P2, ((void *)0))=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - 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: 830]: 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: 832]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 526 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 526 mSDsluCounter, 404 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 830 IncrementalHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 88 mSDtfsCounter, 830 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7210occurred in iteration=8, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 1871 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 669 NumberOfCodeBlocks, 669 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 2079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-12 12:05:16,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...