/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix008.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:31:40,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:31:40,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:31:40,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:31:40,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:31:40,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:31:40,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:31:40,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:31:40,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:31:40,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:31:40,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:31:40,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:31:40,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:31:40,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:31:40,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:31:40,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:31:40,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:31:40,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:31:40,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:31:40,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:31:40,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:31:40,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:31:40,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:31:40,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:31:40,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:31:40,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:31:40,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:31:40,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:31:40,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:31:40,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:31:40,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:31:40,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:31:40,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:31:40,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:31:40,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:31:40,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:31:40,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:31:40,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:31:40,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:31:40,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:31:40,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:31:40,234 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-SemanticLbe.epf [2022-12-12 18:31:40,261 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:31:40,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:31:40,263 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:31:40,263 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:31:40,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:31:40,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:31:40,264 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:31:40,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:31:40,264 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:31:40,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:31:40,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:31:40,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:31:40,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:31:40,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:31:40,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:31:40,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:31:40,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:31:40,265 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:31:40,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:31:40,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:31:40,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:31:40,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:31:40,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:31:40,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:31:40,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:31:40,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:31:40,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:31:40,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:31:40,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:31:40,267 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:31:40,267 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 [2022-12-12 18:31:40,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:31:40,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:31:40,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:31:40,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:31:40,567 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:31:40,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008.opt.i [2022-12-12 18:31:41,540 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:31:41,763 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:31:41,764 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008.opt.i [2022-12-12 18:31:41,778 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbe89095/c7c530960ebf4fb0b5e75a8fba5ef65c/FLAG58d10a4eb [2022-12-12 18:31:42,115 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbe89095/c7c530960ebf4fb0b5e75a8fba5ef65c [2022-12-12 18:31:42,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:31:42,117 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:31:42,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:31:42,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:31:42,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:31:42,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9eddedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42, skipping insertion in model container [2022-12-12 18:31:42,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:31:42,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:31:42,289 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/mix008.opt.i[944,957] [2022-12-12 18:31:42,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:31:42,436 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:31:42,445 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/mix008.opt.i[944,957] [2022-12-12 18:31:42,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:31:42,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:31:42,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:31:42,532 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:31:42,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42 WrapperNode [2022-12-12 18:31:42,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:31:42,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:31:42,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:31:42,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:31:42,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,578 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-12-12 18:31:42,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:31:42,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:31:42,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:31:42,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:31:42,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,596 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:31:42,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:31:42,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:31:42,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:31:42,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42" (1/1) ... [2022-12-12 18:31:42,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:31:42,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:31:42,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 18:31:42,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 18:31:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:31:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:31:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:31:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:31:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:31:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:31:42,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:31:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:31:42,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:31:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:31:42,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:31:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 18:31:42,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 18:31:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:31:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:31:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:31:42,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:31:42,653 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:31:42,762 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:31:42,764 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:31:43,051 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:31:43,160 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:31:43,161 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:31:43,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:31:43 BoogieIcfgContainer [2022-12-12 18:31:43,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:31:43,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:31:43,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:31:43,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:31:43,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:31:42" (1/3) ... [2022-12-12 18:31:43,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b03e262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:31:43, skipping insertion in model container [2022-12-12 18:31:43,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:31:42" (2/3) ... [2022-12-12 18:31:43,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b03e262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:31:43, skipping insertion in model container [2022-12-12 18:31:43,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:31:43" (3/3) ... [2022-12-12 18:31:43,171 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008.opt.i [2022-12-12 18:31:43,184 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:31:43,184 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:31:43,184 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:31:43,232 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:31:43,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-12 18:31:43,315 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-12 18:31:43,315 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:31:43,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-12 18:31:43,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-12 18:31:43,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-12 18:31:43,323 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:31:43,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-12 18:31:43,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-12 18:31:43,377 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-12 18:31:43,377 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:31:43,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-12 18:31:43,382 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-12 18:31:43,382 INFO L226 LiptonReduction]: Number of co-enabled transitions 2836 [2022-12-12 18:31:48,099 INFO L241 LiptonReduction]: Total number of compositions: 100 [2022-12-12 18:31:48,109 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:31:48,114 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;@195c2335, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:31:48,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 18:31:48,118 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-12 18:31:48,118 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:31:48,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:48,119 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:48,119 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-12 18:31:48,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:48,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1999993492, now seen corresponding path program 1 times [2022-12-12 18:31:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:48,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648576234] [2022-12-12 18:31:48,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:48,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:31:48,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:48,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648576234] [2022-12-12 18:31:48,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648576234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:48,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:48,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:31:48,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684577555] [2022-12-12 18:31:48,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:48,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:31:48,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:48,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:31:48,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:31:48,572 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 67 [2022-12-12 18:31:48,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:31:48,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:48,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 67 [2022-12-12 18:31:48,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:52,705 INFO L130 PetriNetUnfolder]: 40551/58271 cut-off events. [2022-12-12 18:31:52,705 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-12 18:31:52,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112191 conditions, 58271 events. 40551/58271 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 3408. Compared 446232 event pairs, 5311 based on Foata normal form. 0/35848 useless extension candidates. Maximal degree in co-relation 112179. Up to 46041 conditions per place. [2022-12-12 18:31:52,863 INFO L137 encePairwiseOnDemand]: 61/67 looper letters, 37 selfloop transitions, 2 changer transitions 46/99 dead transitions. [2022-12-12 18:31:52,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 380 flow [2022-12-12 18:31:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:31:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:31:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-12-12 18:31:52,871 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-12 18:31:52,874 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -1 predicate places. [2022-12-12 18:31:52,874 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 99 transitions, 380 flow [2022-12-12 18:31:52,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 53 transitions, 196 flow [2022-12-12 18:31:52,942 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 196 flow [2022-12-12 18:31:52,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:31:52,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:52,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:52,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:31:52,942 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-12 18:31:52,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:52,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2143256155, now seen corresponding path program 1 times [2022-12-12 18:31:52,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:52,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638395929] [2022-12-12 18:31:52,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:52,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:31:53,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:53,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638395929] [2022-12-12 18:31:53,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638395929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:53,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:53,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:31:53,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257961134] [2022-12-12 18:31:53,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:53,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:31:53,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:53,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:31:53,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:31:53,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 67 [2022-12-12 18:31:53,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:31:53,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:53,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 67 [2022-12-12 18:31:53,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:53,999 INFO L130 PetriNetUnfolder]: 6935/10207 cut-off events. [2022-12-12 18:31:53,999 INFO L131 PetriNetUnfolder]: For 858/900 co-relation queries the response was YES. [2022-12-12 18:31:54,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28688 conditions, 10207 events. 6935/10207 cut-off events. For 858/900 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 63680 event pairs, 1399 based on Foata normal form. 160/8248 useless extension candidates. Maximal degree in co-relation 28673. Up to 7377 conditions per place. [2022-12-12 18:31:54,061 INFO L137 encePairwiseOnDemand]: 64/67 looper letters, 48 selfloop transitions, 2 changer transitions 2/65 dead transitions. [2022-12-12 18:31:54,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 346 flow [2022-12-12 18:31:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:31:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:31:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-12 18:31:54,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39800995024875624 [2022-12-12 18:31:54,063 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2022-12-12 18:31:54,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 65 transitions, 346 flow [2022-12-12 18:31:54,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 63 transitions, 338 flow [2022-12-12 18:31:54,108 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 63 transitions, 338 flow [2022-12-12 18:31:54,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:31:54,108 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:54,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:54,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:31:54,109 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-12 18:31:54,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:54,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1915066445, now seen corresponding path program 1 times [2022-12-12 18:31:54,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:54,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603916512] [2022-12-12 18:31:54,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:54,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:31:54,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:54,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603916512] [2022-12-12 18:31:54,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603916512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:54,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:54,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:31:54,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597273346] [2022-12-12 18:31:54,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:54,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:31:54,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:54,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:31:54,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:31:54,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 67 [2022-12-12 18:31:54,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 63 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:31:54,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:54,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 67 [2022-12-12 18:31:54,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:56,063 INFO L130 PetriNetUnfolder]: 17897/25900 cut-off events. [2022-12-12 18:31:56,063 INFO L131 PetriNetUnfolder]: For 11994/11994 co-relation queries the response was YES. [2022-12-12 18:31:56,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91748 conditions, 25900 events. 17897/25900 cut-off events. For 11994/11994 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 159813 event pairs, 1299 based on Foata normal form. 670/21674 useless extension candidates. Maximal degree in co-relation 91730. Up to 17227 conditions per place. [2022-12-12 18:31:56,188 INFO L137 encePairwiseOnDemand]: 58/67 looper letters, 119 selfloop transitions, 12 changer transitions 0/140 dead transitions. [2022-12-12 18:31:56,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 140 transitions, 1044 flow [2022-12-12 18:31:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:31:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:31:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-12-12 18:31:56,189 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39925373134328357 [2022-12-12 18:31:56,190 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -20 predicate places. [2022-12-12 18:31:56,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 140 transitions, 1044 flow [2022-12-12 18:31:56,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 140 transitions, 1044 flow [2022-12-12 18:31:56,280 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 140 transitions, 1044 flow [2022-12-12 18:31:56,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:31:56,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:56,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:56,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:31:56,281 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-12 18:31:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1072264899, now seen corresponding path program 1 times [2022-12-12 18:31:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:56,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097985014] [2022-12-12 18:31:56,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:56,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:31:56,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:56,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097985014] [2022-12-12 18:31:56,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097985014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:56,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:56,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:31:56,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069384558] [2022-12-12 18:31:56,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:56,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:31:56,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:56,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:31:56,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:31:56,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 67 [2022-12-12 18:31:56,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 140 transitions, 1044 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:31:56,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:56,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 67 [2022-12-12 18:31:56,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:31:58,249 INFO L130 PetriNetUnfolder]: 20100/28917 cut-off events. [2022-12-12 18:31:58,249 INFO L131 PetriNetUnfolder]: For 14179/14179 co-relation queries the response was YES. [2022-12-12 18:31:58,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129150 conditions, 28917 events. 20100/28917 cut-off events. For 14179/14179 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 180701 event pairs, 423 based on Foata normal form. 40/23610 useless extension candidates. Maximal degree in co-relation 129129. Up to 19070 conditions per place. [2022-12-12 18:31:58,448 INFO L137 encePairwiseOnDemand]: 57/67 looper letters, 200 selfloop transitions, 30 changer transitions 0/239 dead transitions. [2022-12-12 18:31:58,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 239 transitions, 2278 flow [2022-12-12 18:31:58,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:31:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:31:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-12-12 18:31:58,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4253731343283582 [2022-12-12 18:31:58,450 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -17 predicate places. [2022-12-12 18:31:58,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 239 transitions, 2278 flow [2022-12-12 18:31:58,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 239 transitions, 2278 flow [2022-12-12 18:31:58,584 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 239 transitions, 2278 flow [2022-12-12 18:31:58,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:31:58,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:31:58,584 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:31:58,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:31:58,584 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-12 18:31:58,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:31:58,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1145512449, now seen corresponding path program 1 times [2022-12-12 18:31:58,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:31:58,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794689006] [2022-12-12 18:31:58,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:31:58,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:31:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:31:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:31:58,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:31:58,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794689006] [2022-12-12 18:31:58,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794689006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:31:58,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:31:58,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:31:58,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157386856] [2022-12-12 18:31:58,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:31:58,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:31:58,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:31:58,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:31:58,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:31:58,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 67 [2022-12-12 18:31:58,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 239 transitions, 2278 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:31:58,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:31:58,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 67 [2022-12-12 18:31:58,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:02,638 INFO L130 PetriNetUnfolder]: 37000/50453 cut-off events. [2022-12-12 18:32:02,639 INFO L131 PetriNetUnfolder]: For 81203/82068 co-relation queries the response was YES. [2022-12-12 18:32:02,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256159 conditions, 50453 events. 37000/50453 cut-off events. For 81203/82068 co-relation queries the response was YES. Maximal size of possible extension queue 1729. Compared 304159 event pairs, 3372 based on Foata normal form. 492/42607 useless extension candidates. Maximal degree in co-relation 256135. Up to 43663 conditions per place. [2022-12-12 18:32:03,253 INFO L137 encePairwiseOnDemand]: 53/67 looper letters, 281 selfloop transitions, 83 changer transitions 0/388 dead transitions. [2022-12-12 18:32:03,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 388 transitions, 4488 flow [2022-12-12 18:32:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:32:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:32:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-12 18:32:03,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42786069651741293 [2022-12-12 18:32:03,254 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2022-12-12 18:32:03,254 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 388 transitions, 4488 flow [2022-12-12 18:32:03,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 388 transitions, 4488 flow [2022-12-12 18:32:03,460 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 388 transitions, 4488 flow [2022-12-12 18:32:03,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:03,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:03,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:03,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:32:03,460 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-12 18:32:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1543691666, now seen corresponding path program 1 times [2022-12-12 18:32:03,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:03,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915166682] [2022-12-12 18:32:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:32:03,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:03,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915166682] [2022-12-12 18:32:03,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915166682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:03,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:03,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:32:03,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753781514] [2022-12-12 18:32:03,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:03,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:32:03,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:03,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:32:03,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:32:03,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 67 [2022-12-12 18:32:03,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 388 transitions, 4488 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:03,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:03,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 67 [2022-12-12 18:32:03,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:10,127 INFO L130 PetriNetUnfolder]: 55940/76502 cut-off events. [2022-12-12 18:32:10,128 INFO L131 PetriNetUnfolder]: For 165621/170199 co-relation queries the response was YES. [2022-12-12 18:32:10,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452466 conditions, 76502 events. 55940/76502 cut-off events. For 165621/170199 co-relation queries the response was YES. Maximal size of possible extension queue 2654. Compared 490265 event pairs, 5936 based on Foata normal form. 2454/65100 useless extension candidates. Maximal degree in co-relation 452439. Up to 67523 conditions per place. [2022-12-12 18:32:10,549 INFO L137 encePairwiseOnDemand]: 57/67 looper letters, 512 selfloop transitions, 58 changer transitions 46/629 dead transitions. [2022-12-12 18:32:10,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 629 transitions, 8591 flow [2022-12-12 18:32:10,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:32:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:32:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-12-12 18:32:10,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43283582089552236 [2022-12-12 18:32:10,563 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -12 predicate places. [2022-12-12 18:32:10,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 629 transitions, 8591 flow [2022-12-12 18:32:10,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 583 transitions, 7947 flow [2022-12-12 18:32:10,822 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 583 transitions, 7947 flow [2022-12-12 18:32:10,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:10,822 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:10,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:10,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:32:10,823 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-12 18:32:10,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:10,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2111550022, now seen corresponding path program 1 times [2022-12-12 18:32:10,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:10,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444411017] [2022-12-12 18:32:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:32:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:10,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444411017] [2022-12-12 18:32:10,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444411017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:10,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:10,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:32:10,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467980236] [2022-12-12 18:32:10,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:10,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:32:10,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:10,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:32:10,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:32:10,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 67 [2022-12-12 18:32:10,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 583 transitions, 7947 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:10,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:10,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 67 [2022-12-12 18:32:10,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:21,234 INFO L130 PetriNetUnfolder]: 77717/107636 cut-off events. [2022-12-12 18:32:21,234 INFO L131 PetriNetUnfolder]: For 283582/291340 co-relation queries the response was YES. [2022-12-12 18:32:21,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722401 conditions, 107636 events. 77717/107636 cut-off events. For 283582/291340 co-relation queries the response was YES. Maximal size of possible extension queue 3942. Compared 742769 event pairs, 10751 based on Foata normal form. 3114/90691 useless extension candidates. Maximal degree in co-relation 722371. Up to 96165 conditions per place. [2022-12-12 18:32:21,747 INFO L137 encePairwiseOnDemand]: 57/67 looper letters, 558 selfloop transitions, 55 changer transitions 218/844 dead transitions. [2022-12-12 18:32:21,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 844 transitions, 13227 flow [2022-12-12 18:32:21,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:32:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:32:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-12-12 18:32:21,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4291044776119403 [2022-12-12 18:32:21,749 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -9 predicate places. [2022-12-12 18:32:21,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 844 transitions, 13227 flow [2022-12-12 18:32:22,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 626 transitions, 9745 flow [2022-12-12 18:32:22,006 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 626 transitions, 9745 flow [2022-12-12 18:32:22,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:22,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:22,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:22,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:32:22,007 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-12 18:32:22,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:22,007 INFO L85 PathProgramCache]: Analyzing trace with hash 224420198, now seen corresponding path program 2 times [2022-12-12 18:32:22,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:22,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271410329] [2022-12-12 18:32:22,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:22,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:32:22,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:22,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271410329] [2022-12-12 18:32:22,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271410329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:22,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:22,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:32:22,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623231939] [2022-12-12 18:32:22,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:22,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:32:22,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:22,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:32:22,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:32:22,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 67 [2022-12-12 18:32:22,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 626 transitions, 9745 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:22,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:22,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 67 [2022-12-12 18:32:22,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:28,939 INFO L130 PetriNetUnfolder]: 41537/62534 cut-off events. [2022-12-12 18:32:28,939 INFO L131 PetriNetUnfolder]: For 177165/183824 co-relation queries the response was YES. [2022-12-12 18:32:29,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469567 conditions, 62534 events. 41537/62534 cut-off events. For 177165/183824 co-relation queries the response was YES. Maximal size of possible extension queue 2929. Compared 482911 event pairs, 3935 based on Foata normal form. 3468/54255 useless extension candidates. Maximal degree in co-relation 469534. Up to 55199 conditions per place. [2022-12-12 18:32:29,234 INFO L137 encePairwiseOnDemand]: 53/67 looper letters, 423 selfloop transitions, 235 changer transitions 117/811 dead transitions. [2022-12-12 18:32:29,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 811 transitions, 14228 flow [2022-12-12 18:32:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:32:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:32:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-12-12 18:32:29,235 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44402985074626866 [2022-12-12 18:32:29,235 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -6 predicate places. [2022-12-12 18:32:29,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 811 transitions, 14228 flow [2022-12-12 18:32:29,398 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 694 transitions, 12137 flow [2022-12-12 18:32:29,398 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 694 transitions, 12137 flow [2022-12-12 18:32:29,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:29,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:29,398 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] [2022-12-12 18:32:29,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:32:29,398 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-12 18:32:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1185502885, now seen corresponding path program 1 times [2022-12-12 18:32:29,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:29,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910542734] [2022-12-12 18:32:29,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:32:29,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:29,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910542734] [2022-12-12 18:32:29,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910542734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:29,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:29,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:32:29,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943615484] [2022-12-12 18:32:29,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:29,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:32:29,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:29,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:32:29,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:32:29,559 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 67 [2022-12-12 18:32:29,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 694 transitions, 12137 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:29,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:29,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 67 [2022-12-12 18:32:29,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:33,437 INFO L130 PetriNetUnfolder]: 17932/30206 cut-off events. [2022-12-12 18:32:33,437 INFO L131 PetriNetUnfolder]: For 122742/128273 co-relation queries the response was YES. [2022-12-12 18:32:33,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251750 conditions, 30206 events. 17932/30206 cut-off events. For 122742/128273 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 251214 event pairs, 705 based on Foata normal form. 3988/28976 useless extension candidates. Maximal degree in co-relation 251714. Up to 26194 conditions per place. [2022-12-12 18:32:33,606 INFO L137 encePairwiseOnDemand]: 53/67 looper letters, 338 selfloop transitions, 289 changer transitions 94/755 dead transitions. [2022-12-12 18:32:33,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 755 transitions, 14634 flow [2022-12-12 18:32:33,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:32:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:32:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2022-12-12 18:32:33,608 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44776119402985076 [2022-12-12 18:32:33,608 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -2 predicate places. [2022-12-12 18:32:33,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 755 transitions, 14634 flow [2022-12-12 18:32:33,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 661 transitions, 12768 flow [2022-12-12 18:32:33,703 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 661 transitions, 12768 flow [2022-12-12 18:32:33,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:33,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:33,703 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] [2022-12-12 18:32:33,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:32:33,703 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-12 18:32:33,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:33,703 INFO L85 PathProgramCache]: Analyzing trace with hash 376091461, now seen corresponding path program 1 times [2022-12-12 18:32:33,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:33,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487329748] [2022-12-12 18:32:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:33,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:32:33,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:33,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487329748] [2022-12-12 18:32:33,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487329748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:33,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:33,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:32:33,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465047456] [2022-12-12 18:32:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:33,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:32:33,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:33,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:32:33,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:32:33,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 67 [2022-12-12 18:32:33,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 661 transitions, 12768 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:33,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:33,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 67 [2022-12-12 18:32:33,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:36,271 INFO L130 PetriNetUnfolder]: 11126/18510 cut-off events. [2022-12-12 18:32:36,272 INFO L131 PetriNetUnfolder]: For 104813/109172 co-relation queries the response was YES. [2022-12-12 18:32:36,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167083 conditions, 18510 events. 11126/18510 cut-off events. For 104813/109172 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 141796 event pairs, 14 based on Foata normal form. 2690/17978 useless extension candidates. Maximal degree in co-relation 167044. Up to 15591 conditions per place. [2022-12-12 18:32:36,344 INFO L137 encePairwiseOnDemand]: 53/67 looper letters, 134 selfloop transitions, 193 changer transitions 309/651 dead transitions. [2022-12-12 18:32:36,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 651 transitions, 13802 flow [2022-12-12 18:32:36,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:32:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:32:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2022-12-12 18:32:36,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39800995024875624 [2022-12-12 18:32:36,345 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2022-12-12 18:32:36,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 651 transitions, 13802 flow [2022-12-12 18:32:36,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 342 transitions, 7195 flow [2022-12-12 18:32:36,392 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 342 transitions, 7195 flow [2022-12-12 18:32:36,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:36,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:36,392 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] [2022-12-12 18:32:36,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:32:36,393 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-12 18:32:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1918626948, now seen corresponding path program 1 times [2022-12-12 18:32:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:36,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444020619] [2022-12-12 18:32:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:32:36,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:36,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444020619] [2022-12-12 18:32:36,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444020619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:36,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:36,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:32:36,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065480197] [2022-12-12 18:32:36,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:36,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:32:36,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:36,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:32:36,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:32:36,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 67 [2022-12-12 18:32:36,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 342 transitions, 7195 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:36,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:36,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 67 [2022-12-12 18:32:36,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:37,225 INFO L130 PetriNetUnfolder]: 4195/6603 cut-off events. [2022-12-12 18:32:37,225 INFO L131 PetriNetUnfolder]: For 31502/32259 co-relation queries the response was YES. [2022-12-12 18:32:37,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68284 conditions, 6603 events. 4195/6603 cut-off events. For 31502/32259 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 37889 event pairs, 0 based on Foata normal form. 182/5298 useless extension candidates. Maximal degree in co-relation 68242. Up to 6115 conditions per place. [2022-12-12 18:32:37,254 INFO L137 encePairwiseOnDemand]: 58/67 looper letters, 111 selfloop transitions, 13 changer transitions 333/476 dead transitions. [2022-12-12 18:32:37,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 476 transitions, 11016 flow [2022-12-12 18:32:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:32:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:32:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2022-12-12 18:32:37,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3283582089552239 [2022-12-12 18:32:37,255 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 6 predicate places. [2022-12-12 18:32:37,256 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 476 transitions, 11016 flow [2022-12-12 18:32:37,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 143 transitions, 3106 flow [2022-12-12 18:32:37,440 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 143 transitions, 3106 flow [2022-12-12 18:32:37,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:37,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:37,441 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] [2022-12-12 18:32:37,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:32:37,441 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-12 18:32:37,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:37,441 INFO L85 PathProgramCache]: Analyzing trace with hash 258195668, now seen corresponding path program 1 times [2022-12-12 18:32:37,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:37,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833987818] [2022-12-12 18:32:37,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:37,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:32:38,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:38,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833987818] [2022-12-12 18:32:38,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833987818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:38,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:38,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:32:38,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960208720] [2022-12-12 18:32:38,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:38,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:32:38,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:38,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:32:38,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:32:38,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 67 [2022-12-12 18:32:38,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 143 transitions, 3106 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:38,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:38,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 67 [2022-12-12 18:32:38,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:38,651 INFO L130 PetriNetUnfolder]: 1901/3298 cut-off events. [2022-12-12 18:32:38,651 INFO L131 PetriNetUnfolder]: For 14263/14413 co-relation queries the response was YES. [2022-12-12 18:32:38,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36074 conditions, 3298 events. 1901/3298 cut-off events. For 14263/14413 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 20156 event pairs, 0 based on Foata normal form. 95/2559 useless extension candidates. Maximal degree in co-relation 36029. Up to 3159 conditions per place. [2022-12-12 18:32:38,667 INFO L137 encePairwiseOnDemand]: 60/67 looper letters, 78 selfloop transitions, 6 changer transitions 127/233 dead transitions. [2022-12-12 18:32:38,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 233 transitions, 5686 flow [2022-12-12 18:32:38,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 18:32:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 18:32:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2022-12-12 18:32:38,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.291044776119403 [2022-12-12 18:32:38,669 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 11 predicate places. [2022-12-12 18:32:38,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 233 transitions, 5686 flow [2022-12-12 18:32:38,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 106 transitions, 2408 flow [2022-12-12 18:32:38,680 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 106 transitions, 2408 flow [2022-12-12 18:32:38,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:32:38,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:38,680 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] [2022-12-12 18:32:38,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 18:32:38,681 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-12 18:32:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1013558249, now seen corresponding path program 1 times [2022-12-12 18:32:38,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:38,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811736129] [2022-12-12 18:32:38,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:38,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:32:38,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:32:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:32:38,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:32:38,757 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:32:38,758 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 18:32:38,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 18:32:38,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 18:32:38,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 18:32:38,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 18:32:38,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 18:32:38,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 18:32:38,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 18:32:38,760 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:38,763 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:32:38,763 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:32:38,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:32:38 BasicIcfg [2022-12-12 18:32:38,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:32:38,821 INFO L158 Benchmark]: Toolchain (without parser) took 56703.97ms. Allocated memory was 208.7MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 183.2MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-12 18:32:38,821 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 208.7MB. Free memory is still 185.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:32:38,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.47ms. Allocated memory is still 208.7MB. Free memory was 183.2MB in the beginning and 154.5MB in the end (delta: 28.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-12 18:32:38,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.18ms. Allocated memory is still 208.7MB. Free memory was 154.5MB in the beginning and 151.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 18:32:38,822 INFO L158 Benchmark]: Boogie Preprocessor took 21.43ms. Allocated memory is still 208.7MB. Free memory was 151.9MB in the beginning and 149.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:32:38,822 INFO L158 Benchmark]: RCFGBuilder took 563.54ms. Allocated memory is still 208.7MB. Free memory was 149.8MB in the beginning and 111.5MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-12 18:32:38,822 INFO L158 Benchmark]: TraceAbstraction took 55655.21ms. Allocated memory was 208.7MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 110.5MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-12 18:32:38,823 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 208.7MB. Free memory is still 185.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 414.47ms. Allocated memory is still 208.7MB. Free memory was 183.2MB in the beginning and 154.5MB in the end (delta: 28.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.18ms. Allocated memory is still 208.7MB. Free memory was 154.5MB in the beginning and 151.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.43ms. Allocated memory is still 208.7MB. Free memory was 151.9MB in the beginning and 149.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 563.54ms. Allocated memory is still 208.7MB. Free memory was 149.8MB in the beginning and 111.5MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 55655.21ms. Allocated memory was 208.7MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 110.5MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 136 PlacesBefore, 79 PlacesAfterwards, 125 TransitionsBefore, 67 TransitionsAfterwards, 2836 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 4 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5511, independent: 5356, independent conditional: 5356, independent unconditional: 0, dependent: 155, dependent conditional: 155, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5511, independent: 5356, independent conditional: 0, independent unconditional: 5356, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5511, independent: 5356, independent conditional: 0, independent unconditional: 5356, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5511, independent: 5356, independent conditional: 0, independent unconditional: 5356, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2707, independent: 2644, independent conditional: 0, independent unconditional: 2644, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2707, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 134, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 288, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5511, independent: 2712, independent conditional: 0, independent unconditional: 2712, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 2707, unknown conditional: 0, unknown unconditional: 2707] , Statistics on independence cache: Total cache size (in pairs): 5152, Positive cache size: 5089, Positive conditional cache size: 0, Positive unconditional cache size: 5089, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L867] 0 pthread_t t213; [L868] FCALL, FORK 0 pthread_create(&t213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t213, ((void *)0), P0, ((void *)0))=-3, t213={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] [L869] 0 pthread_t t214; [L870] FCALL, FORK 0 pthread_create(&t214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t214, ((void *)0), P1, ((void *)0))=-2, t213={5:0}, t214={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] [L871] 0 pthread_t t215; [L872] FCALL, FORK 0 pthread_create(&t215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t215, ((void *)0), P2, ((void *)0))=-1, t213={5:0}, t214={6:0}, t215={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] [L873] 0 pthread_t t216; [L874] FCALL, FORK 0 pthread_create(&t216, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t216, ((void *)0), P3, ((void *)0))=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={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] [L813] 4 z$w_buff1 = z$w_buff0 [L814] 4 z$w_buff0 = 1 [L815] 4 z$w_buff1_used = z$w_buff0_used [L816] 4 z$w_buff0_used = (_Bool)1 [L817] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L817] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L818] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L819] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L820] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L821] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L822] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L823] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 z$flush_delayed = weak$$choice2 [L829] 4 z$mem_tmp = z [L830] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L831] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L832] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L833] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L834] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L836] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EAX = z [L838] 4 z = z$flush_delayed ? z$mem_tmp : z [L839] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z [L800] 3 z = z$flush_delayed ? z$mem_tmp : z [L801] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L845] 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) [L846] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L847] 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 [L848] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L849] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 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) [L881] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L882] 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 [L883] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L884] 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 [\result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 870]: 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: 868]: 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: 872]: 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: 874]: 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, 164 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 1.6s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 55.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 46.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 505 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1168 IncrementalHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 31 mSDtfsCounter, 1168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12768occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 26070 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 1428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:32:38,842 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...