/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:39:58,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:39:58,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:39:58,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:39:58,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:39:58,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:39:58,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:39:58,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:39:58,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:39:58,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:39:58,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:39:58,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:39:58,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:39:58,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:39:58,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:39:58,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:39:58,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:39:58,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:39:58,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:39:58,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:39:58,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:39:58,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:39:58,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:39:58,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:39:58,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:39:58,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:39:58,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:39:58,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:39:58,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:39:58,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:39:58,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:39:58,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:39:58,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:39:58,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:39:58,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:39:58,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:39:58,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:39:58,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:39:58,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:39:58,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:39:58,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:39:58,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 23:39:58,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:39:58,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:39:58,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:39:58,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:39:58,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:39:58,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:39:58,528 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:39:58,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:39:58,528 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:39:58,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:39:58,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:39:58,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:39:58,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:39:58,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:39:58,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:39:58,529 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:39:58,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:39:58,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:39:58,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:39:58,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:39:58,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:39:58,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:39:58,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:39:58,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:39:58,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:39:58,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:39:58,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:39:58,530 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:39:58,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:39:58,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:39:58,531 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:39:58,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:39:58,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:39:58,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:39:58,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:39:58,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:39:58,805 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:39:58,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2022-12-11 23:39:59,788 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:40:00,018 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:40:00,019 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2022-12-11 23:40:00,027 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7458d9107/87998f97c3734c3c87efd67c7bed3031/FLAGff362b468 [2022-12-11 23:40:00,039 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7458d9107/87998f97c3734c3c87efd67c7bed3031 [2022-12-11 23:40:00,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:40:00,042 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:40:00,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:40:00,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:40:00,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:40:00,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37caf1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00, skipping insertion in model container [2022-12-11 23:40:00,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:40:00,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:40:00,182 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/mix055.opt.i[944,957] [2022-12-11 23:40:00,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:40:00,379 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:40:00,387 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/mix055.opt.i[944,957] [2022-12-11 23:40:00,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:40:00,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:40:00,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:40:00,479 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:40:00,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00 WrapperNode [2022-12-11 23:40:00,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:40:00,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:40:00,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:40:00,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:40:00,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,535 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-12-11 23:40:00,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:40:00,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:40:00,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:40:00,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:40:00,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,563 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:40:00,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:40:00,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:40:00,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:40:00,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00" (1/1) ... [2022-12-11 23:40:00,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:40:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:40:00,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 23:40:00,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 23:40:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:40:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 23:40:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:40:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:40:00,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:40:00,639 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 23:40:00,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 23:40:00,639 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 23:40:00,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 23:40:00,639 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 23:40:00,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 23:40:00,639 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 23:40:00,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 23:40:00,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:40:00,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 23:40:00,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:40:00,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:40:00,641 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:40:00,818 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:40:00,819 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:40:01,086 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:40:01,254 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:40:01,254 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 23:40:01,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:40:01 BoogieIcfgContainer [2022-12-11 23:40:01,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:40:01,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:40:01,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:40:01,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:40:01,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:40:00" (1/3) ... [2022-12-11 23:40:01,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4a241c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:40:01, skipping insertion in model container [2022-12-11 23:40:01,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:40:00" (2/3) ... [2022-12-11 23:40:01,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4a241c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:40:01, skipping insertion in model container [2022-12-11 23:40:01,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:40:01" (3/3) ... [2022-12-11 23:40:01,266 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2022-12-11 23:40:01,278 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:40:01,279 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 23:40:01,279 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:40:01,333 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 23:40:01,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2022-12-11 23:40:01,420 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-11 23:40:01,420 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:40:01,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-11 23:40:01,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 126 transitions, 272 flow [2022-12-11 23:40:01,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 256 flow [2022-12-11 23:40:01,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:40:01,448 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;@20c990d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:40:01,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 23:40:01,476 INFO L130 PetriNetUnfolder]: 0/85 cut-off events. [2022-12-11 23:40:01,477 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:40:01,478 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:01,479 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] [2022-12-11 23:40:01,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:01,488 INFO L85 PathProgramCache]: Analyzing trace with hash 196817972, now seen corresponding path program 1 times [2022-12-11 23:40:01,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:01,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915495755] [2022-12-11 23:40:01,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:01,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:02,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915495755] [2022-12-11 23:40:02,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915495755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:02,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:02,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 23:40:02,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177797858] [2022-12-11 23:40:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:02,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:40:02,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:02,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:40:02,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:40:02,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 126 [2022-12-11 23:40:02,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 122 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:02,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:02,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 126 [2022-12-11 23:40:02,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:02,138 INFO L130 PetriNetUnfolder]: 17/249 cut-off events. [2022-12-11 23:40:02,138 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-11 23:40:02,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 249 events. 17/249 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 742 event pairs, 7 based on Foata normal form. 9/246 useless extension candidates. Maximal degree in co-relation 252. Up to 27 conditions per place. [2022-12-11 23:40:02,142 INFO L137 encePairwiseOnDemand]: 121/126 looper letters, 11 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-12-11 23:40:02,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 121 transitions, 280 flow [2022-12-11 23:40:02,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:40:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:40:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2022-12-11 23:40:02,153 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9365079365079365 [2022-12-11 23:40:02,155 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 0 predicate places. [2022-12-11 23:40:02,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 121 transitions, 280 flow [2022-12-11 23:40:02,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 121 transitions, 280 flow [2022-12-11 23:40:02,158 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 121 transitions, 280 flow [2022-12-11 23:40:02,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:02,158 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:02,158 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] [2022-12-11 23:40:02,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:40:02,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:02,159 INFO L85 PathProgramCache]: Analyzing trace with hash 630236051, now seen corresponding path program 1 times [2022-12-11 23:40:02,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:02,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201539698] [2022-12-11 23:40:02,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:02,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:02,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:02,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201539698] [2022-12-11 23:40:02,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201539698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:02,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:02,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:40:02,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514582602] [2022-12-11 23:40:02,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:02,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:40:02,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:03,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:40:03,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:40:03,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 126 [2022-12-11 23:40:03,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 121 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:03,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:03,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 126 [2022-12-11 23:40:03,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:04,214 INFO L130 PetriNetUnfolder]: 2798/7185 cut-off events. [2022-12-11 23:40:04,214 INFO L131 PetriNetUnfolder]: For 1121/2002 co-relation queries the response was YES. [2022-12-11 23:40:04,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12647 conditions, 7185 events. 2798/7185 cut-off events. For 1121/2002 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 67916 event pairs, 627 based on Foata normal form. 2/7009 useless extension candidates. Maximal degree in co-relation 12581. Up to 1847 conditions per place. [2022-12-11 23:40:04,248 INFO L137 encePairwiseOnDemand]: 113/126 looper letters, 48 selfloop transitions, 13 changer transitions 104/242 dead transitions. [2022-12-11 23:40:04,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 242 transitions, 959 flow [2022-12-11 23:40:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:40:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:40:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1335 transitions. [2022-12-11 23:40:04,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.815018315018315 [2022-12-11 23:40:04,253 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 12 predicate places. [2022-12-11 23:40:04,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 242 transitions, 959 flow [2022-12-11 23:40:04,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 138 transitions, 485 flow [2022-12-11 23:40:04,270 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 138 transitions, 485 flow [2022-12-11 23:40:04,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:04,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:04,271 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] [2022-12-11 23:40:04,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:40:04,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1099128846, now seen corresponding path program 1 times [2022-12-11 23:40:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:04,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568834498] [2022-12-11 23:40:04,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:04,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:04,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:04,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568834498] [2022-12-11 23:40:04,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568834498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:04,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:04,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:40:04,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85661221] [2022-12-11 23:40:04,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:04,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:40:04,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:04,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:40:04,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:40:04,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126 [2022-12-11 23:40:04,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 138 transitions, 485 flow. Second operand has 10 states, 10 states have (on average 103.5) internal successors, (1035), 10 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:04,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:04,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126 [2022-12-11 23:40:04,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:05,579 INFO L130 PetriNetUnfolder]: 1791/4044 cut-off events. [2022-12-11 23:40:05,579 INFO L131 PetriNetUnfolder]: For 2021/4771 co-relation queries the response was YES. [2022-12-11 23:40:05,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9456 conditions, 4044 events. 1791/4044 cut-off events. For 2021/4771 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 32022 event pairs, 458 based on Foata normal form. 107/4064 useless extension candidates. Maximal degree in co-relation 9383. Up to 2144 conditions per place. [2022-12-11 23:40:05,600 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 50 selfloop transitions, 16 changer transitions 74/233 dead transitions. [2022-12-11 23:40:05,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 233 transitions, 1260 flow [2022-12-11 23:40:05,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 23:40:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 23:40:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1594 transitions. [2022-12-11 23:40:05,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8433862433862434 [2022-12-11 23:40:05,604 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 5 predicate places. [2022-12-11 23:40:05,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 233 transitions, 1260 flow [2022-12-11 23:40:05,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 159 transitions, 740 flow [2022-12-11 23:40:05,617 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 159 transitions, 740 flow [2022-12-11 23:40:05,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.5) internal successors, (1035), 10 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:05,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:05,618 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:05,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:40:05,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:05,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash 760704773, now seen corresponding path program 1 times [2022-12-11 23:40:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:05,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602557850] [2022-12-11 23:40:05,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:06,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:06,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602557850] [2022-12-11 23:40:06,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602557850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:06,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:06,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:40:06,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948119862] [2022-12-11 23:40:06,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:06,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:40:06,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:06,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:40:06,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:40:06,336 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 126 [2022-12-11 23:40:06,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 159 transitions, 740 flow. Second operand has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:06,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:06,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 126 [2022-12-11 23:40:06,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:06,985 INFO L130 PetriNetUnfolder]: 1957/4254 cut-off events. [2022-12-11 23:40:06,985 INFO L131 PetriNetUnfolder]: For 3152/16158 co-relation queries the response was YES. [2022-12-11 23:40:06,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13335 conditions, 4254 events. 1957/4254 cut-off events. For 3152/16158 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 33148 event pairs, 172 based on Foata normal form. 138/4307 useless extension candidates. Maximal degree in co-relation 13250. Up to 2460 conditions per place. [2022-12-11 23:40:07,008 INFO L137 encePairwiseOnDemand]: 113/126 looper letters, 82 selfloop transitions, 29 changer transitions 83/272 dead transitions. [2022-12-11 23:40:07,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 272 transitions, 1846 flow [2022-12-11 23:40:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 23:40:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 23:40:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1124 transitions. [2022-12-11 23:40:07,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.810966810966811 [2022-12-11 23:40:07,012 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 6 predicate places. [2022-12-11 23:40:07,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 272 transitions, 1846 flow [2022-12-11 23:40:07,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 189 transitions, 1166 flow [2022-12-11 23:40:07,029 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 189 transitions, 1166 flow [2022-12-11 23:40:07,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:07,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:07,030 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:07,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:40:07,030 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:07,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1740651015, now seen corresponding path program 2 times [2022-12-11 23:40:07,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:07,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350021616] [2022-12-11 23:40:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:07,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:07,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350021616] [2022-12-11 23:40:07,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350021616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:07,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:07,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:40:07,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429677205] [2022-12-11 23:40:07,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:07,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:40:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:07,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:40:07,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:40:07,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126 [2022-12-11 23:40:07,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 189 transitions, 1166 flow. Second operand has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:07,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:07,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126 [2022-12-11 23:40:07,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:08,162 INFO L130 PetriNetUnfolder]: 1799/4038 cut-off events. [2022-12-11 23:40:08,162 INFO L131 PetriNetUnfolder]: For 6845/30141 co-relation queries the response was YES. [2022-12-11 23:40:08,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13971 conditions, 4038 events. 1799/4038 cut-off events. For 6845/30141 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 31403 event pairs, 213 based on Foata normal form. 289/4217 useless extension candidates. Maximal degree in co-relation 13879. Up to 2222 conditions per place. [2022-12-11 23:40:08,188 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 77 selfloop transitions, 25 changer transitions 62/264 dead transitions. [2022-12-11 23:40:08,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 264 transitions, 2202 flow [2022-12-11 23:40:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:40:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:40:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1692 transitions. [2022-12-11 23:40:08,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2022-12-11 23:40:08,194 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 15 predicate places. [2022-12-11 23:40:08,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 264 transitions, 2202 flow [2022-12-11 23:40:08,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 202 transitions, 1500 flow [2022-12-11 23:40:08,213 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 202 transitions, 1500 flow [2022-12-11 23:40:08,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:08,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:08,214 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:08,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:40:08,214 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:08,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash -993438511, now seen corresponding path program 1 times [2022-12-11 23:40:08,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:08,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624659967] [2022-12-11 23:40:08,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:08,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:08,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:08,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624659967] [2022-12-11 23:40:08,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624659967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:08,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:08,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:40:08,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159361003] [2022-12-11 23:40:08,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:08,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:40:08,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:08,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:40:08,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:40:08,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 126 [2022-12-11 23:40:08,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 202 transitions, 1500 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:08,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:08,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 126 [2022-12-11 23:40:08,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:10,613 INFO L130 PetriNetUnfolder]: 12473/20628 cut-off events. [2022-12-11 23:40:10,613 INFO L131 PetriNetUnfolder]: For 98934/117251 co-relation queries the response was YES. [2022-12-11 23:40:10,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78046 conditions, 20628 events. 12473/20628 cut-off events. For 98934/117251 co-relation queries the response was YES. Maximal size of possible extension queue 1529. Compared 169353 event pairs, 549 based on Foata normal form. 1171/20370 useless extension candidates. Maximal degree in co-relation 77950. Up to 8680 conditions per place. [2022-12-11 23:40:10,808 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 303 selfloop transitions, 20 changer transitions 0/440 dead transitions. [2022-12-11 23:40:10,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 440 transitions, 4659 flow [2022-12-11 23:40:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:40:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:40:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1094 transitions. [2022-12-11 23:40:10,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8682539682539683 [2022-12-11 23:40:10,814 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 15 predicate places. [2022-12-11 23:40:10,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 440 transitions, 4659 flow [2022-12-11 23:40:10,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 440 transitions, 4659 flow [2022-12-11 23:40:10,911 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 440 transitions, 4659 flow [2022-12-11 23:40:10,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:10,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:10,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:10,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:40:10,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:10,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash 82930009, now seen corresponding path program 1 times [2022-12-11 23:40:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:10,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032928661] [2022-12-11 23:40:10,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:11,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:11,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032928661] [2022-12-11 23:40:11,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032928661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:11,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:11,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:40:11,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072775830] [2022-12-11 23:40:11,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:11,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:40:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:11,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:40:11,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:40:11,087 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 126 [2022-12-11 23:40:11,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 440 transitions, 4659 flow. Second operand has 7 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:11,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:11,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 126 [2022-12-11 23:40:11,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:13,556 INFO L130 PetriNetUnfolder]: 10931/19844 cut-off events. [2022-12-11 23:40:13,557 INFO L131 PetriNetUnfolder]: For 103200/128715 co-relation queries the response was YES. [2022-12-11 23:40:13,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84115 conditions, 19844 events. 10931/19844 cut-off events. For 103200/128715 co-relation queries the response was YES. Maximal size of possible extension queue 1569. Compared 181227 event pairs, 240 based on Foata normal form. 3466/22166 useless extension candidates. Maximal degree in co-relation 84015. Up to 6904 conditions per place. [2022-12-11 23:40:13,678 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 482 selfloop transitions, 54 changer transitions 89/742 dead transitions. [2022-12-11 23:40:13,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 742 transitions, 9588 flow [2022-12-11 23:40:13,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:40:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:40:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1425 transitions. [2022-12-11 23:40:13,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.86996336996337 [2022-12-11 23:40:13,682 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 27 predicate places. [2022-12-11 23:40:13,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 742 transitions, 9588 flow [2022-12-11 23:40:13,743 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 653 transitions, 8184 flow [2022-12-11 23:40:13,743 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 653 transitions, 8184 flow [2022-12-11 23:40:13,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:13,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:13,745 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:13,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:40:13,745 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:13,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:13,745 INFO L85 PathProgramCache]: Analyzing trace with hash 855224658, now seen corresponding path program 1 times [2022-12-11 23:40:13,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:13,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581549949] [2022-12-11 23:40:13,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:13,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:13,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581549949] [2022-12-11 23:40:13,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581549949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:13,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:13,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:40:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913482639] [2022-12-11 23:40:13,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:13,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:40:13,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:13,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:40:13,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:40:13,883 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 126 [2022-12-11 23:40:13,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 653 transitions, 8184 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:13,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:13,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 126 [2022-12-11 23:40:13,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:16,997 INFO L130 PetriNetUnfolder]: 13979/25988 cut-off events. [2022-12-11 23:40:16,997 INFO L131 PetriNetUnfolder]: For 193916/219738 co-relation queries the response was YES. [2022-12-11 23:40:17,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116947 conditions, 25988 events. 13979/25988 cut-off events. For 193916/219738 co-relation queries the response was YES. Maximal size of possible extension queue 2107. Compared 251341 event pairs, 435 based on Foata normal form. 1884/26604 useless extension candidates. Maximal degree in co-relation 116843. Up to 8921 conditions per place. [2022-12-11 23:40:17,139 INFO L137 encePairwiseOnDemand]: 120/126 looper letters, 527 selfloop transitions, 7 changer transitions 166/897 dead transitions. [2022-12-11 23:40:17,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 897 transitions, 13366 flow [2022-12-11 23:40:17,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:40:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:40:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 989 transitions. [2022-12-11 23:40:17,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8721340388007055 [2022-12-11 23:40:17,142 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 35 predicate places. [2022-12-11 23:40:17,142 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 897 transitions, 13366 flow [2022-12-11 23:40:17,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 731 transitions, 10485 flow [2022-12-11 23:40:17,202 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 731 transitions, 10485 flow [2022-12-11 23:40:17,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:17,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:17,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:17,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:40:17,202 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:17,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:17,203 INFO L85 PathProgramCache]: Analyzing trace with hash -547323016, now seen corresponding path program 1 times [2022-12-11 23:40:17,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:17,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719070187] [2022-12-11 23:40:17,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:17,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:17,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:17,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719070187] [2022-12-11 23:40:17,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719070187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:17,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:17,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:40:17,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579837939] [2022-12-11 23:40:17,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:17,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:40:17,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:17,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:40:17,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:40:17,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 126 [2022-12-11 23:40:17,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 731 transitions, 10485 flow. Second operand has 8 states, 8 states have (on average 103.125) internal successors, (825), 8 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:17,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:17,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 126 [2022-12-11 23:40:17,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:20,966 INFO L130 PetriNetUnfolder]: 11797/23282 cut-off events. [2022-12-11 23:40:20,966 INFO L131 PetriNetUnfolder]: For 163766/193016 co-relation queries the response was YES. [2022-12-11 23:40:21,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113685 conditions, 23282 events. 11797/23282 cut-off events. For 163766/193016 co-relation queries the response was YES. Maximal size of possible extension queue 2004. Compared 239158 event pairs, 192 based on Foata normal form. 4478/26783 useless extension candidates. Maximal degree in co-relation 113577. Up to 6969 conditions per place. [2022-12-11 23:40:21,093 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 560 selfloop transitions, 104 changer transitions 243/1022 dead transitions. [2022-12-11 23:40:21,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1022 transitions, 16668 flow [2022-12-11 23:40:21,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:40:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:40:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1755 transitions. [2022-12-11 23:40:21,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8705357142857143 [2022-12-11 23:40:21,097 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 44 predicate places. [2022-12-11 23:40:21,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 1022 transitions, 16668 flow [2022-12-11 23:40:21,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 779 transitions, 12316 flow [2022-12-11 23:40:21,143 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 779 transitions, 12316 flow [2022-12-11 23:40:21,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.125) internal successors, (825), 8 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:21,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:21,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:21,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:40:21,144 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:21,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash -344258652, now seen corresponding path program 1 times [2022-12-11 23:40:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:21,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564536013] [2022-12-11 23:40:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:21,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:21,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:21,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564536013] [2022-12-11 23:40:21,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564536013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:21,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:21,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:40:21,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828736036] [2022-12-11 23:40:21,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:21,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:40:21,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:21,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:40:21,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:40:21,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 126 [2022-12-11 23:40:21,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 779 transitions, 12316 flow. Second operand has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 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-11 23:40:21,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:21,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 126 [2022-12-11 23:40:21,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:26,962 INFO L130 PetriNetUnfolder]: 19233/38381 cut-off events. [2022-12-11 23:40:26,963 INFO L131 PetriNetUnfolder]: For 298542/359525 co-relation queries the response was YES. [2022-12-11 23:40:27,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193507 conditions, 38381 events. 19233/38381 cut-off events. For 298542/359525 co-relation queries the response was YES. Maximal size of possible extension queue 3251. Compared 426707 event pairs, 226 based on Foata normal form. 7392/44548 useless extension candidates. Maximal degree in co-relation 193385. Up to 11389 conditions per place. [2022-12-11 23:40:27,207 INFO L137 encePairwiseOnDemand]: 111/126 looper letters, 508 selfloop transitions, 118 changer transitions 576/1402 dead transitions. [2022-12-11 23:40:27,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 1402 transitions, 26603 flow [2022-12-11 23:40:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:40:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:40:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 903 transitions. [2022-12-11 23:40:27,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7962962962962963 [2022-12-11 23:40:27,210 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 52 predicate places. [2022-12-11 23:40:27,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 1402 transitions, 26603 flow [2022-12-11 23:40:27,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 826 transitions, 14120 flow [2022-12-11 23:40:27,270 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 826 transitions, 14120 flow [2022-12-11 23:40:27,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 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-11 23:40:27,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:27,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:27,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 23:40:27,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:27,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:27,271 INFO L85 PathProgramCache]: Analyzing trace with hash 203179484, now seen corresponding path program 2 times [2022-12-11 23:40:27,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:27,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518265225] [2022-12-11 23:40:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:27,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:27,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:27,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518265225] [2022-12-11 23:40:27,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518265225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:27,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:27,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 23:40:27,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169221443] [2022-12-11 23:40:27,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:27,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 23:40:27,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:27,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 23:40:27,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 23:40:27,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 126 [2022-12-11 23:40:27,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 826 transitions, 14120 flow. Second operand has 9 states, 9 states have (on average 103.0) internal successors, (927), 9 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:27,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:27,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 126 [2022-12-11 23:40:27,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:32,282 INFO L130 PetriNetUnfolder]: 11667/24271 cut-off events. [2022-12-11 23:40:32,282 INFO L131 PetriNetUnfolder]: For 184977/235848 co-relation queries the response was YES. [2022-12-11 23:40:32,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132235 conditions, 24271 events. 11667/24271 cut-off events. For 184977/235848 co-relation queries the response was YES. Maximal size of possible extension queue 2438. Compared 268164 event pairs, 121 based on Foata normal form. 7394/30421 useless extension candidates. Maximal degree in co-relation 132109. Up to 7051 conditions per place. [2022-12-11 23:40:32,434 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 345 selfloop transitions, 89 changer transitions 280/837 dead transitions. [2022-12-11 23:40:32,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 837 transitions, 15598 flow [2022-12-11 23:40:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 23:40:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 23:40:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2045 transitions. [2022-12-11 23:40:32,438 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.85421888053467 [2022-12-11 23:40:32,440 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 67 predicate places. [2022-12-11 23:40:32,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 837 transitions, 15598 flow [2022-12-11 23:40:32,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 557 transitions, 9592 flow [2022-12-11 23:40:32,476 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 557 transitions, 9592 flow [2022-12-11 23:40:32,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 103.0) internal successors, (927), 9 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:32,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:32,476 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:32,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 23:40:32,477 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:32,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:32,477 INFO L85 PathProgramCache]: Analyzing trace with hash 924557510, now seen corresponding path program 1 times [2022-12-11 23:40:32,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:32,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590600439] [2022-12-11 23:40:32,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:32,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:32,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:32,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590600439] [2022-12-11 23:40:32,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590600439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:32,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:32,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 23:40:32,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848361044] [2022-12-11 23:40:32,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:32,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 23:40:32,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 23:40:32,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-11 23:40:32,918 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 126 [2022-12-11 23:40:32,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 557 transitions, 9592 flow. Second operand has 12 states, 12 states have (on average 99.91666666666667) internal successors, (1199), 12 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:32,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:32,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 126 [2022-12-11 23:40:32,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:35,639 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([359] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][245], [281#true, 111#L847true, 24#L789true, 83#L752true, P3Thread1of1ForFork2InUse, 20#L822true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 276#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, 166#true, 320#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 329#(= ~a~0 1), 140#true, 143#true, 195#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 96#L772true, 242#true, 371#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 216#(= ~z$r_buff0_thd0~0 0), 401#(and (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~y~0 0)))]) [2022-12-11 23:40:35,639 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-11 23:40:35,640 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 23:40:35,640 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 23:40:35,640 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 23:40:35,954 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([359] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][245], [281#true, 75#L2true, 24#L789true, 83#L752true, P3Thread1of1ForFork2InUse, 20#L822true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 276#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, 166#true, 320#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 329#(= ~a~0 1), 140#true, 143#true, 195#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 96#L772true, 242#true, 371#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 216#(= ~z$r_buff0_thd0~0 0), 401#(and (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~y~0 0)))]) [2022-12-11 23:40:35,954 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-11 23:40:35,954 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 23:40:35,954 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 23:40:35,955 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 23:40:36,294 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([359] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][342], [281#true, 322#(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)), 24#L789true, 83#L752true, P3Thread1of1ForFork2InUse, 20#L822true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 373#(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)), P2Thread1of1ForFork0InUse, 166#true, 62#L3true, 329#(= ~a~0 1), 140#true, 143#true, 195#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 96#L772true, 242#true, 280#(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)), 216#(= ~z$r_buff0_thd0~0 0), 401#(and (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~y~0 0)))]) [2022-12-11 23:40:36,294 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-11 23:40:36,294 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 23:40:36,294 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 23:40:36,294 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 23:40:36,556 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([359] L767-->L772: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][395], [281#true, 24#L789true, 322#(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)), 83#L752true, P3Thread1of1ForFork2InUse, 247#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 20#L822true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 166#true, 373#(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)), 329#(= ~a~0 1), 140#true, 143#true, 195#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 96#L772true, 129#L3-1true, 280#(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)), 216#(= ~z$r_buff0_thd0~0 0), 401#(and (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~y~0 0)))]) [2022-12-11 23:40:36,556 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-11 23:40:36,556 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:40:36,557 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:40:36,557 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:40:36,767 INFO L130 PetriNetUnfolder]: 12968/30851 cut-off events. [2022-12-11 23:40:36,767 INFO L131 PetriNetUnfolder]: For 276320/344016 co-relation queries the response was YES. [2022-12-11 23:40:36,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163033 conditions, 30851 events. 12968/30851 cut-off events. For 276320/344016 co-relation queries the response was YES. Maximal size of possible extension queue 3193. Compared 390139 event pairs, 73 based on Foata normal form. 3733/33541 useless extension candidates. Maximal degree in co-relation 162898. Up to 10197 conditions per place. [2022-12-11 23:40:36,976 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 50 selfloop transitions, 5 changer transitions 711/884 dead transitions. [2022-12-11 23:40:36,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 884 transitions, 18444 flow [2022-12-11 23:40:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 23:40:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 23:40:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1422 transitions. [2022-12-11 23:40:36,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8061224489795918 [2022-12-11 23:40:36,978 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 77 predicate places. [2022-12-11 23:40:36,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 884 transitions, 18444 flow [2022-12-11 23:40:37,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 173 transitions, 1914 flow [2022-12-11 23:40:37,008 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 173 transitions, 1914 flow [2022-12-11 23:40:37,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 99.91666666666667) internal successors, (1199), 12 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:37,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:37,008 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:37,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 23:40:37,009 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:37,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:37,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1836340090, now seen corresponding path program 2 times [2022-12-11 23:40:37,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:37,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200308101] [2022-12-11 23:40:37,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:37,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:40:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:40:38,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:40:38,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200308101] [2022-12-11 23:40:38,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200308101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:40:38,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:40:38,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 23:40:38,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205248985] [2022-12-11 23:40:38,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:40:38,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 23:40:38,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:40:38,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 23:40:38,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-11 23:40:38,259 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 126 [2022-12-11 23:40:38,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 173 transitions, 1914 flow. Second operand has 12 states, 12 states have (on average 93.5) internal successors, (1122), 12 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:38,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:40:38,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 126 [2022-12-11 23:40:38,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:40:38,720 INFO L130 PetriNetUnfolder]: 515/2313 cut-off events. [2022-12-11 23:40:38,720 INFO L131 PetriNetUnfolder]: For 6738/7434 co-relation queries the response was YES. [2022-12-11 23:40:38,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10027 conditions, 2313 events. 515/2313 cut-off events. For 6738/7434 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23329 event pairs, 16 based on Foata normal form. 32/2317 useless extension candidates. Maximal degree in co-relation 9878. Up to 681 conditions per place. [2022-12-11 23:40:38,731 INFO L137 encePairwiseOnDemand]: 114/126 looper letters, 28 selfloop transitions, 14 changer transitions 51/180 dead transitions. [2022-12-11 23:40:38,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 180 transitions, 2174 flow [2022-12-11 23:40:38,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 23:40:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 23:40:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1134 transitions. [2022-12-11 23:40:38,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-11 23:40:38,734 INFO L295 CegarLoopForPetriNet]: 133 programPoint places, 62 predicate places. [2022-12-11 23:40:38,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 180 transitions, 2174 flow [2022-12-11 23:40:38,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 129 transitions, 1250 flow [2022-12-11 23:40:38,737 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 129 transitions, 1250 flow [2022-12-11 23:40:38,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 93.5) internal successors, (1122), 12 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:40:38,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:40:38,738 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:38,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 23:40:38,739 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:40:38,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:40:38,739 INFO L85 PathProgramCache]: Analyzing trace with hash 823995868, now seen corresponding path program 3 times [2022-12-11 23:40:38,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:40:38,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723717473] [2022-12-11 23:40:38,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:40:38,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:40:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:40:38,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:40:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:40:38,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:40:38,841 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:40:38,842 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 23:40:38,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 23:40:38,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 23:40:38,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 23:40:38,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 23:40:38,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 23:40:38,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 23:40:38,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 23:40:38,847 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:40:38,851 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:40:38,851 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:40:38,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:40:38 BasicIcfg [2022-12-11 23:40:38,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:40:38,956 INFO L158 Benchmark]: Toolchain (without parser) took 38914.34ms. Allocated memory was 179.3MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 154.0MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-11 23:40:38,956 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory was 155.2MB in the beginning and 155.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:40:38,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.51ms. Allocated memory is still 179.3MB. Free memory was 153.9MB in the beginning and 126.3MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-11 23:40:38,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.14ms. Allocated memory is still 179.3MB. Free memory was 126.3MB in the beginning and 123.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 23:40:38,957 INFO L158 Benchmark]: Boogie Preprocessor took 30.38ms. Allocated memory is still 179.3MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:40:38,957 INFO L158 Benchmark]: RCFGBuilder took 674.23ms. Allocated memory is still 179.3MB. Free memory was 121.5MB in the beginning and 129.0MB in the end (delta: -7.5MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-12-11 23:40:38,957 INFO L158 Benchmark]: TraceAbstraction took 37698.50ms. Allocated memory was 179.3MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 127.5MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-11 23:40:38,958 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.11ms. Allocated memory is still 179.3MB. Free memory was 155.2MB in the beginning and 155.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 436.51ms. Allocated memory is still 179.3MB. Free memory was 153.9MB in the beginning and 126.3MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.14ms. Allocated memory is still 179.3MB. Free memory was 126.3MB in the beginning and 123.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.38ms. Allocated memory is still 179.3MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 674.23ms. Allocated memory is still 179.3MB. Free memory was 121.5MB in the beginning and 129.0MB in the end (delta: -7.5MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * TraceAbstraction took 37698.50ms. Allocated memory was 179.3MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 127.5MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L725] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L726] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L727] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L728] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L729] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L730] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L731] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L732] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L733] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L734] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L735] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L736] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L737] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L738] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L739] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L740] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L741] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L742] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1461; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=-3, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1462; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=-2, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1463; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=-1, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1464; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 160 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.5s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 37.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1094 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1094 mSDsluCounter, 959 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 762 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1776 IncrementalHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 197 mSDtfsCounter, 1776 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14120occurred in iteration=10, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 46956 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1216 NumberOfCodeBlocks, 1216 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1106 ConstructedInterpolants, 0 QuantifiedInterpolants, 5393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 23:40:38,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...