/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:23:36,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:23:36,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:23:36,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:23:36,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:23:36,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:23:36,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:23:36,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:23:36,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:23:36,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:23:36,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:23:36,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:23:36,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:23:36,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:23:36,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:23:36,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:23:36,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:23:36,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:23:36,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:23:36,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:23:36,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:23:36,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:23:36,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:23:36,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:23:36,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:23:36,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:23:36,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:23:36,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:23:36,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:23:36,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:23:36,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:23:36,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:23:36,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:23:36,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:23:36,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:23:36,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:23:36,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:23:36,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:23:36,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:23:36,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:23:36,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:23:36,774 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-05 20:23:36,811 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:23:36,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:23:36,812 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:23:36,812 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:23:36,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:23:36,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:23:36,814 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:23:36,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:23:36,814 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:23:36,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:23:36,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:23:36,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:23:36,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:23:36,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:23:36,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:23:36,816 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:23:36,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:23:36,816 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:23:36,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:23:36,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:23:36,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:23:36,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:23:36,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:23:36,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:23:36,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:23:36,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:23:36,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:23:36,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:23:36,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:23:36,818 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:23:36,818 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 [2022-12-05 20:23:37,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:23:37,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:23:37,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:23:37,172 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:23:37,173 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:23:37,174 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 20:23:38,302 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:23:38,546 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:23:38,547 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 20:23:38,560 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1160ce69d/456350eef4804c0ca92db67d645fc3c8/FLAG8b7d509fc [2022-12-05 20:23:38,575 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1160ce69d/456350eef4804c0ca92db67d645fc3c8 [2022-12-05 20:23:38,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:23:38,578 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:23:38,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:23:38,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:23:38,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:23:38,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:23:38" (1/1) ... [2022-12-05 20:23:38,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b94f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:38, skipping insertion in model container [2022-12-05 20:23:38,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:23:38" (1/1) ... [2022-12-05 20:23:38,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:23:38,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:23:38,771 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 20:23:38,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:38,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:38,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:23:39,016 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:23:39,027 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 20:23:39,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:39,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:39,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:23:39,134 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:23:39,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39 WrapperNode [2022-12-05 20:23:39,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:23:39,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:23:39,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:23:39,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:23:39,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39" (1/1) ... [2022-12-05 20:23:39,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39" (1/1) ... [2022-12-05 20:23:39,214 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-05 20:23:39,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:23:39,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:23:39,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:23:39,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:23:39,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39" (1/1) ... [2022-12-05 20:23:39,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39" (1/1) ... [2022-12-05 20:23:39,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39" (1/1) ... [2022-12-05 20:23:39,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39" (1/1) ... [2022-12-05 20:23:39,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39" (1/1) ... [2022-12-05 20:23:39,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39" (1/1) ... [2022-12-05 20:23:39,262 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39" (1/1) ... [2022-12-05 20:23:39,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39" (1/1) ... [2022-12-05 20:23:39,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:23:39,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:23:39,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:23:39,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:23:39,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39" (1/1) ... [2022-12-05 20:23:39,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:23:39,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:23:39,305 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-05 20:23:39,313 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-05 20:23:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:23:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:23:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:23:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:23:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:23:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:23:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:23:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:23:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:23:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:23:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:23:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:23:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:23:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:23:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:23:39,345 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:23:39,537 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:23:39,539 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:23:39,840 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:23:39,962 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:23:39,963 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:23:39,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:23:39 BoogieIcfgContainer [2022-12-05 20:23:39,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:23:39,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:23:39,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:23:39,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:23:39,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:23:38" (1/3) ... [2022-12-05 20:23:39,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce2ebba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:23:39, skipping insertion in model container [2022-12-05 20:23:39,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:39" (2/3) ... [2022-12-05 20:23:39,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce2ebba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:23:39, skipping insertion in model container [2022-12-05 20:23:39,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:23:39" (3/3) ... [2022-12-05 20:23:39,972 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 20:23:39,987 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:23:39,988 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:23:39,988 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:23:40,034 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:23:40,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-05 20:23:40,135 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-05 20:23:40,135 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:40,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 20:23:40,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-05 20:23:40,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-05 20:23:40,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:23:40,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-05 20:23:40,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-05 20:23:40,217 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-05 20:23:40,218 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:40,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 20:23:40,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-05 20:23:40,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 1944 [2022-12-05 20:23:45,749 INFO L203 LiptonReduction]: Total number of compositions: 84 [2022-12-05 20:23:45,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:23:45,770 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;@70d077f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:23:45,770 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:23:45,774 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-05 20:23:45,774 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:45,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:45,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:45,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:45,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:45,779 INFO L85 PathProgramCache]: Analyzing trace with hash 465213775, now seen corresponding path program 1 times [2022-12-05 20:23:45,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:45,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650964087] [2022-12-05 20:23:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:45,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:46,201 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-05 20:23:46,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:46,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650964087] [2022-12-05 20:23:46,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650964087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:46,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:46,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:23:46,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171472079] [2022-12-05 20:23:46,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:46,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:23:46,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:46,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:23:46,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:23:46,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 20:23:46,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-05 20:23:46,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:46,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 20:23:46,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:46,415 INFO L130 PetriNetUnfolder]: 615/1086 cut-off events. [2022-12-05 20:23:46,415 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 20:23:46,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1086 events. 615/1086 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5822 event pairs, 129 based on Foata normal form. 0/986 useless extension candidates. Maximal degree in co-relation 2046. Up to 703 conditions per place. [2022-12-05 20:23:46,423 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 23 selfloop transitions, 2 changer transitions 4/33 dead transitions. [2022-12-05 20:23:46,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 133 flow [2022-12-05 20:23:46,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-05 20:23:46,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-05 20:23:46,434 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 46 transitions. [2022-12-05 20:23:46,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 133 flow [2022-12-05 20:23:46,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:23:46,438 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2022-12-05 20:23:46,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-05 20:23:46,442 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 20:23:46,443 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2022-12-05 20:23:46,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-05 20:23:46,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:46,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:46,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:23:46,443 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:46,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash 393879830, now seen corresponding path program 1 times [2022-12-05 20:23:46,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:46,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000201842] [2022-12-05 20:23:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:46,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:46,740 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-05 20:23:46,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:46,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000201842] [2022-12-05 20:23:46,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000201842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:46,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:46,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:23:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168956232] [2022-12-05 20:23:46,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:46,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:23:46,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:23:46,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:23:46,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-05 20:23:46,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-05 20:23:46,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:46,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-05 20:23:46,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:46,879 INFO L130 PetriNetUnfolder]: 453/744 cut-off events. [2022-12-05 20:23:46,879 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-05 20:23:46,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 744 events. 453/744 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3272 event pairs, 177 based on Foata normal form. 24/764 useless extension candidates. Maximal degree in co-relation 1506. Up to 445 conditions per place. [2022-12-05 20:23:46,885 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 23 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-05 20:23:46,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 116 flow [2022-12-05 20:23:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 20:23:46,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2022-12-05 20:23:46,887 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 3 states and 35 transitions. [2022-12-05 20:23:46,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 116 flow [2022-12-05 20:23:46,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:23:46,889 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-05 20:23:46,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-05 20:23:46,890 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2022-12-05 20:23:46,890 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-12-05 20:23:46,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-05 20:23:46,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:46,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:46,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:23:46,891 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:46,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash 559310402, now seen corresponding path program 1 times [2022-12-05 20:23:46,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:46,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729319203] [2022-12-05 20:23:46,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:46,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:47,102 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-05 20:23:47,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:47,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729319203] [2022-12-05 20:23:47,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729319203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:47,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:47,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:23:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987906994] [2022-12-05 20:23:47,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:47,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:23:47,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:47,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:23:47,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:23:47,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-05 20:23:47,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-05 20:23:47,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:47,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-05 20:23:47,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:47,247 INFO L130 PetriNetUnfolder]: 511/824 cut-off events. [2022-12-05 20:23:47,247 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-05 20:23:47,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1703 conditions, 824 events. 511/824 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3446 event pairs, 205 based on Foata normal form. 6/820 useless extension candidates. Maximal degree in co-relation 1692. Up to 727 conditions per place. [2022-12-05 20:23:47,252 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 27 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2022-12-05 20:23:47,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 144 flow [2022-12-05 20:23:47,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-05 20:23:47,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-05 20:23:47,255 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 40 transitions. [2022-12-05 20:23:47,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 144 flow [2022-12-05 20:23:47,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:23:47,257 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 71 flow [2022-12-05 20:23:47,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2022-12-05 20:23:47,260 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 20:23:47,265 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2022-12-05 20:23:47,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-05 20:23:47,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:47,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:47,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:23:47,266 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:47,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash -643151951, now seen corresponding path program 1 times [2022-12-05 20:23:47,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:47,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143874470] [2022-12-05 20:23:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:47,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:48,028 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-05 20:23:48,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:48,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143874470] [2022-12-05 20:23:48,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143874470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:48,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:48,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:48,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214384028] [2022-12-05 20:23:48,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:48,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:48,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:48,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:48,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:48,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-05 20:23:48,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-05 20:23:48,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:48,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-05 20:23:48,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:48,215 INFO L130 PetriNetUnfolder]: 621/1059 cut-off events. [2022-12-05 20:23:48,215 INFO L131 PetriNetUnfolder]: For 189/190 co-relation queries the response was YES. [2022-12-05 20:23:48,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 1059 events. 621/1059 cut-off events. For 189/190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5028 event pairs, 200 based on Foata normal form. 10/1049 useless extension candidates. Maximal degree in co-relation 2319. Up to 815 conditions per place. [2022-12-05 20:23:48,221 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 34 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2022-12-05 20:23:48,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 217 flow [2022-12-05 20:23:48,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:23:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:23:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-05 20:23:48,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43846153846153846 [2022-12-05 20:23:48,223 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 5 states and 57 transitions. [2022-12-05 20:23:48,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 217 flow [2022-12-05 20:23:48,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:48,225 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 129 flow [2022-12-05 20:23:48,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2022-12-05 20:23:48,226 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-05 20:23:48,226 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 129 flow [2022-12-05 20:23:48,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-05 20:23:48,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:48,227 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:48,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:23:48,227 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:48,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1001973001, now seen corresponding path program 2 times [2022-12-05 20:23:48,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:48,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344380248] [2022-12-05 20:23:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:48,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:48,819 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-05 20:23:48,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:48,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344380248] [2022-12-05 20:23:48,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344380248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:48,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:48,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546344168] [2022-12-05 20:23:48,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:48,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:48,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:48,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:48,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:48,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-05 20:23:48,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-05 20:23:48,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:48,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-05 20:23:48,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:49,010 INFO L130 PetriNetUnfolder]: 605/1037 cut-off events. [2022-12-05 20:23:49,011 INFO L131 PetriNetUnfolder]: For 758/779 co-relation queries the response was YES. [2022-12-05 20:23:49,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2881 conditions, 1037 events. 605/1037 cut-off events. For 758/779 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4885 event pairs, 208 based on Foata normal form. 22/1039 useless extension candidates. Maximal degree in co-relation 2865. Up to 786 conditions per place. [2022-12-05 20:23:49,018 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 35 selfloop transitions, 9 changer transitions 0/48 dead transitions. [2022-12-05 20:23:49,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 273 flow [2022-12-05 20:23:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-05 20:23:49,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4519230769230769 [2022-12-05 20:23:49,020 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 129 flow. Second operand 4 states and 47 transitions. [2022-12-05 20:23:49,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 273 flow [2022-12-05 20:23:49,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:23:49,023 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 182 flow [2022-12-05 20:23:49,023 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-05 20:23:49,023 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2022-12-05 20:23:49,024 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 182 flow [2022-12-05 20:23:49,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-05 20:23:49,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:49,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:49,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:23:49,024 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:49,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:49,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1097884273, now seen corresponding path program 1 times [2022-12-05 20:23:49,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:49,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791993998] [2022-12-05 20:23:49,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:49,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:49,470 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-05 20:23:49,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:49,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791993998] [2022-12-05 20:23:49,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791993998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:49,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:49,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:23:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121732715] [2022-12-05 20:23:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:49,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:23:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:49,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:23:49,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:23:49,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-05 20:23:49,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-05 20:23:49,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:49,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-05 20:23:49,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:49,722 INFO L130 PetriNetUnfolder]: 634/1086 cut-off events. [2022-12-05 20:23:49,723 INFO L131 PetriNetUnfolder]: For 1449/1470 co-relation queries the response was YES. [2022-12-05 20:23:49,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3349 conditions, 1086 events. 634/1086 cut-off events. For 1449/1470 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5246 event pairs, 68 based on Foata normal form. 12/1078 useless extension candidates. Maximal degree in co-relation 3329. Up to 578 conditions per place. [2022-12-05 20:23:49,731 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 41 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2022-12-05 20:23:49,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 358 flow [2022-12-05 20:23:49,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:23:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:23:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-05 20:23:49,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2022-12-05 20:23:49,733 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 182 flow. Second operand 5 states and 58 transitions. [2022-12-05 20:23:49,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 358 flow [2022-12-05 20:23:49,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 353 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:49,738 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 226 flow [2022-12-05 20:23:49,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-12-05 20:23:49,738 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2022-12-05 20:23:49,739 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 226 flow [2022-12-05 20:23:49,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-05 20:23:49,739 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:49,739 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:49,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:23:49,739 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:49,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 325316152, now seen corresponding path program 1 times [2022-12-05 20:23:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:49,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433730076] [2022-12-05 20:23:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:49,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:50,399 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-05 20:23:50,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:50,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433730076] [2022-12-05 20:23:50,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433730076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:50,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:50,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:23:50,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303684588] [2022-12-05 20:23:50,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:50,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:23:50,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:50,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:23:50,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:23:50,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-05 20:23:50,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-05 20:23:50,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:50,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-05 20:23:50,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:50,638 INFO L130 PetriNetUnfolder]: 616/1060 cut-off events. [2022-12-05 20:23:50,639 INFO L131 PetriNetUnfolder]: For 1953/1994 co-relation queries the response was YES. [2022-12-05 20:23:50,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3563 conditions, 1060 events. 616/1060 cut-off events. For 1953/1994 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5075 event pairs, 72 based on Foata normal form. 8/1048 useless extension candidates. Maximal degree in co-relation 3541. Up to 490 conditions per place. [2022-12-05 20:23:50,647 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 42 selfloop transitions, 11 changer transitions 0/57 dead transitions. [2022-12-05 20:23:50,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 394 flow [2022-12-05 20:23:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:23:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:23:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-05 20:23:50,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43846153846153846 [2022-12-05 20:23:50,648 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 226 flow. Second operand 5 states and 57 transitions. [2022-12-05 20:23:50,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 394 flow [2022-12-05 20:23:50,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 371 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-05 20:23:50,653 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 235 flow [2022-12-05 20:23:50,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-05 20:23:50,654 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2022-12-05 20:23:50,654 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 235 flow [2022-12-05 20:23:50,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-05 20:23:50,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:50,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:50,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:23:50,655 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:50,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:50,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1504422852, now seen corresponding path program 1 times [2022-12-05 20:23:50,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:50,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826971347] [2022-12-05 20:23:50,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:50,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:50,795 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-05 20:23:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:50,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826971347] [2022-12-05 20:23:50,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826971347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:50,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:50,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633119634] [2022-12-05 20:23:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:50,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:50,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:50,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 20:23:50,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-05 20:23:50,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:50,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 20:23:50,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:50,958 INFO L130 PetriNetUnfolder]: 443/801 cut-off events. [2022-12-05 20:23:50,958 INFO L131 PetriNetUnfolder]: For 2328/2361 co-relation queries the response was YES. [2022-12-05 20:23:50,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2770 conditions, 801 events. 443/801 cut-off events. For 2328/2361 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4017 event pairs, 78 based on Foata normal form. 102/892 useless extension candidates. Maximal degree in co-relation 2748. Up to 446 conditions per place. [2022-12-05 20:23:50,964 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 62 selfloop transitions, 7 changer transitions 9/87 dead transitions. [2022-12-05 20:23:50,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 705 flow [2022-12-05 20:23:50,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:23:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:23:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-05 20:23:50,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2022-12-05 20:23:50,966 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 235 flow. Second operand 5 states and 68 transitions. [2022-12-05 20:23:50,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 705 flow [2022-12-05 20:23:50,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 647 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 20:23:50,970 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 275 flow [2022-12-05 20:23:50,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2022-12-05 20:23:50,971 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2022-12-05 20:23:50,971 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 275 flow [2022-12-05 20:23:50,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-05 20:23:50,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:50,972 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:50,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:23:50,972 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:50,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:50,972 INFO L85 PathProgramCache]: Analyzing trace with hash 162110197, now seen corresponding path program 1 times [2022-12-05 20:23:50,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:50,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331378484] [2022-12-05 20:23:50,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:51,103 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-05 20:23:51,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:51,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331378484] [2022-12-05 20:23:51,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331378484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:51,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:51,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:23:51,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293920865] [2022-12-05 20:23:51,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:51,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:51,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:51,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:51,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:51,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 20:23:51,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-05 20:23:51,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:51,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 20:23:51,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:51,267 INFO L130 PetriNetUnfolder]: 316/614 cut-off events. [2022-12-05 20:23:51,267 INFO L131 PetriNetUnfolder]: For 1668/1701 co-relation queries the response was YES. [2022-12-05 20:23:51,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 614 events. 316/614 cut-off events. For 1668/1701 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3121 event pairs, 43 based on Foata normal form. 64/672 useless extension candidates. Maximal degree in co-relation 2355. Up to 210 conditions per place. [2022-12-05 20:23:51,272 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 70 selfloop transitions, 14 changer transitions 10/101 dead transitions. [2022-12-05 20:23:51,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 101 transitions, 805 flow [2022-12-05 20:23:51,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:23:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:23:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-12-05 20:23:51,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5164835164835165 [2022-12-05 20:23:51,274 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 275 flow. Second operand 7 states and 94 transitions. [2022-12-05 20:23:51,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 101 transitions, 805 flow [2022-12-05 20:23:51,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 101 transitions, 756 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-05 20:23:51,280 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 298 flow [2022-12-05 20:23:51,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=298, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2022-12-05 20:23:51,281 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2022-12-05 20:23:51,281 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 298 flow [2022-12-05 20:23:51,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-05 20:23:51,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:51,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:51,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:23:51,282 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:51,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2058956076, now seen corresponding path program 1 times [2022-12-05 20:23:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:51,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669477258] [2022-12-05 20:23:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:23:51,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:51,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669477258] [2022-12-05 20:23:51,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669477258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:51,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:51,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:23:51,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291516671] [2022-12-05 20:23:51,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:51,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:51,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:51,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 20:23:51,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 298 flow. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-05 20:23:51,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:51,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 20:23:51,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:52,357 INFO L130 PetriNetUnfolder]: 1107/1900 cut-off events. [2022-12-05 20:23:52,358 INFO L131 PetriNetUnfolder]: For 5392/5392 co-relation queries the response was YES. [2022-12-05 20:23:52,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7807 conditions, 1900 events. 1107/1900 cut-off events. For 5392/5392 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10208 event pairs, 80 based on Foata normal form. 10/1910 useless extension candidates. Maximal degree in co-relation 7781. Up to 874 conditions per place. [2022-12-05 20:23:52,367 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 64 selfloop transitions, 15 changer transitions 71/150 dead transitions. [2022-12-05 20:23:52,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 150 transitions, 1331 flow [2022-12-05 20:23:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:23:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:23:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-05 20:23:52,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2022-12-05 20:23:52,370 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 298 flow. Second operand 6 states and 70 transitions. [2022-12-05 20:23:52,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 150 transitions, 1331 flow [2022-12-05 20:23:52,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 150 transitions, 1205 flow, removed 48 selfloop flow, removed 2 redundant places. [2022-12-05 20:23:52,398 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 390 flow [2022-12-05 20:23:52,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2022-12-05 20:23:52,400 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2022-12-05 20:23:52,400 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 390 flow [2022-12-05 20:23:52,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-05 20:23:52,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:52,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:52,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:23:52,401 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:52,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1678704168, now seen corresponding path program 2 times [2022-12-05 20:23:52,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:52,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971394627] [2022-12-05 20:23:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:52,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:52,977 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-05 20:23:52,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:52,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971394627] [2022-12-05 20:23:52,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971394627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:52,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:52,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:52,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430873419] [2022-12-05 20:23:52,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:52,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:52,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:52,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:52,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:52,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 20:23:52,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 390 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-05 20:23:52,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:52,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 20:23:52,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:53,125 INFO L130 PetriNetUnfolder]: 353/710 cut-off events. [2022-12-05 20:23:53,125 INFO L131 PetriNetUnfolder]: For 2580/2580 co-relation queries the response was YES. [2022-12-05 20:23:53,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 710 events. 353/710 cut-off events. For 2580/2580 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3469 event pairs, 105 based on Foata normal form. 7/717 useless extension candidates. Maximal degree in co-relation 3309. Up to 367 conditions per place. [2022-12-05 20:23:53,130 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 44 selfloop transitions, 7 changer transitions 20/71 dead transitions. [2022-12-05 20:23:53,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 679 flow [2022-12-05 20:23:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-05 20:23:53,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-05 20:23:53,132 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 390 flow. Second operand 4 states and 39 transitions. [2022-12-05 20:23:53,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 679 flow [2022-12-05 20:23:53,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 645 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-05 20:23:53,142 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 323 flow [2022-12-05 20:23:53,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=323, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2022-12-05 20:23:53,143 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2022-12-05 20:23:53,143 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 323 flow [2022-12-05 20:23:53,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-05 20:23:53,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:53,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:53,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:23:53,144 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:53,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:53,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1410484809, now seen corresponding path program 1 times [2022-12-05 20:23:53,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:53,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840320639] [2022-12-05 20:23:53,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:53,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:53,311 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-05 20:23:53,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:53,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840320639] [2022-12-05 20:23:53,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840320639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:53,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:53,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:23:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492016747] [2022-12-05 20:23:53,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:53,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:23:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:53,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:23:53,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:23:53,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 20:23:53,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-05 20:23:53,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:53,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 20:23:53,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:53,449 INFO L130 PetriNetUnfolder]: 157/397 cut-off events. [2022-12-05 20:23:53,449 INFO L131 PetriNetUnfolder]: For 1379/1386 co-relation queries the response was YES. [2022-12-05 20:23:53,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1703 conditions, 397 events. 157/397 cut-off events. For 1379/1386 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2118 event pairs, 29 based on Foata normal form. 36/424 useless extension candidates. Maximal degree in co-relation 1673. Up to 123 conditions per place. [2022-12-05 20:23:53,452 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 33 selfloop transitions, 11 changer transitions 23/72 dead transitions. [2022-12-05 20:23:53,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 674 flow [2022-12-05 20:23:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:23:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:23:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-12-05 20:23:53,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4065934065934066 [2022-12-05 20:23:53,453 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 323 flow. Second operand 7 states and 74 transitions. [2022-12-05 20:23:53,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 674 flow [2022-12-05 20:23:53,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 596 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-05 20:23:53,460 INFO L231 Difference]: Finished difference. Result has 61 places, 34 transitions, 244 flow [2022-12-05 20:23:53,460 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=61, PETRI_TRANSITIONS=34} [2022-12-05 20:23:53,461 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2022-12-05 20:23:53,461 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 34 transitions, 244 flow [2022-12-05 20:23:53,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-05 20:23:53,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:53,461 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:53,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:23:53,462 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:53,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:53,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1154119285, now seen corresponding path program 1 times [2022-12-05 20:23:53,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:53,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704892316] [2022-12-05 20:23:53,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:53,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:23:53,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:23:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:23:53,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:23:53,568 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:23:53,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:23:53,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:23:53,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:23:53,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:23:53,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:23:53,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:23:53,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:23:53,572 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:53,580 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:23:53,580 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:23:53,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:23:53 BasicIcfg [2022-12-05 20:23:53,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:23:53,655 INFO L158 Benchmark]: Toolchain (without parser) took 15076.32ms. Allocated memory was 186.6MB in the beginning and 449.8MB in the end (delta: 263.2MB). Free memory was 152.5MB in the beginning and 195.2MB in the end (delta: -42.7MB). Peak memory consumption was 221.0MB. Max. memory is 8.0GB. [2022-12-05 20:23:53,658 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 186.6MB. Free memory is still 164.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:23:53,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.06ms. Allocated memory is still 186.6MB. Free memory was 152.0MB in the beginning and 125.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 20:23:53,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.84ms. Allocated memory is still 186.6MB. Free memory was 125.7MB in the beginning and 123.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:23:53,661 INFO L158 Benchmark]: Boogie Preprocessor took 50.66ms. Allocated memory is still 186.6MB. Free memory was 122.6MB in the beginning and 121.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 20:23:53,661 INFO L158 Benchmark]: RCFGBuilder took 698.46ms. Allocated memory is still 186.6MB. Free memory was 121.0MB in the beginning and 89.0MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-05 20:23:53,661 INFO L158 Benchmark]: TraceAbstraction took 13687.75ms. Allocated memory was 186.6MB in the beginning and 449.8MB in the end (delta: 263.2MB). Free memory was 88.0MB in the beginning and 195.2MB in the end (delta: -107.2MB). Peak memory consumption was 157.1MB. Max. memory is 8.0GB. [2022-12-05 20:23:53,662 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.15ms. Allocated memory is still 186.6MB. Free memory is still 164.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 560.06ms. Allocated memory is still 186.6MB. Free memory was 152.0MB in the beginning and 125.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.84ms. Allocated memory is still 186.6MB. Free memory was 125.7MB in the beginning and 123.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.66ms. Allocated memory is still 186.6MB. Free memory was 122.6MB in the beginning and 121.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 698.46ms. Allocated memory is still 186.6MB. Free memory was 121.0MB in the beginning and 89.0MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13687.75ms. Allocated memory was 186.6MB in the beginning and 449.8MB in the end (delta: 263.2MB). Free memory was 88.0MB in the beginning and 195.2MB in the end (delta: -107.2MB). Peak memory consumption was 157.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 115 PlacesBefore, 35 PlacesAfterwards, 107 TransitionsBefore, 26 TransitionsAfterwards, 1944 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1420, independent: 1363, independent conditional: 1363, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1420, independent: 1363, independent conditional: 0, independent unconditional: 1363, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1420, independent: 1363, independent conditional: 0, independent unconditional: 1363, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1420, independent: 1363, independent conditional: 0, independent unconditional: 1363, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1173, independent: 1133, independent conditional: 0, independent unconditional: 1133, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1173, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 372, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 327, dependent conditional: 0, dependent unconditional: 327, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1420, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1173, unknown conditional: 0, unknown unconditional: 1173] , Statistics on independence cache: Total cache size (in pairs): 1676, Positive cache size: 1636, Positive conditional cache size: 0, Positive unconditional cache size: 1636, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1196; [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1196, ((void *)0), P0, ((void *)0))=-3, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1197; [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t1197, ((void *)0), P1, ((void *)0))=-2, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1198; [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t1198, ((void *)0), P2, ((void *)0))=-1, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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: 826]: 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: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 249 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 829 IncrementalHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 26 mSDtfsCounter, 829 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=10, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 1212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:23:53,684 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...