/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:36:46,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:36:46,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:36:46,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:36:46,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:36:46,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:36:46,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:36:46,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:36:46,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:36:46,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:36:46,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:36:46,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:36:46,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:36:46,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:36:46,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:36:46,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:36:46,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:36:46,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:36:46,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:36:46,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:36:46,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:36:46,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:36:46,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:36:46,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:36:46,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:36:46,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:36:46,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:36:46,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:36:46,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:36:46,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:36:46,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:36:46,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:36:46,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:36:46,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:36:46,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:36:46,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:36:46,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:36:46,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:36:46,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:36:46,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:36:46,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:36:46,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 18:36:46,426 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:36:46,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:36:46,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:36:46,428 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:36:46,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:36:46,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:36:46,429 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:36:46,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:36:46,429 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:36:46,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:36:46,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:36:46,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:36:46,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:36:46,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:36:46,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:36:46,430 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:36:46,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:36:46,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:36:46,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:36:46,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:36:46,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:36:46,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:36:46,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:36:46,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:36:46,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:36:46,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:36:46,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:36:46,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:36:46,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:36:46,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:36:46,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 18:36:46,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:36:46,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:36:46,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:36:46,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:36:46,733 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:36:46,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2022-12-12 18:36:47,708 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:36:47,962 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:36:47,963 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2022-12-12 18:36:47,988 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40615cd3/9f6f9cabd51f4510985b1c929dd128f5/FLAG6c71544b7 [2022-12-12 18:36:48,296 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40615cd3/9f6f9cabd51f4510985b1c929dd128f5 [2022-12-12 18:36:48,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:36:48,299 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:36:48,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:36:48,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:36:48,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:36:48,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17516325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48, skipping insertion in model container [2022-12-12 18:36:48,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:36:48,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:36:48,444 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/mix038_tso.oepc.i[949,962] [2022-12-12 18:36:48,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:36:48,670 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:36:48,679 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/mix038_tso.oepc.i[949,962] [2022-12-12 18:36:48,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:48,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:48,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:36:48,747 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:36:48,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48 WrapperNode [2022-12-12 18:36:48,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:36:48,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:36:48,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:36:48,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:36:48,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,813 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-12 18:36:48,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:36:48,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:36:48,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:36:48,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:36:48,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,845 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:36:48,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:36:48,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:36:48,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:36:48,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48" (1/1) ... [2022-12-12 18:36:48,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:36:48,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:36:48,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 18:36:48,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 18:36:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:36:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:36:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:36:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:36:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:36:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:36:48,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:36:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:36:48,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:36:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:36:48,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:36:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:36:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:36:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:36:48,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:36:48,917 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:36:49,048 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:36:49,050 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:36:49,299 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:36:49,388 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:36:49,388 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:36:49,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:36:49 BoogieIcfgContainer [2022-12-12 18:36:49,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:36:49,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:36:49,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:36:49,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:36:49,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:36:48" (1/3) ... [2022-12-12 18:36:49,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd537a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:36:49, skipping insertion in model container [2022-12-12 18:36:49,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:48" (2/3) ... [2022-12-12 18:36:49,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd537a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:36:49, skipping insertion in model container [2022-12-12 18:36:49,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:36:49" (3/3) ... [2022-12-12 18:36:49,396 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2022-12-12 18:36:49,410 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:36:49,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:36:49,410 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:36:49,444 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:36:49,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-12 18:36:49,506 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-12 18:36:49,506 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:36:49,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-12 18:36:49,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-12 18:36:49,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-12 18:36:49,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:36:49,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-12 18:36:49,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-12 18:36:49,550 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-12 18:36:49,551 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:36:49,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-12 18:36:49,556 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-12 18:36:49,556 INFO L226 LiptonReduction]: Number of co-enabled transitions 2082 [2022-12-12 18:36:54,394 INFO L241 LiptonReduction]: Total number of compositions: 86 [2022-12-12 18:36:54,405 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:36:54,409 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;@630cc058, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:36:54,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 18:36:54,412 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-12 18:36:54,412 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:36:54,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:54,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 18:36:54,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:54,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash 478430068, now seen corresponding path program 1 times [2022-12-12 18:36:54,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:54,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086423609] [2022-12-12 18:36:54,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:54,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:54,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:54,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086423609] [2022-12-12 18:36:54,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086423609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:54,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:54,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:36:54,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023302262] [2022-12-12 18:36:54,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:54,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:36:54,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:54,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:36:54,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:36:54,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 18:36:54,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:54,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:54,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 18:36:54,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:56,231 INFO L130 PetriNetUnfolder]: 10824/17312 cut-off events. [2022-12-12 18:36:56,232 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-12 18:36:56,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32739 conditions, 17312 events. 10824/17312 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 132186 event pairs, 1448 based on Foata normal form. 0/10609 useless extension candidates. Maximal degree in co-relation 32728. Up to 12997 conditions per place. [2022-12-12 18:36:56,334 INFO L137 encePairwiseOnDemand]: 58/64 looper letters, 36 selfloop transitions, 2 changer transitions 51/100 dead transitions. [2022-12-12 18:36:56,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 388 flow [2022-12-12 18:36:56,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:36:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:36:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-12-12 18:36:56,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2022-12-12 18:36:56,345 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2022-12-12 18:36:56,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 100 transitions, 388 flow [2022-12-12 18:36:56,364 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 49 transitions, 186 flow [2022-12-12 18:36:56,365 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 49 transitions, 186 flow [2022-12-12 18:36:56,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:56,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:56,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:56,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:36:56,365 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:56,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:56,366 INFO L85 PathProgramCache]: Analyzing trace with hash -211075259, now seen corresponding path program 1 times [2022-12-12 18:36:56,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:56,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570949595] [2022-12-12 18:36:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:56,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:56,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:56,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570949595] [2022-12-12 18:36:56,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570949595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:56,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:56,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:36:56,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484960487] [2022-12-12 18:36:56,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:56,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:36:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:36:56,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:36:56,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 18:36:56,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 49 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:56,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:56,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 18:36:56,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:56,699 INFO L130 PetriNetUnfolder]: 1439/2404 cut-off events. [2022-12-12 18:36:56,699 INFO L131 PetriNetUnfolder]: For 156/158 co-relation queries the response was YES. [2022-12-12 18:36:56,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6722 conditions, 2404 events. 1439/2404 cut-off events. For 156/158 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13330 event pairs, 143 based on Foata normal form. 75/2031 useless extension candidates. Maximal degree in co-relation 6708. Up to 1793 conditions per place. [2022-12-12 18:36:56,714 INFO L137 encePairwiseOnDemand]: 61/64 looper letters, 49 selfloop transitions, 3 changer transitions 2/65 dead transitions. [2022-12-12 18:36:56,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 358 flow [2022-12-12 18:36:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:36:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:36:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-12 18:36:56,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2022-12-12 18:36:56,716 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -24 predicate places. [2022-12-12 18:36:56,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 65 transitions, 358 flow [2022-12-12 18:36:56,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 63 transitions, 346 flow [2022-12-12 18:36:56,729 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 63 transitions, 346 flow [2022-12-12 18:36:56,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:56,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:56,729 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:56,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:36:56,730 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:56,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1029327199, now seen corresponding path program 1 times [2022-12-12 18:36:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:56,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041537275] [2022-12-12 18:36:56,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:57,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:57,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041537275] [2022-12-12 18:36:57,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041537275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:57,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:57,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:36:57,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385776596] [2022-12-12 18:36:57,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:57,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:36:57,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:57,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:36:57,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:36:57,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 18:36:57,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 63 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:57,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:57,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 18:36:57,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:57,300 INFO L130 PetriNetUnfolder]: 1541/2564 cut-off events. [2022-12-12 18:36:57,300 INFO L131 PetriNetUnfolder]: For 547/547 co-relation queries the response was YES. [2022-12-12 18:36:57,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9219 conditions, 2564 events. 1541/2564 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13880 event pairs, 101 based on Foata normal form. 2/2180 useless extension candidates. Maximal degree in co-relation 9202. Up to 2226 conditions per place. [2022-12-12 18:36:57,316 INFO L137 encePairwiseOnDemand]: 59/64 looper letters, 63 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2022-12-12 18:36:57,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 574 flow [2022-12-12 18:36:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:36:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:36:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-12 18:36:57,318 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.359375 [2022-12-12 18:36:57,318 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -23 predicate places. [2022-12-12 18:36:57,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 78 transitions, 574 flow [2022-12-12 18:36:57,330 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 78 transitions, 574 flow [2022-12-12 18:36:57,331 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 78 transitions, 574 flow [2022-12-12 18:36:57,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:57,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:57,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:57,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:36:57,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:57,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:57,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1844366742, now seen corresponding path program 1 times [2022-12-12 18:36:57,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:57,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803801523] [2022-12-12 18:36:57,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:57,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:57,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803801523] [2022-12-12 18:36:57,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803801523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:57,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:57,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:36:57,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125147583] [2022-12-12 18:36:57,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:57,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:36:57,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:57,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:36:57,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:36:57,741 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 18:36:57,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 78 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:57,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:57,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 18:36:57,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:58,191 INFO L130 PetriNetUnfolder]: 2402/3673 cut-off events. [2022-12-12 18:36:58,191 INFO L131 PetriNetUnfolder]: For 3114/3114 co-relation queries the response was YES. [2022-12-12 18:36:58,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16365 conditions, 3673 events. 2402/3673 cut-off events. For 3114/3114 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18167 event pairs, 211 based on Foata normal form. 41/3213 useless extension candidates. Maximal degree in co-relation 16345. Up to 3099 conditions per place. [2022-12-12 18:36:58,216 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 103 selfloop transitions, 26 changer transitions 0/137 dead transitions. [2022-12-12 18:36:58,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 137 transitions, 1278 flow [2022-12-12 18:36:58,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:36:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:36:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-12-12 18:36:58,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36875 [2022-12-12 18:36:58,221 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2022-12-12 18:36:58,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 137 transitions, 1278 flow [2022-12-12 18:36:58,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 137 transitions, 1278 flow [2022-12-12 18:36:58,242 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 137 transitions, 1278 flow [2022-12-12 18:36:58,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:58,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:58,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:58,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:36:58,243 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:58,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:58,243 INFO L85 PathProgramCache]: Analyzing trace with hash 923427583, now seen corresponding path program 1 times [2022-12-12 18:36:58,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:58,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519287543] [2022-12-12 18:36:58,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:58,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:58,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:58,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519287543] [2022-12-12 18:36:58,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519287543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:58,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:58,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:36:58,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444832040] [2022-12-12 18:36:58,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:58,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:36:58,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:58,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:36:58,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:36:58,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 18:36:58,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 137 transitions, 1278 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:58,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:58,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 18:36:58,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:58,759 INFO L130 PetriNetUnfolder]: 2406/3679 cut-off events. [2022-12-12 18:36:58,759 INFO L131 PetriNetUnfolder]: For 4945/4945 co-relation queries the response was YES. [2022-12-12 18:36:58,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19550 conditions, 3679 events. 2406/3679 cut-off events. For 4945/4945 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18201 event pairs, 211 based on Foata normal form. 2/3180 useless extension candidates. Maximal degree in co-relation 19527. Up to 3104 conditions per place. [2022-12-12 18:36:58,784 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 108 selfloop transitions, 19 changer transitions 0/142 dead transitions. [2022-12-12 18:36:58,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 142 transitions, 1582 flow [2022-12-12 18:36:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:36:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:36:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-12 18:36:58,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-12 18:36:58,787 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -16 predicate places. [2022-12-12 18:36:58,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 142 transitions, 1582 flow [2022-12-12 18:36:58,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 142 transitions, 1582 flow [2022-12-12 18:36:58,808 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 142 transitions, 1582 flow [2022-12-12 18:36:58,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:58,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:58,808 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:58,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:36:58,808 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:58,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:58,809 INFO L85 PathProgramCache]: Analyzing trace with hash 925272703, now seen corresponding path program 2 times [2022-12-12 18:36:58,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:58,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713423939] [2022-12-12 18:36:58,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:58,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:59,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:59,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713423939] [2022-12-12 18:36:59,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713423939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:59,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:59,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:36:59,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717418530] [2022-12-12 18:36:59,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:59,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:36:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:59,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:36:59,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:36:59,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 18:36:59,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 142 transitions, 1582 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:59,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:59,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 18:36:59,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:59,503 INFO L130 PetriNetUnfolder]: 2544/3875 cut-off events. [2022-12-12 18:36:59,503 INFO L131 PetriNetUnfolder]: For 8471/8471 co-relation queries the response was YES. [2022-12-12 18:36:59,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23874 conditions, 3875 events. 2544/3875 cut-off events. For 8471/8471 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 19262 event pairs, 207 based on Foata normal form. 15/3381 useless extension candidates. Maximal degree in co-relation 23848. Up to 3258 conditions per place. [2022-12-12 18:36:59,527 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 134 selfloop transitions, 29 changer transitions 0/178 dead transitions. [2022-12-12 18:36:59,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 178 transitions, 2346 flow [2022-12-12 18:36:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:36:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:36:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2022-12-12 18:36:59,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.371875 [2022-12-12 18:36:59,529 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2022-12-12 18:36:59,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 178 transitions, 2346 flow [2022-12-12 18:36:59,548 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 178 transitions, 2346 flow [2022-12-12 18:36:59,548 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 178 transitions, 2346 flow [2022-12-12 18:36:59,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:59,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:59,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:59,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:36:59,549 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash 815863187, now seen corresponding path program 1 times [2022-12-12 18:36:59,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:59,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000955326] [2022-12-12 18:36:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:59,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:59,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:59,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000955326] [2022-12-12 18:36:59,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000955326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:59,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:59,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:36:59,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160861888] [2022-12-12 18:36:59,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:59,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:36:59,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:59,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:36:59,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:36:59,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 18:36:59,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 178 transitions, 2346 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:59,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:59,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 18:36:59,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:00,409 INFO L130 PetriNetUnfolder]: 2499/3812 cut-off events. [2022-12-12 18:37:00,409 INFO L131 PetriNetUnfolder]: For 11792/11792 co-relation queries the response was YES. [2022-12-12 18:37:00,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26700 conditions, 3812 events. 2499/3812 cut-off events. For 11792/11792 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 18977 event pairs, 193 based on Foata normal form. 18/3330 useless extension candidates. Maximal degree in co-relation 26671. Up to 3198 conditions per place. [2022-12-12 18:37:00,435 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 141 selfloop transitions, 21 changer transitions 0/177 dead transitions. [2022-12-12 18:37:00,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 177 transitions, 2656 flow [2022-12-12 18:37:00,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:37:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:37:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-12 18:37:00,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2022-12-12 18:37:00,437 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2022-12-12 18:37:00,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 177 transitions, 2656 flow [2022-12-12 18:37:00,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 177 transitions, 2656 flow [2022-12-12 18:37:00,460 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 177 transitions, 2656 flow [2022-12-12 18:37:00,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:00,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:00,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:37:00,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:37:00,460 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash 818900908, now seen corresponding path program 1 times [2022-12-12 18:37:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:00,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100430272] [2022-12-12 18:37:00,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:00,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:00,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-12 18:37:00,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:00,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100430272] [2022-12-12 18:37:00,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100430272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:00,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:00,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:37:00,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304350354] [2022-12-12 18:37:00,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:00,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:37:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:00,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:37:00,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:37:00,658 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 18:37:00,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 177 transitions, 2656 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:00,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:00,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 18:37:00,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:01,057 INFO L130 PetriNetUnfolder]: 2750/4186 cut-off events. [2022-12-12 18:37:01,057 INFO L131 PetriNetUnfolder]: For 17203/17203 co-relation queries the response was YES. [2022-12-12 18:37:01,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33100 conditions, 4186 events. 2750/4186 cut-off events. For 17203/17203 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21273 event pairs, 207 based on Foata normal form. 25/3662 useless extension candidates. Maximal degree in co-relation 33068. Up to 3540 conditions per place. [2022-12-12 18:37:01,134 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 141 selfloop transitions, 49 changer transitions 0/205 dead transitions. [2022-12-12 18:37:01,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 205 transitions, 3487 flow [2022-12-12 18:37:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:37:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:37:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2022-12-12 18:37:01,136 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3385416666666667 [2022-12-12 18:37:01,138 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2022-12-12 18:37:01,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 205 transitions, 3487 flow [2022-12-12 18:37:01,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 205 transitions, 3487 flow [2022-12-12 18:37:01,161 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 205 transitions, 3487 flow [2022-12-12 18:37:01,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:01,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:01,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:37:01,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:37:01,162 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:01,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:01,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1210808118, now seen corresponding path program 2 times [2022-12-12 18:37:01,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:01,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92102072] [2022-12-12 18:37:01,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:01,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:37:01,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:01,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92102072] [2022-12-12 18:37:01,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92102072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:01,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:01,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:37:01,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122044505] [2022-12-12 18:37:01,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:01,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:37:01,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:01,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:37:01,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:37:01,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 18:37:01,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 205 transitions, 3487 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:01,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:01,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 18:37:01,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:02,212 INFO L130 PetriNetUnfolder]: 2801/4267 cut-off events. [2022-12-12 18:37:02,213 INFO L131 PetriNetUnfolder]: For 16659/16659 co-relation queries the response was YES. [2022-12-12 18:37:02,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37856 conditions, 4267 events. 2801/4267 cut-off events. For 16659/16659 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 21743 event pairs, 185 based on Foata normal form. 25/3730 useless extension candidates. Maximal degree in co-relation 37821. Up to 3611 conditions per place. [2022-12-12 18:37:02,241 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 184 selfloop transitions, 55 changer transitions 0/247 dead transitions. [2022-12-12 18:37:02,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 247 transitions, 4590 flow [2022-12-12 18:37:02,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:37:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:37:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2022-12-12 18:37:02,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3325892857142857 [2022-12-12 18:37:02,243 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2022-12-12 18:37:02,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 247 transitions, 4590 flow [2022-12-12 18:37:02,269 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 247 transitions, 4590 flow [2022-12-12 18:37:02,270 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 247 transitions, 4590 flow [2022-12-12 18:37:02,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:02,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:02,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:37:02,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:37:02,270 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:02,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash 479190385, now seen corresponding path program 1 times [2022-12-12 18:37:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:02,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731375056] [2022-12-12 18:37:02,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:02,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:37:02,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:02,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731375056] [2022-12-12 18:37:02,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731375056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:02,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:02,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:37:02,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352941499] [2022-12-12 18:37:02,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:02,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:37:02,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:02,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:37:02,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:37:02,490 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 18:37:02,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 247 transitions, 4590 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:02,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:02,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 18:37:02,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:03,230 INFO L130 PetriNetUnfolder]: 4072/6300 cut-off events. [2022-12-12 18:37:03,230 INFO L131 PetriNetUnfolder]: For 23998/23998 co-relation queries the response was YES. [2022-12-12 18:37:03,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62280 conditions, 6300 events. 4072/6300 cut-off events. For 23998/23998 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 35827 event pairs, 168 based on Foata normal form. 114/5485 useless extension candidates. Maximal degree in co-relation 62242. Up to 5430 conditions per place. [2022-12-12 18:37:03,265 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 294 selfloop transitions, 31 changer transitions 87/420 dead transitions. [2022-12-12 18:37:03,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 420 transitions, 8692 flow [2022-12-12 18:37:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:37:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:37:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-12-12 18:37:03,267 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3255208333333333 [2022-12-12 18:37:03,267 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 7 predicate places. [2022-12-12 18:37:03,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 420 transitions, 8692 flow [2022-12-12 18:37:03,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 333 transitions, 6894 flow [2022-12-12 18:37:03,300 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 333 transitions, 6894 flow [2022-12-12 18:37:03,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:03,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:03,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:37:03,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:37:03,300 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:03,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:03,301 INFO L85 PathProgramCache]: Analyzing trace with hash -176342633, now seen corresponding path program 2 times [2022-12-12 18:37:03,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:03,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124804734] [2022-12-12 18:37:03,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:03,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:37:03,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:03,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124804734] [2022-12-12 18:37:03,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124804734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:03,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:03,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:37:03,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541638771] [2022-12-12 18:37:03,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:03,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:37:03,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:03,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:37:03,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:37:03,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 18:37:03,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 333 transitions, 6894 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:03,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:03,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 18:37:03,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:04,073 INFO L130 PetriNetUnfolder]: 3600/5908 cut-off events. [2022-12-12 18:37:04,074 INFO L131 PetriNetUnfolder]: For 45716/46067 co-relation queries the response was YES. [2022-12-12 18:37:04,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59930 conditions, 5908 events. 3600/5908 cut-off events. For 45716/46067 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 37127 event pairs, 361 based on Foata normal form. 164/5227 useless extension candidates. Maximal degree in co-relation 59889. Up to 4992 conditions per place. [2022-12-12 18:37:04,105 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 243 selfloop transitions, 48 changer transitions 10/332 dead transitions. [2022-12-12 18:37:04,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 332 transitions, 7486 flow [2022-12-12 18:37:04,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:37:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:37:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-12 18:37:04,106 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3802083333333333 [2022-12-12 18:37:04,107 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 9 predicate places. [2022-12-12 18:37:04,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 332 transitions, 7486 flow [2022-12-12 18:37:04,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 322 transitions, 7246 flow [2022-12-12 18:37:04,134 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 322 transitions, 7246 flow [2022-12-12 18:37:04,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:04,134 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:04,134 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:37:04,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:37:04,135 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1089777031, now seen corresponding path program 1 times [2022-12-12 18:37:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:04,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478455470] [2022-12-12 18:37:04,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:04,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:37:04,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:04,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478455470] [2022-12-12 18:37:04,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478455470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:04,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:04,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:37:04,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003547549] [2022-12-12 18:37:04,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:04,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:37:04,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:04,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:37:04,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:37:04,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 18:37:04,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 322 transitions, 7246 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:04,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:04,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 18:37:04,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:04,618 INFO L130 PetriNetUnfolder]: 1541/2888 cut-off events. [2022-12-12 18:37:04,618 INFO L131 PetriNetUnfolder]: For 27956/28286 co-relation queries the response was YES. [2022-12-12 18:37:04,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32127 conditions, 2888 events. 1541/2888 cut-off events. For 27956/28286 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 18226 event pairs, 118 based on Foata normal form. 385/2880 useless extension candidates. Maximal degree in co-relation 32083. Up to 2376 conditions per place. [2022-12-12 18:37:04,635 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 197 selfloop transitions, 73 changer transitions 19/320 dead transitions. [2022-12-12 18:37:04,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 320 transitions, 7719 flow [2022-12-12 18:37:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:37:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:37:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-12-12 18:37:04,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.390625 [2022-12-12 18:37:04,637 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 12 predicate places. [2022-12-12 18:37:04,637 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 320 transitions, 7719 flow [2022-12-12 18:37:04,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 301 transitions, 7225 flow [2022-12-12 18:37:04,654 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 301 transitions, 7225 flow [2022-12-12 18:37:04,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:04,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:04,655 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:37:04,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 18:37:04,655 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:04,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1845986047, now seen corresponding path program 1 times [2022-12-12 18:37:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:04,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629716206] [2022-12-12 18:37:04,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:04,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:37:04,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:04,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629716206] [2022-12-12 18:37:04,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629716206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:04,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:04,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:37:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158869479] [2022-12-12 18:37:04,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:04,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:37:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:04,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:37:04,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:37:04,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 18:37:04,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 301 transitions, 7225 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:04,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:04,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 18:37:04,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:05,117 INFO L130 PetriNetUnfolder]: 896/1653 cut-off events. [2022-12-12 18:37:05,117 INFO L131 PetriNetUnfolder]: For 21298/21556 co-relation queries the response was YES. [2022-12-12 18:37:05,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19777 conditions, 1653 events. 896/1653 cut-off events. For 21298/21556 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8892 event pairs, 10 based on Foata normal form. 261/1687 useless extension candidates. Maximal degree in co-relation 19730. Up to 1318 conditions per place. [2022-12-12 18:37:05,127 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 122 selfloop transitions, 58 changer transitions 93/292 dead transitions. [2022-12-12 18:37:05,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 292 transitions, 7513 flow [2022-12-12 18:37:05,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:37:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:37:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-12 18:37:05,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.340625 [2022-12-12 18:37:05,129 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 16 predicate places. [2022-12-12 18:37:05,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 292 transitions, 7513 flow [2022-12-12 18:37:05,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 199 transitions, 5099 flow [2022-12-12 18:37:05,138 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 199 transitions, 5099 flow [2022-12-12 18:37:05,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:05,139 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:05,139 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] [2022-12-12 18:37:05,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 18:37:05,139 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:05,139 INFO L85 PathProgramCache]: Analyzing trace with hash -244125991, now seen corresponding path program 1 times [2022-12-12 18:37:05,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:05,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424951280] [2022-12-12 18:37:05,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:05,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:37:05,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:05,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424951280] [2022-12-12 18:37:05,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424951280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:05,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:05,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:37:05,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070228148] [2022-12-12 18:37:05,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:05,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:37:05,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:05,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:37:05,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:37:05,388 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 18:37:05,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 199 transitions, 5099 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:05,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:05,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 18:37:05,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:05,704 INFO L130 PetriNetUnfolder]: 970/1772 cut-off events. [2022-12-12 18:37:05,705 INFO L131 PetriNetUnfolder]: For 20887/21097 co-relation queries the response was YES. [2022-12-12 18:37:05,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22997 conditions, 1772 events. 970/1772 cut-off events. For 20887/21097 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9569 event pairs, 0 based on Foata normal form. 51/1536 useless extension candidates. Maximal degree in co-relation 22947. Up to 1445 conditions per place. [2022-12-12 18:37:05,713 INFO L137 encePairwiseOnDemand]: 58/64 looper letters, 94 selfloop transitions, 6 changer transitions 183/294 dead transitions. [2022-12-12 18:37:05,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 294 transitions, 8257 flow [2022-12-12 18:37:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:37:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:37:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-12 18:37:05,714 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3046875 [2022-12-12 18:37:05,715 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 19 predicate places. [2022-12-12 18:37:05,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 294 transitions, 8257 flow [2022-12-12 18:37:05,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 111 transitions, 3017 flow [2022-12-12 18:37:05,722 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 111 transitions, 3017 flow [2022-12-12 18:37:05,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:05,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:05,722 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] [2022-12-12 18:37:05,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 18:37:05,723 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:05,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:05,724 INFO L85 PathProgramCache]: Analyzing trace with hash 665063160, now seen corresponding path program 1 times [2022-12-12 18:37:05,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:05,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061959121] [2022-12-12 18:37:05,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:05,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:37:06,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:06,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061959121] [2022-12-12 18:37:06,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061959121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:06,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:06,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:37:06,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751355465] [2022-12-12 18:37:06,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:06,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:37:06,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:06,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:37:06,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:37:06,131 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 18:37:06,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 111 transitions, 3017 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:06,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:06,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 18:37:06,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:06,333 INFO L130 PetriNetUnfolder]: 469/978 cut-off events. [2022-12-12 18:37:06,333 INFO L131 PetriNetUnfolder]: For 10171/10320 co-relation queries the response was YES. [2022-12-12 18:37:06,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13284 conditions, 978 events. 469/978 cut-off events. For 10171/10320 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5559 event pairs, 0 based on Foata normal form. 50/834 useless extension candidates. Maximal degree in co-relation 13231. Up to 885 conditions per place. [2022-12-12 18:37:06,338 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 76 selfloop transitions, 25 changer transitions 22/137 dead transitions. [2022-12-12 18:37:06,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 137 transitions, 4043 flow [2022-12-12 18:37:06,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:37:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:37:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2022-12-12 18:37:06,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2994791666666667 [2022-12-12 18:37:06,340 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 13 predicate places. [2022-12-12 18:37:06,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 137 transitions, 4043 flow [2022-12-12 18:37:06,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 115 transitions, 3339 flow [2022-12-12 18:37:06,345 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 115 transitions, 3339 flow [2022-12-12 18:37:06,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:06,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:06,345 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] [2022-12-12 18:37:06,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 18:37:06,345 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:06,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1655630495, now seen corresponding path program 1 times [2022-12-12 18:37:06,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:06,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545234189] [2022-12-12 18:37:06,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:37:07,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:07,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545234189] [2022-12-12 18:37:07,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545234189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:07,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:07,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 18:37:07,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230785353] [2022-12-12 18:37:07,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:07,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 18:37:07,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:07,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 18:37:07,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-12 18:37:07,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 18:37:07,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 115 transitions, 3339 flow. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:07,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:07,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 18:37:07,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:07,590 INFO L130 PetriNetUnfolder]: 474/1037 cut-off events. [2022-12-12 18:37:07,590 INFO L131 PetriNetUnfolder]: For 11746/11798 co-relation queries the response was YES. [2022-12-12 18:37:07,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14451 conditions, 1037 events. 474/1037 cut-off events. For 11746/11798 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6308 event pairs, 0 based on Foata normal form. 37/865 useless extension candidates. Maximal degree in co-relation 14395. Up to 946 conditions per place. [2022-12-12 18:37:07,595 INFO L137 encePairwiseOnDemand]: 59/64 looper letters, 73 selfloop transitions, 11 changer transitions 44/141 dead transitions. [2022-12-12 18:37:07,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 141 transitions, 4415 flow [2022-12-12 18:37:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:37:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:37:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-12 18:37:07,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.303125 [2022-12-12 18:37:07,597 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 17 predicate places. [2022-12-12 18:37:07,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 141 transitions, 4415 flow [2022-12-12 18:37:07,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 97 transitions, 2947 flow [2022-12-12 18:37:07,602 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 97 transitions, 2947 flow [2022-12-12 18:37:07,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:37:07,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:07,602 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] [2022-12-12 18:37:07,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 18:37:07,602 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:07,602 INFO L85 PathProgramCache]: Analyzing trace with hash -46482592, now seen corresponding path program 2 times [2022-12-12 18:37:07,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:07,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773602691] [2022-12-12 18:37:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:37:07,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:37:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:37:07,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:37:07,686 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:37:07,687 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 18:37:07,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 18:37:07,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 18:37:07,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 18:37:07,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 18:37:07,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 18:37:07,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-12 18:37:07,703 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:37:07,707 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:37:07,707 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:37:07,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:37:07 BasicIcfg [2022-12-12 18:37:07,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:37:07,767 INFO L158 Benchmark]: Toolchain (without parser) took 19468.08ms. Allocated memory was 205.5MB in the beginning and 835.7MB in the end (delta: 630.2MB). Free memory was 164.3MB in the beginning and 180.1MB in the end (delta: -15.9MB). Peak memory consumption was 615.4MB. Max. memory is 8.0GB. [2022-12-12 18:37:07,767 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory is still 182.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:37:07,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.63ms. Allocated memory is still 205.5MB. Free memory was 163.8MB in the beginning and 137.0MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 18:37:07,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.08ms. Allocated memory is still 205.5MB. Free memory was 137.0MB in the beginning and 134.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:37:07,768 INFO L158 Benchmark]: Boogie Preprocessor took 33.82ms. Allocated memory is still 205.5MB. Free memory was 134.4MB in the beginning and 132.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:37:07,768 INFO L158 Benchmark]: RCFGBuilder took 541.33ms. Allocated memory is still 205.5MB. Free memory was 132.3MB in the beginning and 97.2MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-12 18:37:07,768 INFO L158 Benchmark]: TraceAbstraction took 18375.15ms. Allocated memory was 205.5MB in the beginning and 835.7MB in the end (delta: 630.2MB). Free memory was 96.1MB in the beginning and 180.1MB in the end (delta: -84.0MB). Peak memory consumption was 547.2MB. Max. memory is 8.0GB. [2022-12-12 18:37:07,769 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 205.5MB. Free memory is still 182.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 448.63ms. Allocated memory is still 205.5MB. Free memory was 163.8MB in the beginning and 137.0MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.08ms. Allocated memory is still 205.5MB. Free memory was 137.0MB in the beginning and 134.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.82ms. Allocated memory is still 205.5MB. Free memory was 134.4MB in the beginning and 132.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 541.33ms. Allocated memory is still 205.5MB. Free memory was 132.3MB in the beginning and 97.2MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 18375.15ms. Allocated memory was 205.5MB in the beginning and 835.7MB in the end (delta: 630.2MB). Free memory was 96.1MB in the beginning and 180.1MB in the end (delta: -84.0MB). Peak memory consumption was 547.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 117 PlacesBefore, 72 PlacesAfterwards, 109 TransitionsBefore, 64 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3451, independent: 3273, independent conditional: 3273, independent unconditional: 0, dependent: 178, dependent conditional: 178, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3451, independent: 3273, independent conditional: 0, independent unconditional: 3273, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3451, independent: 3273, independent conditional: 0, independent unconditional: 3273, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3451, independent: 3273, independent conditional: 0, independent unconditional: 3273, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1992, independent: 1932, independent conditional: 0, independent unconditional: 1932, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1992, independent: 1850, independent conditional: 0, independent unconditional: 1850, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 142, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 314, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3451, independent: 1341, independent conditional: 0, independent unconditional: 1341, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 1992, unknown conditional: 0, unknown unconditional: 1992] , Statistics on independence cache: Total cache size (in pairs): 3324, Positive cache size: 3264, Positive conditional cache size: 0, Positive unconditional cache size: 3264, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-3, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=-2, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t1021; [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=-1, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - 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: 831]: 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: 833]: 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: 835]: 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, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.3s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 565 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 565 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1490 IncrementalHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 29 mSDtfsCounter, 1490 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7246occurred in iteration=11, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 12572 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 2572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:37:07,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...