/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:43:00,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:43:00,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:43:00,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:43:00,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:43:00,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:43:00,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:43:00,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:43:00,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:43:00,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:43:00,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:43:00,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:43:00,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:43:00,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:43:00,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:43:00,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:43:00,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:43:00,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:43:00,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:43:00,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:43:00,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:43:00,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:43:00,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:43:00,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:43:00,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:43:00,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:43:00,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:43:00,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:43:00,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:43:00,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:43:00,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:43:00,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:43:00,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:43:00,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:43:00,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:43:00,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:43:00,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:43:00,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:43:00,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:43:00,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:43:00,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:43:00,638 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 23:43:00,664 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:43:00,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:43:00,665 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:43:00,665 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:43:00,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:43:00,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:43:00,666 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:43:00,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:43:00,666 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:43:00,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:43:00,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:43:00,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:43:00,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:43:00,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:43:00,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:43:00,667 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:43:00,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:43:00,668 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:43:00,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:43:00,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:43:00,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:43:00,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:43:00,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:43:00,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:43:00,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:43:00,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:43:00,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:43:00,669 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:43:00,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:43:00,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:43:00,669 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:43:00,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:43:00,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:43:00,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:43:00,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:43:00,928 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:43:00,929 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:43:00,930 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-12-11 23:43:01,935 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:43:02,167 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:43:02,168 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-12-11 23:43:02,189 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be0f8918/5bdb99aa88964755b2b7671069d666ab/FLAG0a569d516 [2022-12-11 23:43:02,215 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be0f8918/5bdb99aa88964755b2b7671069d666ab [2022-12-11 23:43:02,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:43:02,218 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:43:02,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:43:02,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:43:02,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:43:02,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92f2b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02, skipping insertion in model container [2022-12-11 23:43:02,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:43:02,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:43:02,419 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-11 23:43:02,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:43:02,597 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:43:02,606 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-11 23:43:02,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:02,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:02,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:43:02,679 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:43:02,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02 WrapperNode [2022-12-11 23:43:02,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:43:02,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:43:02,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:43:02,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:43:02,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,740 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-11 23:43:02,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:43:02,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:43:02,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:43:02,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:43:02,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,765 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:43:02,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:43:02,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:43:02,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:43:02,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02" (1/1) ... [2022-12-11 23:43:02,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:43:02,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:43:02,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 23:43:02,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 23:43:02,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:43:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 23:43:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:43:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:43:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:43:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 23:43:02,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 23:43:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 23:43:02,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 23:43:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 23:43:02,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 23:43:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:43:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 23:43:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:43:02,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:43:02,836 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:43:02,942 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:43:02,943 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:43:03,197 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:43:03,292 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:43:03,292 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 23:43:03,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:43:03 BoogieIcfgContainer [2022-12-11 23:43:03,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:43:03,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:43:03,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:43:03,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:43:03,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:43:02" (1/3) ... [2022-12-11 23:43:03,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258661f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:43:03, skipping insertion in model container [2022-12-11 23:43:03,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:02" (2/3) ... [2022-12-11 23:43:03,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258661f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:43:03, skipping insertion in model container [2022-12-11 23:43:03,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:43:03" (3/3) ... [2022-12-11 23:43:03,303 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2022-12-11 23:43:03,317 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:43:03,317 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 23:43:03,317 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:43:03,364 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 23:43:03,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2022-12-11 23:43:03,443 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-11 23:43:03,443 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:43:03,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-11 23:43:03,448 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2022-12-11 23:43:03,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2022-12-11 23:43:03,461 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:43:03,467 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;@e1750ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:43:03,467 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 23:43:03,485 INFO L130 PetriNetUnfolder]: 0/67 cut-off events. [2022-12-11 23:43:03,485 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:43:03,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:03,486 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:03,486 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:03,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:03,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2011799754, now seen corresponding path program 1 times [2022-12-11 23:43:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:03,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213729552] [2022-12-11 23:43:03,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:03,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:03,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:03,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213729552] [2022-12-11 23:43:03,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213729552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:03,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:03,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 23:43:03,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247034162] [2022-12-11 23:43:03,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:03,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:43:03,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:03,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:43:03,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:43:03,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2022-12-11 23:43:03,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:03,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:03,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2022-12-11 23:43:03,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:04,056 INFO L130 PetriNetUnfolder]: 17/219 cut-off events. [2022-12-11 23:43:04,056 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-11 23:43:04,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 219 events. 17/219 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 668 event pairs, 7 based on Foata normal form. 9/216 useless extension candidates. Maximal degree in co-relation 224. Up to 27 conditions per place. [2022-12-11 23:43:04,059 INFO L137 encePairwiseOnDemand]: 100/105 looper letters, 10 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2022-12-11 23:43:04,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 235 flow [2022-12-11 23:43:04,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:43:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:43:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2022-12-11 23:43:04,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9301587301587302 [2022-12-11 23:43:04,071 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 0 predicate places. [2022-12-11 23:43:04,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 101 transitions, 235 flow [2022-12-11 23:43:04,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 101 transitions, 235 flow [2022-12-11 23:43:04,073 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 101 transitions, 235 flow [2022-12-11 23:43:04,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:04,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:04,074 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:04,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:43:04,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:04,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1074363893, now seen corresponding path program 1 times [2022-12-11 23:43:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:04,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293206862] [2022-12-11 23:43:04,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:04,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:04,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:04,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293206862] [2022-12-11 23:43:04,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293206862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:04,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:04,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:43:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063382469] [2022-12-11 23:43:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:04,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:43:04,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:04,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:43:04,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:43:04,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2022-12-11 23:43:04,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 101 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:04,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:04,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2022-12-11 23:43:04,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:04,731 INFO L130 PetriNetUnfolder]: 282/892 cut-off events. [2022-12-11 23:43:04,731 INFO L131 PetriNetUnfolder]: For 177/265 co-relation queries the response was YES. [2022-12-11 23:43:04,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 892 events. 282/892 cut-off events. For 177/265 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5835 event pairs, 38 based on Foata normal form. 0/867 useless extension candidates. Maximal degree in co-relation 1561. Up to 249 conditions per place. [2022-12-11 23:43:04,739 INFO L137 encePairwiseOnDemand]: 98/105 looper letters, 25 selfloop transitions, 3 changer transitions 53/153 dead transitions. [2022-12-11 23:43:04,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 153 transitions, 549 flow [2022-12-11 23:43:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:43:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:43:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 818 transitions. [2022-12-11 23:43:04,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8656084656084656 [2022-12-11 23:43:04,747 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 8 predicate places. [2022-12-11 23:43:04,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 153 transitions, 549 flow [2022-12-11 23:43:04,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 100 transitions, 309 flow [2022-12-11 23:43:04,752 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 309 flow [2022-12-11 23:43:04,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:04,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:04,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:04,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:43:04,753 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash 594987084, now seen corresponding path program 1 times [2022-12-11 23:43:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:04,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656423304] [2022-12-11 23:43:04,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:04,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:05,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:05,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656423304] [2022-12-11 23:43:05,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656423304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:05,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:05,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 23:43:05,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327041975] [2022-12-11 23:43:05,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:05,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 23:43:05,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:05,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 23:43:05,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-11 23:43:05,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-11 23:43:05,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 309 flow. Second operand has 11 states, 11 states have (on average 74.81818181818181) internal successors, (823), 11 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:05,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:05,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-11 23:43:05,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:06,881 INFO L130 PetriNetUnfolder]: 1297/2657 cut-off events. [2022-12-11 23:43:06,882 INFO L131 PetriNetUnfolder]: For 970/5737 co-relation queries the response was YES. [2022-12-11 23:43:06,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6853 conditions, 2657 events. 1297/2657 cut-off events. For 970/5737 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17847 event pairs, 30 based on Foata normal form. 76/2685 useless extension candidates. Maximal degree in co-relation 6790. Up to 1393 conditions per place. [2022-12-11 23:43:06,895 INFO L137 encePairwiseOnDemand]: 86/105 looper letters, 51 selfloop transitions, 37 changer transitions 112/261 dead transitions. [2022-12-11 23:43:06,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 261 transitions, 1365 flow [2022-12-11 23:43:06,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-11 23:43:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-11 23:43:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1855 transitions. [2022-12-11 23:43:06,899 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7681159420289855 [2022-12-11 23:43:06,901 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 14 predicate places. [2022-12-11 23:43:06,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 261 transitions, 1365 flow [2022-12-11 23:43:06,912 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 149 transitions, 715 flow [2022-12-11 23:43:06,912 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 149 transitions, 715 flow [2022-12-11 23:43:06,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 74.81818181818181) internal successors, (823), 11 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:06,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:06,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:06,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:43:06,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash 757466495, now seen corresponding path program 1 times [2022-12-11 23:43:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:06,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374692592] [2022-12-11 23:43:06,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:06,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:07,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:07,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374692592] [2022-12-11 23:43:07,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374692592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:07,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:07,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:43:07,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834974057] [2022-12-11 23:43:07,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:07,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:43:07,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:07,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:43:07,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:43:07,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-11 23:43:07,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 149 transitions, 715 flow. Second operand has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:07,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:07,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-11 23:43:07,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:08,135 INFO L130 PetriNetUnfolder]: 1231/2967 cut-off events. [2022-12-11 23:43:08,135 INFO L131 PetriNetUnfolder]: For 1919/10605 co-relation queries the response was YES. [2022-12-11 23:43:08,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9237 conditions, 2967 events. 1231/2967 cut-off events. For 1919/10605 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 23076 event pairs, 2 based on Foata normal form. 118/3028 useless extension candidates. Maximal degree in co-relation 9162. Up to 1359 conditions per place. [2022-12-11 23:43:08,150 INFO L137 encePairwiseOnDemand]: 90/105 looper letters, 95 selfloop transitions, 31 changer transitions 75/262 dead transitions. [2022-12-11 23:43:08,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 262 transitions, 1817 flow [2022-12-11 23:43:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:43:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:43:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1059 transitions. [2022-12-11 23:43:08,153 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7758241758241758 [2022-12-11 23:43:08,154 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 11 predicate places. [2022-12-11 23:43:08,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 262 transitions, 1817 flow [2022-12-11 23:43:08,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 187 transitions, 1229 flow [2022-12-11 23:43:08,165 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 187 transitions, 1229 flow [2022-12-11 23:43:08,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:08,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:08,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:08,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:43:08,166 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:08,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2127669004, now seen corresponding path program 1 times [2022-12-11 23:43:08,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:08,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193073031] [2022-12-11 23:43:08,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:08,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:08,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:08,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193073031] [2022-12-11 23:43:08,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193073031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:08,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:08,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:43:08,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253061508] [2022-12-11 23:43:08,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:08,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:43:08,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:08,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:43:08,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:43:08,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-11 23:43:08,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 187 transitions, 1229 flow. Second operand has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:08,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:08,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-11 23:43:08,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:09,230 INFO L130 PetriNetUnfolder]: 1077/2783 cut-off events. [2022-12-11 23:43:09,230 INFO L131 PetriNetUnfolder]: For 2592/11850 co-relation queries the response was YES. [2022-12-11 23:43:09,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10237 conditions, 2783 events. 1077/2783 cut-off events. For 2592/11850 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 22105 event pairs, 12 based on Foata normal form. 203/2950 useless extension candidates. Maximal degree in co-relation 10150. Up to 1231 conditions per place. [2022-12-11 23:43:09,249 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 117 selfloop transitions, 40 changer transitions 116/334 dead transitions. [2022-12-11 23:43:09,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 334 transitions, 2922 flow [2022-12-11 23:43:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:43:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:43:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1060 transitions. [2022-12-11 23:43:09,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7765567765567766 [2022-12-11 23:43:09,255 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 14 predicate places. [2022-12-11 23:43:09,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 334 transitions, 2922 flow [2022-12-11 23:43:09,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 218 transitions, 1804 flow [2022-12-11 23:43:09,265 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 218 transitions, 1804 flow [2022-12-11 23:43:09,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:09,265 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:09,265 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:09,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:43:09,266 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash -904343696, now seen corresponding path program 1 times [2022-12-11 23:43:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:09,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308077238] [2022-12-11 23:43:09,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:09,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308077238] [2022-12-11 23:43:09,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308077238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:09,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:09,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:43:09,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022757306] [2022-12-11 23:43:09,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:09,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:43:09,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:09,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:43:09,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:43:09,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2022-12-11 23:43:09,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 218 transitions, 1804 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:09,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:09,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2022-12-11 23:43:09,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:09,807 INFO L130 PetriNetUnfolder]: 934/2647 cut-off events. [2022-12-11 23:43:09,807 INFO L131 PetriNetUnfolder]: For 4297/20426 co-relation queries the response was YES. [2022-12-11 23:43:09,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10992 conditions, 2647 events. 934/2647 cut-off events. For 4297/20426 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 22077 event pairs, 54 based on Foata normal form. 132/2752 useless extension candidates. Maximal degree in co-relation 10901. Up to 1232 conditions per place. [2022-12-11 23:43:09,822 INFO L137 encePairwiseOnDemand]: 99/105 looper letters, 121 selfloop transitions, 12 changer transitions 88/319 dead transitions. [2022-12-11 23:43:09,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 319 transitions, 3361 flow [2022-12-11 23:43:09,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:43:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:43:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 810 transitions. [2022-12-11 23:43:09,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-12-11 23:43:09,827 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 13 predicate places. [2022-12-11 23:43:09,827 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 319 transitions, 3361 flow [2022-12-11 23:43:09,837 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 231 transitions, 2227 flow [2022-12-11 23:43:09,837 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 231 transitions, 2227 flow [2022-12-11 23:43:09,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:09,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:09,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:09,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:43:09,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash -341730109, now seen corresponding path program 1 times [2022-12-11 23:43:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:09,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871527700] [2022-12-11 23:43:09,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:09,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:10,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:10,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871527700] [2022-12-11 23:43:10,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871527700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:10,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:10,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 23:43:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589489995] [2022-12-11 23:43:10,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:10,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 23:43:10,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:10,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 23:43:10,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-11 23:43:10,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2022-12-11 23:43:10,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 231 transitions, 2227 flow. Second operand has 9 states, 9 states have (on average 84.55555555555556) internal successors, (761), 9 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:10,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:10,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2022-12-11 23:43:10,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:10,648 INFO L130 PetriNetUnfolder]: 931/2937 cut-off events. [2022-12-11 23:43:10,649 INFO L131 PetriNetUnfolder]: For 8188/38995 co-relation queries the response was YES. [2022-12-11 23:43:10,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12911 conditions, 2937 events. 931/2937 cut-off events. For 8188/38995 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 27227 event pairs, 19 based on Foata normal form. 92/3006 useless extension candidates. Maximal degree in co-relation 12814. Up to 1302 conditions per place. [2022-12-11 23:43:10,663 INFO L137 encePairwiseOnDemand]: 96/105 looper letters, 142 selfloop transitions, 27 changer transitions 131/407 dead transitions. [2022-12-11 23:43:10,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 407 transitions, 5166 flow [2022-12-11 23:43:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 23:43:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 23:43:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 966 transitions. [2022-12-11 23:43:10,666 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8363636363636363 [2022-12-11 23:43:10,666 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 17 predicate places. [2022-12-11 23:43:10,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 407 transitions, 5166 flow [2022-12-11 23:43:10,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 276 transitions, 3142 flow [2022-12-11 23:43:10,678 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 276 transitions, 3142 flow [2022-12-11 23:43:10,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.55555555555556) internal successors, (761), 9 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:10,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:10,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:10,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:43:10,679 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:10,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:10,680 INFO L85 PathProgramCache]: Analyzing trace with hash -102275616, now seen corresponding path program 1 times [2022-12-11 23:43:10,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:10,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231981522] [2022-12-11 23:43:10,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:10,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:11,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:11,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231981522] [2022-12-11 23:43:11,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231981522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:11,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:11,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:43:11,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351728518] [2022-12-11 23:43:11,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:11,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:43:11,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:11,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:43:11,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:43:11,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2022-12-11 23:43:11,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 276 transitions, 3142 flow. Second operand has 10 states, 10 states have (on average 83.6) internal successors, (836), 10 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:11,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:11,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2022-12-11 23:43:11,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:11,511 INFO L130 PetriNetUnfolder]: 733/2312 cut-off events. [2022-12-11 23:43:11,511 INFO L131 PetriNetUnfolder]: For 10095/21628 co-relation queries the response was YES. [2022-12-11 23:43:11,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11181 conditions, 2312 events. 733/2312 cut-off events. For 10095/21628 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 19461 event pairs, 11 based on Foata normal form. 192/2483 useless extension candidates. Maximal degree in co-relation 11077. Up to 997 conditions per place. [2022-12-11 23:43:11,523 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 156 selfloop transitions, 26 changer transitions 41/329 dead transitions. [2022-12-11 23:43:11,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 329 transitions, 4366 flow [2022-12-11 23:43:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 23:43:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 23:43:11,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1029 transitions. [2022-12-11 23:43:11,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2022-12-11 23:43:11,527 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 22 predicate places. [2022-12-11 23:43:11,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 329 transitions, 4366 flow [2022-12-11 23:43:11,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 288 transitions, 3682 flow [2022-12-11 23:43:11,539 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 288 transitions, 3682 flow [2022-12-11 23:43:11,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.6) internal successors, (836), 10 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:11,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:11,539 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:11,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:43:11,540 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:11,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash 323015304, now seen corresponding path program 2 times [2022-12-11 23:43:11,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:11,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387966589] [2022-12-11 23:43:11,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:11,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:12,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387966589] [2022-12-11 23:43:12,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387966589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:12,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:12,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 23:43:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485241139] [2022-12-11 23:43:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:12,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 23:43:12,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 23:43:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-11 23:43:12,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-12-11 23:43:12,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 288 transitions, 3682 flow. Second operand has 12 states, 12 states have (on average 82.41666666666667) internal successors, (989), 12 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:12,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:12,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-12-11 23:43:12,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:12,507 INFO L130 PetriNetUnfolder]: 712/2270 cut-off events. [2022-12-11 23:43:12,508 INFO L131 PetriNetUnfolder]: For 12069/25131 co-relation queries the response was YES. [2022-12-11 23:43:12,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11869 conditions, 2270 events. 712/2270 cut-off events. For 12069/25131 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 19055 event pairs, 11 based on Foata normal form. 227/2478 useless extension candidates. Maximal degree in co-relation 11757. Up to 966 conditions per place. [2022-12-11 23:43:12,520 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 152 selfloop transitions, 21 changer transitions 41/319 dead transitions. [2022-12-11 23:43:12,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 319 transitions, 4630 flow [2022-12-11 23:43:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:43:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:43:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1093 transitions. [2022-12-11 23:43:12,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8007326007326008 [2022-12-11 23:43:12,524 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 28 predicate places. [2022-12-11 23:43:12,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 319 transitions, 4630 flow [2022-12-11 23:43:12,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 278 transitions, 3864 flow [2022-12-11 23:43:12,535 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 278 transitions, 3864 flow [2022-12-11 23:43:12,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.41666666666667) internal successors, (989), 12 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:12,535 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:12,535 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:12,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:43:12,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:12,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1762442167, now seen corresponding path program 1 times [2022-12-11 23:43:12,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:12,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896695676] [2022-12-11 23:43:12,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:12,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:13,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896695676] [2022-12-11 23:43:13,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896695676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:13,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:13,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 23:43:13,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878858754] [2022-12-11 23:43:13,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:13,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 23:43:13,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:13,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 23:43:13,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-11 23:43:13,113 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2022-12-11 23:43:13,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 278 transitions, 3864 flow. Second operand has 11 states, 11 states have (on average 80.63636363636364) internal successors, (887), 11 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:13,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:13,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2022-12-11 23:43:13,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:13,795 INFO L130 PetriNetUnfolder]: 1011/3154 cut-off events. [2022-12-11 23:43:13,795 INFO L131 PetriNetUnfolder]: For 21625/52899 co-relation queries the response was YES. [2022-12-11 23:43:13,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18003 conditions, 3154 events. 1011/3154 cut-off events. For 21625/52899 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 29172 event pairs, 11 based on Foata normal form. 387/3519 useless extension candidates. Maximal degree in co-relation 17881. Up to 1354 conditions per place. [2022-12-11 23:43:13,818 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 162 selfloop transitions, 46 changer transitions 184/495 dead transitions. [2022-12-11 23:43:13,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 495 transitions, 8688 flow [2022-12-11 23:43:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 23:43:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 23:43:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1408 transitions. [2022-12-11 23:43:13,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7887955182072829 [2022-12-11 23:43:13,824 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 38 predicate places. [2022-12-11 23:43:13,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 495 transitions, 8688 flow [2022-12-11 23:43:13,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 311 transitions, 4898 flow [2022-12-11 23:43:13,842 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 311 transitions, 4898 flow [2022-12-11 23:43:13,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 80.63636363636364) internal successors, (887), 11 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:13,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:13,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:13,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 23:43:13,845 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:13,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1446127245, now seen corresponding path program 2 times [2022-12-11 23:43:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:13,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131928381] [2022-12-11 23:43:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:14,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:14,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131928381] [2022-12-11 23:43:14,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131928381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:14,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:14,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:43:14,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51734419] [2022-12-11 23:43:14,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:14,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:43:14,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:14,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:43:14,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:43:14,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-11 23:43:14,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 311 transitions, 4898 flow. Second operand has 10 states, 10 states have (on average 75.2) internal successors, (752), 10 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:14,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:14,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-11 23:43:14,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:15,032 INFO L130 PetriNetUnfolder]: 927/2699 cut-off events. [2022-12-11 23:43:15,032 INFO L131 PetriNetUnfolder]: For 22433/59820 co-relation queries the response was YES. [2022-12-11 23:43:15,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17766 conditions, 2699 events. 927/2699 cut-off events. For 22433/59820 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 22581 event pairs, 6 based on Foata normal form. 508/3184 useless extension candidates. Maximal degree in co-relation 17632. Up to 1230 conditions per place. [2022-12-11 23:43:15,047 INFO L137 encePairwiseOnDemand]: 87/105 looper letters, 192 selfloop transitions, 82 changer transitions 159/494 dead transitions. [2022-12-11 23:43:15,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 494 transitions, 9124 flow [2022-12-11 23:43:15,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 23:43:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 23:43:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1118 transitions. [2022-12-11 23:43:15,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7605442176870748 [2022-12-11 23:43:15,050 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 42 predicate places. [2022-12-11 23:43:15,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 494 transitions, 9124 flow [2022-12-11 23:43:15,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 335 transitions, 5878 flow [2022-12-11 23:43:15,062 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 335 transitions, 5878 flow [2022-12-11 23:43:15,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.2) internal successors, (752), 10 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:15,063 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:15,063 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:15,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 23:43:15,063 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:15,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:15,063 INFO L85 PathProgramCache]: Analyzing trace with hash 670933581, now seen corresponding path program 3 times [2022-12-11 23:43:15,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:15,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191559878] [2022-12-11 23:43:15,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:15,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:15,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:15,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191559878] [2022-12-11 23:43:15,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191559878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:15,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:15,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 23:43:15,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026392085] [2022-12-11 23:43:15,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:15,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 23:43:15,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:15,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 23:43:15,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-11 23:43:15,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-11 23:43:15,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 335 transitions, 5878 flow. Second operand has 11 states, 11 states have (on average 75.0) internal successors, (825), 11 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:15,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:15,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-11 23:43:15,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:16,407 INFO L130 PetriNetUnfolder]: 743/2367 cut-off events. [2022-12-11 23:43:16,407 INFO L131 PetriNetUnfolder]: For 22912/91485 co-relation queries the response was YES. [2022-12-11 23:43:16,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16443 conditions, 2367 events. 743/2367 cut-off events. For 22912/91485 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19949 event pairs, 6 based on Foata normal form. 559/2898 useless extension candidates. Maximal degree in co-relation 16297. Up to 1298 conditions per place. [2022-12-11 23:43:16,420 INFO L137 encePairwiseOnDemand]: 86/105 looper letters, 161 selfloop transitions, 106 changer transitions 215/543 dead transitions. [2022-12-11 23:43:16,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 543 transitions, 10986 flow [2022-12-11 23:43:16,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 23:43:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 23:43:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1424 transitions. [2022-12-11 23:43:16,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7534391534391535 [2022-12-11 23:43:16,423 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 53 predicate places. [2022-12-11 23:43:16,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 543 transitions, 10986 flow [2022-12-11 23:43:16,432 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 328 transitions, 6110 flow [2022-12-11 23:43:16,433 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 328 transitions, 6110 flow [2022-12-11 23:43:16,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 75.0) internal successors, (825), 11 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:16,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:16,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:16,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 23:43:16,434 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:16,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:16,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1882858600, now seen corresponding path program 1 times [2022-12-11 23:43:16,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:16,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704452515] [2022-12-11 23:43:16,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:16,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:16,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:16,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704452515] [2022-12-11 23:43:16,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704452515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:16,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:16,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 23:43:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838854728] [2022-12-11 23:43:16,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:16,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 23:43:16,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:16,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 23:43:16,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-11 23:43:16,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2022-12-11 23:43:16,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 328 transitions, 6110 flow. Second operand has 13 states, 13 states have (on average 81.46153846153847) internal successors, (1059), 13 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:16,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:16,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2022-12-11 23:43:16,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:17,333 INFO L130 PetriNetUnfolder]: 484/1701 cut-off events. [2022-12-11 23:43:17,334 INFO L131 PetriNetUnfolder]: For 25926/42726 co-relation queries the response was YES. [2022-12-11 23:43:17,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12060 conditions, 1701 events. 484/1701 cut-off events. For 25926/42726 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 13250 event pairs, 5 based on Foata normal form. 306/1984 useless extension candidates. Maximal degree in co-relation 11905. Up to 874 conditions per place. [2022-12-11 23:43:17,343 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 166 selfloop transitions, 55 changer transitions 54/401 dead transitions. [2022-12-11 23:43:17,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 401 transitions, 8498 flow [2022-12-11 23:43:17,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 23:43:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 23:43:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1245 transitions. [2022-12-11 23:43:17,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7904761904761904 [2022-12-11 23:43:17,347 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 58 predicate places. [2022-12-11 23:43:17,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 401 transitions, 8498 flow [2022-12-11 23:43:17,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 347 transitions, 7046 flow [2022-12-11 23:43:17,356 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 347 transitions, 7046 flow [2022-12-11 23:43:17,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 81.46153846153847) internal successors, (1059), 13 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:17,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:17,356 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:17,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 23:43:17,356 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:17,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:17,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1693007758, now seen corresponding path program 2 times [2022-12-11 23:43:17,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:17,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078152575] [2022-12-11 23:43:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:17,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:17,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078152575] [2022-12-11 23:43:17,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078152575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:17,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:17,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-11 23:43:17,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645040244] [2022-12-11 23:43:17,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:17,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 23:43:17,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:17,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 23:43:17,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-12-11 23:43:17,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2022-12-11 23:43:17,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 347 transitions, 7046 flow. Second operand has 14 states, 14 states have (on average 80.42857142857143) internal successors, (1126), 14 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:17,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:17,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2022-12-11 23:43:17,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:18,232 INFO L130 PetriNetUnfolder]: 474/1641 cut-off events. [2022-12-11 23:43:18,233 INFO L131 PetriNetUnfolder]: For 33704/78226 co-relation queries the response was YES. [2022-12-11 23:43:18,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12549 conditions, 1641 events. 474/1641 cut-off events. For 33704/78226 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 12659 event pairs, 5 based on Foata normal form. 395/2012 useless extension candidates. Maximal degree in co-relation 12384. Up to 873 conditions per place. [2022-12-11 23:43:18,240 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 173 selfloop transitions, 50 changer transitions 52/400 dead transitions. [2022-12-11 23:43:18,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 400 transitions, 9020 flow [2022-12-11 23:43:18,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 23:43:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 23:43:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1227 transitions. [2022-12-11 23:43:18,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7790476190476191 [2022-12-11 23:43:18,243 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 66 predicate places. [2022-12-11 23:43:18,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 400 transitions, 9020 flow [2022-12-11 23:43:18,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 348 transitions, 7517 flow [2022-12-11 23:43:18,250 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 348 transitions, 7517 flow [2022-12-11 23:43:18,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 80.42857142857143) internal successors, (1126), 14 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:18,250 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:18,250 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:18,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 23:43:18,251 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:18,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash -258699250, now seen corresponding path program 3 times [2022-12-11 23:43:18,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:18,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257876474] [2022-12-11 23:43:18,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:18,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:18,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:18,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257876474] [2022-12-11 23:43:18,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257876474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:18,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:18,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 23:43:18,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523886799] [2022-12-11 23:43:18,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:18,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 23:43:18,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:18,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 23:43:18,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-11 23:43:18,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 105 [2022-12-11 23:43:18,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 348 transitions, 7517 flow. Second operand has 13 states, 13 states have (on average 79.61538461538461) internal successors, (1035), 13 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:18,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:18,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 105 [2022-12-11 23:43:18,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:19,194 INFO L130 PetriNetUnfolder]: 479/1698 cut-off events. [2022-12-11 23:43:19,195 INFO L131 PetriNetUnfolder]: For 39738/113611 co-relation queries the response was YES. [2022-12-11 23:43:19,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13442 conditions, 1698 events. 479/1698 cut-off events. For 39738/113611 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 13530 event pairs, 6 based on Foata normal form. 358/2043 useless extension candidates. Maximal degree in co-relation 13266. Up to 898 conditions per place. [2022-12-11 23:43:19,204 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 193 selfloop transitions, 34 changer transitions 51/401 dead transitions. [2022-12-11 23:43:19,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 401 transitions, 9601 flow [2022-12-11 23:43:19,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 23:43:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 23:43:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1136 transitions. [2022-12-11 23:43:19,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7727891156462585 [2022-12-11 23:43:19,206 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 73 predicate places. [2022-12-11 23:43:19,206 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 401 transitions, 9601 flow [2022-12-11 23:43:19,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 350 transitions, 8047 flow [2022-12-11 23:43:19,215 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 350 transitions, 8047 flow [2022-12-11 23:43:19,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 79.61538461538461) internal successors, (1035), 13 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:19,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:19,216 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:19,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 23:43:19,216 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1512119406, now seen corresponding path program 4 times [2022-12-11 23:43:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:19,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172743555] [2022-12-11 23:43:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:19,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:19,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172743555] [2022-12-11 23:43:19,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172743555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:19,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:19,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 23:43:19,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280422786] [2022-12-11 23:43:19,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:19,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 23:43:19,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:19,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 23:43:19,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-11 23:43:19,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2022-12-11 23:43:19,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 350 transitions, 8047 flow. Second operand has 13 states, 13 states have (on average 80.53846153846153) internal successors, (1047), 13 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:19,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:19,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2022-12-11 23:43:19,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:20,170 INFO L130 PetriNetUnfolder]: 474/1701 cut-off events. [2022-12-11 23:43:20,170 INFO L131 PetriNetUnfolder]: For 52359/119476 co-relation queries the response was YES. [2022-12-11 23:43:20,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14020 conditions, 1701 events. 474/1701 cut-off events. For 52359/119476 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 13670 event pairs, 6 based on Foata normal form. 217/1897 useless extension candidates. Maximal degree in co-relation 13834. Up to 900 conditions per place. [2022-12-11 23:43:20,178 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 136 selfloop transitions, 93 changer transitions 52/404 dead transitions. [2022-12-11 23:43:20,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 404 transitions, 10275 flow [2022-12-11 23:43:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 23:43:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 23:43:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1234 transitions. [2022-12-11 23:43:20,179 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7834920634920635 [2022-12-11 23:43:20,180 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 81 predicate places. [2022-12-11 23:43:20,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 404 transitions, 10275 flow [2022-12-11 23:43:20,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 352 transitions, 8581 flow [2022-12-11 23:43:20,188 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 352 transitions, 8581 flow [2022-12-11 23:43:20,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 80.53846153846153) internal successors, (1047), 13 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:20,188 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:20,188 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:20,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 23:43:20,189 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:20,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1772473542, now seen corresponding path program 5 times [2022-12-11 23:43:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:20,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757920452] [2022-12-11 23:43:20,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:20,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:20,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:20,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757920452] [2022-12-11 23:43:20,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757920452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:20,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:20,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 23:43:20,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535998299] [2022-12-11 23:43:20,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:20,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 23:43:20,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:20,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 23:43:20,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-11 23:43:20,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2022-12-11 23:43:20,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 352 transitions, 8581 flow. Second operand has 12 states, 12 states have (on average 80.66666666666667) internal successors, (968), 12 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:20,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:20,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2022-12-11 23:43:20,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:21,146 INFO L130 PetriNetUnfolder]: 410/1617 cut-off events. [2022-12-11 23:43:21,146 INFO L131 PetriNetUnfolder]: For 48124/95774 co-relation queries the response was YES. [2022-12-11 23:43:21,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13384 conditions, 1617 events. 410/1617 cut-off events. For 48124/95774 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 13239 event pairs, 0 based on Foata normal form. 258/1861 useless extension candidates. Maximal degree in co-relation 13188. Up to 811 conditions per place. [2022-12-11 23:43:21,154 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 160 selfloop transitions, 40 changer transitions 92/395 dead transitions. [2022-12-11 23:43:21,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 395 transitions, 10535 flow [2022-12-11 23:43:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:43:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:43:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1070 transitions. [2022-12-11 23:43:21,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7838827838827839 [2022-12-11 23:43:21,156 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 87 predicate places. [2022-12-11 23:43:21,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 395 transitions, 10535 flow [2022-12-11 23:43:21,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 303 transitions, 7714 flow [2022-12-11 23:43:21,163 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 303 transitions, 7714 flow [2022-12-11 23:43:21,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 80.66666666666667) internal successors, (968), 12 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:21,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:21,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:21,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-11 23:43:21,164 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1618219032, now seen corresponding path program 1 times [2022-12-11 23:43:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:21,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487883671] [2022-12-11 23:43:21,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:21,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:21,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:21,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487883671] [2022-12-11 23:43:21,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487883671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:21,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:21,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:43:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974372822] [2022-12-11 23:43:21,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:21,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:43:21,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:21,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:43:21,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:43:21,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2022-12-11 23:43:21,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 303 transitions, 7714 flow. Second operand has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:21,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:21,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2022-12-11 23:43:21,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:21,973 INFO L130 PetriNetUnfolder]: 2120/4869 cut-off events. [2022-12-11 23:43:21,973 INFO L131 PetriNetUnfolder]: For 151467/158513 co-relation queries the response was YES. [2022-12-11 23:43:21,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28145 conditions, 4869 events. 2120/4869 cut-off events. For 151467/158513 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 41824 event pairs, 68 based on Foata normal form. 364/5073 useless extension candidates. Maximal degree in co-relation 27945. Up to 1403 conditions per place. [2022-12-11 23:43:21,998 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 140 selfloop transitions, 15 changer transitions 138/421 dead transitions. [2022-12-11 23:43:21,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 421 transitions, 11837 flow [2022-12-11 23:43:21,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:43:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:43:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 893 transitions. [2022-12-11 23:43:22,000 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8504761904761905 [2022-12-11 23:43:22,000 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 90 predicate places. [2022-12-11 23:43:22,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 421 transitions, 11837 flow [2022-12-11 23:43:22,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 283 transitions, 6763 flow [2022-12-11 23:43:22,015 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 283 transitions, 6763 flow [2022-12-11 23:43:22,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:22,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:22,016 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:22,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-11 23:43:22,016 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:22,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:22,016 INFO L85 PathProgramCache]: Analyzing trace with hash 548619224, now seen corresponding path program 1 times [2022-12-11 23:43:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:22,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357221329] [2022-12-11 23:43:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:22,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:22,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:22,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357221329] [2022-12-11 23:43:22,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357221329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:22,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:22,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:43:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080186274] [2022-12-11 23:43:22,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:22,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:43:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:22,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:43:22,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:43:22,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2022-12-11 23:43:22,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 283 transitions, 6763 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:22,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:22,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2022-12-11 23:43:22,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:22,616 INFO L130 PetriNetUnfolder]: 937/2917 cut-off events. [2022-12-11 23:43:22,616 INFO L131 PetriNetUnfolder]: For 62253/65270 co-relation queries the response was YES. [2022-12-11 23:43:22,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14693 conditions, 2917 events. 937/2917 cut-off events. For 62253/65270 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 27395 event pairs, 41 based on Foata normal form. 412/3271 useless extension candidates. Maximal degree in co-relation 14489. Up to 939 conditions per place. [2022-12-11 23:43:22,628 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 91 selfloop transitions, 24 changer transitions 117/339 dead transitions. [2022-12-11 23:43:22,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 339 transitions, 8017 flow [2022-12-11 23:43:22,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:43:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:43:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1150 transitions. [2022-12-11 23:43:22,630 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8424908424908425 [2022-12-11 23:43:22,630 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 101 predicate places. [2022-12-11 23:43:22,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 339 transitions, 8017 flow [2022-12-11 23:43:22,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 222 transitions, 4623 flow [2022-12-11 23:43:22,637 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 222 transitions, 4623 flow [2022-12-11 23:43:22,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:22,637 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:22,637 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:22,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-11 23:43:22,638 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1679476409, now seen corresponding path program 1 times [2022-12-11 23:43:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:22,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470287766] [2022-12-11 23:43:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:22,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470287766] [2022-12-11 23:43:22,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470287766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:22,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:22,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:43:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174205459] [2022-12-11 23:43:22,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:22,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:43:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:22,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:43:22,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:43:22,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2022-12-11 23:43:22,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 222 transitions, 4623 flow. Second operand has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:22,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:22,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2022-12-11 23:43:22,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:23,094 INFO L130 PetriNetUnfolder]: 329/1443 cut-off events. [2022-12-11 23:43:23,094 INFO L131 PetriNetUnfolder]: For 18817/19442 co-relation queries the response was YES. [2022-12-11 23:43:23,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7886 conditions, 1443 events. 329/1443 cut-off events. For 18817/19442 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13090 event pairs, 18 based on Foata normal form. 169/1600 useless extension candidates. Maximal degree in co-relation 7678. Up to 440 conditions per place. [2022-12-11 23:43:23,100 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 20 selfloop transitions, 12 changer transitions 127/228 dead transitions. [2022-12-11 23:43:23,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 4691 flow [2022-12-11 23:43:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:43:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:43:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1380 transitions. [2022-12-11 23:43:23,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8214285714285714 [2022-12-11 23:43:23,107 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 114 predicate places. [2022-12-11 23:43:23,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 224 places, 228 transitions, 4691 flow [2022-12-11 23:43:23,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 101 transitions, 1387 flow [2022-12-11 23:43:23,110 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 101 transitions, 1387 flow [2022-12-11 23:43:23,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:23,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:23,110 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:23,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-11 23:43:23,110 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:23,111 INFO L85 PathProgramCache]: Analyzing trace with hash -52338434, now seen corresponding path program 1 times [2022-12-11 23:43:23,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:23,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575729942] [2022-12-11 23:43:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:43:23,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:43:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:43:23,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:43:23,191 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:43:23,192 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 23:43:23,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 23:43:23,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 23:43:23,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 23:43:23,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 23:43:23,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 23:43:23,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-11 23:43:23,194 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:23,199 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:43:23,200 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:43:23,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:43:23 BasicIcfg [2022-12-11 23:43:23,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:43:23,287 INFO L158 Benchmark]: Toolchain (without parser) took 21068.56ms. Allocated memory was 188.7MB in the beginning and 563.1MB in the end (delta: 374.3MB). Free memory was 153.5MB in the beginning and 391.7MB in the end (delta: -238.2MB). Peak memory consumption was 137.2MB. Max. memory is 8.0GB. [2022-12-11 23:43:23,287 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 165.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:43:23,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.74ms. Allocated memory is still 188.7MB. Free memory was 153.5MB in the beginning and 127.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 23:43:23,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.63ms. Allocated memory is still 188.7MB. Free memory was 127.2MB in the beginning and 124.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:43:23,287 INFO L158 Benchmark]: Boogie Preprocessor took 31.43ms. Allocated memory is still 188.7MB. Free memory was 124.7MB in the beginning and 123.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:43:23,287 INFO L158 Benchmark]: RCFGBuilder took 521.21ms. Allocated memory is still 188.7MB. Free memory was 123.1MB in the beginning and 90.6MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-11 23:43:23,288 INFO L158 Benchmark]: TraceAbstraction took 19990.38ms. Allocated memory was 188.7MB in the beginning and 563.1MB in the end (delta: 374.3MB). Free memory was 89.5MB in the beginning and 391.7MB in the end (delta: -302.1MB). Peak memory consumption was 73.2MB. Max. memory is 8.0GB. [2022-12-11 23:43:23,289 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 165.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 458.74ms. Allocated memory is still 188.7MB. Free memory was 153.5MB in the beginning and 127.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.63ms. Allocated memory is still 188.7MB. Free memory was 127.2MB in the beginning and 124.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.43ms. Allocated memory is still 188.7MB. Free memory was 124.7MB in the beginning and 123.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 521.21ms. Allocated memory is still 188.7MB. Free memory was 123.1MB in the beginning and 90.6MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 19990.38ms. Allocated memory was 188.7MB in the beginning and 563.1MB in the end (delta: 374.3MB). Free memory was 89.5MB in the beginning and 391.7MB in the end (delta: -302.1MB). Peak memory consumption was 73.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t2492; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2493; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2494; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, 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=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, 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=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 812]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.8s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1299 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1299 mSDsluCounter, 1631 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1330 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2618 IncrementalHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 301 mSDtfsCounter, 2618 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8581occurred in iteration=16, InterpolantAutomatonStates: 266, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 39912 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1525 NumberOfCodeBlocks, 1525 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1424 ConstructedInterpolants, 0 QuantifiedInterpolants, 9721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 23:43:23,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...