/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 18:41:14,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 18:41:14,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 18:41:14,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 18:41:14,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 18:41:14,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 18:41:14,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 18:41:14,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 18:41:14,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 18:41:14,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 18:41:14,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 18:41:14,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 18:41:14,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 18:41:14,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 18:41:14,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 18:41:14,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 18:41:14,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 18:41:14,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 18:41:14,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 18:41:14,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 18:41:14,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 18:41:14,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 18:41:14,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 18:41:14,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 18:41:14,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 18:41:14,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 18:41:14,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 18:41:14,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 18:41:14,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 18:41:14,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 18:41:14,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 18:41:14,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 18:41:14,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 18:41:14,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 18:41:14,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 18:41:14,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 18:41:14,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 18:41:14,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 18:41:14,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 18:41:14,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 18:41:14,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 18:41:14,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-05 18:41:14,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 18:41:14,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 18:41:14,869 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 18:41:14,869 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 18:41:14,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 18:41:14,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 18:41:14,870 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 18:41:14,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 18:41:14,871 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 18:41:14,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 18:41:14,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 18:41:14,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 18:41:14,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 18:41:14,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 18:41:14,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 18:41:14,872 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 18:41:14,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 18:41:14,873 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 18:41:14,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 18:41:14,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 18:41:14,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 18:41:14,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 18:41:14,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 18:41:14,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:41:14,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 18:41:14,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 18:41:14,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 18:41:14,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 18:41:14,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 18:41:14,874 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 18:41:14,874 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 18:41:14,875 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 18:41:15,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 18:41:15,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 18:41:15,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 18:41:15,218 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 18:41:15,219 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 18:41:15,220 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-12-05 18:41:16,385 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 18:41:16,672 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 18:41:16,673 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-12-05 18:41:16,694 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2926a1a/3cfc5db8027544c4acb8f4dba01e416b/FLAG8fd2f1016 [2022-12-05 18:41:16,711 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2926a1a/3cfc5db8027544c4acb8f4dba01e416b [2022-12-05 18:41:16,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 18:41:16,714 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 18:41:16,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 18:41:16,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 18:41:16,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 18:41:16,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:41:16" (1/1) ... [2022-12-05 18:41:16,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc3461a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:16, skipping insertion in model container [2022-12-05 18:41:16,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:41:16" (1/1) ... [2022-12-05 18:41:16,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 18:41:16,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 18:41:16,894 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-05 18:41:17,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:41:17,149 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 18:41:17,160 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-05 18:41:17,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:41:17,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:41:17,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:41:17,267 INFO L208 MainTranslator]: Completed translation [2022-12-05 18:41:17,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17 WrapperNode [2022-12-05 18:41:17,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 18:41:17,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 18:41:17,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 18:41:17,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 18:41:17,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17" (1/1) ... [2022-12-05 18:41:17,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17" (1/1) ... [2022-12-05 18:41:17,338 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-05 18:41:17,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 18:41:17,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 18:41:17,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 18:41:17,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 18:41:17,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17" (1/1) ... [2022-12-05 18:41:17,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17" (1/1) ... [2022-12-05 18:41:17,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17" (1/1) ... [2022-12-05 18:41:17,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17" (1/1) ... [2022-12-05 18:41:17,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17" (1/1) ... [2022-12-05 18:41:17,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17" (1/1) ... [2022-12-05 18:41:17,360 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17" (1/1) ... [2022-12-05 18:41:17,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17" (1/1) ... [2022-12-05 18:41:17,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 18:41:17,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 18:41:17,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 18:41:17,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 18:41:17,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17" (1/1) ... [2022-12-05 18:41:17,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:41:17,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 18:41:17,401 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 18:41:17,423 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 18:41:17,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 18:41:17,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 18:41:17,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 18:41:17,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 18:41:17,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 18:41:17,440 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 18:41:17,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 18:41:17,440 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 18:41:17,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 18:41:17,441 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 18:41:17,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 18:41:17,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 18:41:17,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 18:41:17,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 18:41:17,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 18:41:17,443 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 18:41:17,607 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 18:41:17,609 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 18:41:17,843 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 18:41:17,963 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 18:41:17,964 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 18:41:17,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:41:17 BoogieIcfgContainer [2022-12-05 18:41:17,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 18:41:17,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 18:41:17,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 18:41:17,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 18:41:17,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 06:41:16" (1/3) ... [2022-12-05 18:41:17,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ada8777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:41:17, skipping insertion in model container [2022-12-05 18:41:17,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:41:17" (2/3) ... [2022-12-05 18:41:17,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ada8777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:41:17, skipping insertion in model container [2022-12-05 18:41:17,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:41:17" (3/3) ... [2022-12-05 18:41:17,974 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2022-12-05 18:41:17,990 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 18:41:17,991 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 18:41:17,991 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 18:41:18,039 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 18:41:18,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2022-12-05 18:41:18,132 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-05 18:41:18,132 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:41:18,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 18:41:18,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2022-12-05 18:41:18,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2022-12-05 18:41:18,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 18:41:18,157 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;@5bf93a12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 18:41:18,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 18:41:18,175 INFO L130 PetriNetUnfolder]: 0/67 cut-off events. [2022-12-05 18:41:18,175 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:41:18,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:18,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:18,176 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 18:41:18,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2011799754, now seen corresponding path program 1 times [2022-12-05 18:41:18,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:18,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916896228] [2022-12-05 18:41:18,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:18,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:18,882 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 18:41:18,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:18,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916896228] [2022-12-05 18:41:18,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916896228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:18,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:18,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 18:41:18,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204222014] [2022-12-05 18:41:18,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:18,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 18:41:18,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:18,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 18:41:18,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 18:41:18,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2022-12-05 18:41:18,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:18,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:18,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2022-12-05 18:41:18,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:19,027 INFO L130 PetriNetUnfolder]: 17/219 cut-off events. [2022-12-05 18:41:19,027 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 18:41:19,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 219 events. 17/219 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 668 event pairs, 7 based on Foata normal form. 9/216 useless extension candidates. Maximal degree in co-relation 224. Up to 27 conditions per place. [2022-12-05 18:41:19,031 INFO L137 encePairwiseOnDemand]: 100/105 looper letters, 10 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2022-12-05 18:41:19,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 235 flow [2022-12-05 18:41:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 18:41:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 18:41:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2022-12-05 18:41:19,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9301587301587302 [2022-12-05 18:41:19,045 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 213 flow. Second operand 3 states and 293 transitions. [2022-12-05 18:41:19,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 101 transitions, 235 flow [2022-12-05 18:41:19,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 18:41:19,052 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 206 flow [2022-12-05 18:41:19,054 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2022-12-05 18:41:19,057 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, -3 predicate places. [2022-12-05 18:41:19,058 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 206 flow [2022-12-05 18:41:19,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:19,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:19,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:19,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 18:41:19,059 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 18:41:19,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1074363893, now seen corresponding path program 1 times [2022-12-05 18:41:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:19,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568239054] [2022-12-05 18:41:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:19,567 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 18:41:19,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:19,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568239054] [2022-12-05 18:41:19,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568239054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:19,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:19,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:41:19,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621289380] [2022-12-05 18:41:19,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:19,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:41:19,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:41:19,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:41:19,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2022-12-05 18:41:19,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:19,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:19,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2022-12-05 18:41:19,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:19,970 INFO L130 PetriNetUnfolder]: 282/895 cut-off events. [2022-12-05 18:41:19,970 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-05 18:41:19,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 895 events. 282/895 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5965 event pairs, 42 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1380. Up to 249 conditions per place. [2022-12-05 18:41:19,980 INFO L137 encePairwiseOnDemand]: 98/105 looper letters, 20 selfloop transitions, 3 changer transitions 46/141 dead transitions. [2022-12-05 18:41:19,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 141 transitions, 430 flow [2022-12-05 18:41:19,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:41:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:41:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 818 transitions. [2022-12-05 18:41:19,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8656084656084656 [2022-12-05 18:41:19,989 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 206 flow. Second operand 9 states and 818 transitions. [2022-12-05 18:41:19,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 141 transitions, 430 flow [2022-12-05 18:41:19,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 141 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:41:19,994 INFO L231 Difference]: Finished difference. Result has 120 places, 90 transitions, 225 flow [2022-12-05 18:41:19,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=225, PETRI_PLACES=120, PETRI_TRANSITIONS=90} [2022-12-05 18:41:19,995 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 10 predicate places. [2022-12-05 18:41:19,995 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 90 transitions, 225 flow [2022-12-05 18:41:19,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:19,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:19,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:19,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 18:41:19,996 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 18:41:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash 594987084, now seen corresponding path program 1 times [2022-12-05 18:41:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:19,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479475940] [2022-12-05 18:41:19,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:19,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:21,213 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 18:41:21,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:21,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479475940] [2022-12-05 18:41:21,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479475940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:21,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:21,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:41:21,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544570275] [2022-12-05 18:41:21,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:21,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:41:21,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:21,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:41:21,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:41:21,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-05 18:41:21,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 90 transitions, 225 flow. Second operand has 11 states, 11 states have (on average 74.81818181818181) internal successors, (823), 11 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:21,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:21,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-05 18:41:21,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:22,586 INFO L130 PetriNetUnfolder]: 1297/2582 cut-off events. [2022-12-05 18:41:22,586 INFO L131 PetriNetUnfolder]: For 2597/2597 co-relation queries the response was YES. [2022-12-05 18:41:22,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6436 conditions, 2582 events. 1297/2582 cut-off events. For 2597/2597 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16769 event pairs, 63 based on Foata normal form. 68/2591 useless extension candidates. Maximal degree in co-relation 6374. Up to 792 conditions per place. [2022-12-05 18:41:22,609 INFO L137 encePairwiseOnDemand]: 86/105 looper letters, 38 selfloop transitions, 30 changer transitions 108/237 dead transitions. [2022-12-05 18:41:22,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 237 transitions, 1139 flow [2022-12-05 18:41:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-05 18:41:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-05 18:41:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1855 transitions. [2022-12-05 18:41:22,615 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7681159420289855 [2022-12-05 18:41:22,615 INFO L175 Difference]: Start difference. First operand has 120 places, 90 transitions, 225 flow. Second operand 23 states and 1855 transitions. [2022-12-05 18:41:22,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 237 transitions, 1139 flow [2022-12-05 18:41:22,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 237 transitions, 1100 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-05 18:41:22,640 INFO L231 Difference]: Finished difference. Result has 142 places, 115 transitions, 538 flow [2022-12-05 18:41:22,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=538, PETRI_PLACES=142, PETRI_TRANSITIONS=115} [2022-12-05 18:41:22,641 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 32 predicate places. [2022-12-05 18:41:22,641 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 115 transitions, 538 flow [2022-12-05 18:41:22,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 74.81818181818181) internal successors, (823), 11 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:22,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:22,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:22,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 18:41:22,642 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 18:41:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1733056795, now seen corresponding path program 1 times [2022-12-05 18:41:22,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:22,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92307933] [2022-12-05 18:41:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:23,283 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 18:41:23,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:23,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92307933] [2022-12-05 18:41:23,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92307933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:23,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:23,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:41:23,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726745452] [2022-12-05 18:41:23,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:23,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:41:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:23,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:41:23,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:41:23,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-05 18:41:23,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 115 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:23,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:23,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-05 18:41:23,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:24,223 INFO L130 PetriNetUnfolder]: 1231/2919 cut-off events. [2022-12-05 18:41:24,224 INFO L131 PetriNetUnfolder]: For 17154/21272 co-relation queries the response was YES. [2022-12-05 18:41:24,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11898 conditions, 2919 events. 1231/2919 cut-off events. For 17154/21272 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 22589 event pairs, 25 based on Foata normal form. 59/2912 useless extension candidates. Maximal degree in co-relation 11810. Up to 731 conditions per place. [2022-12-05 18:41:24,248 INFO L137 encePairwiseOnDemand]: 90/105 looper letters, 65 selfloop transitions, 25 changer transitions 70/221 dead transitions. [2022-12-05 18:41:24,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 221 transitions, 1706 flow [2022-12-05 18:41:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:41:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:41:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1059 transitions. [2022-12-05 18:41:24,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7758241758241758 [2022-12-05 18:41:24,251 INFO L175 Difference]: Start difference. First operand has 142 places, 115 transitions, 538 flow. Second operand 13 states and 1059 transitions. [2022-12-05 18:41:24,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 221 transitions, 1706 flow [2022-12-05 18:41:24,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 221 transitions, 1528 flow, removed 87 selfloop flow, removed 11 redundant places. [2022-12-05 18:41:24,292 INFO L231 Difference]: Finished difference. Result has 140 places, 128 transitions, 746 flow [2022-12-05 18:41:24,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=746, PETRI_PLACES=140, PETRI_TRANSITIONS=128} [2022-12-05 18:41:24,293 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 30 predicate places. [2022-12-05 18:41:24,293 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 746 flow [2022-12-05 18:41:24,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:24,294 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:24,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:24,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 18:41:24,294 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 18:41:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:24,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1775237194, now seen corresponding path program 1 times [2022-12-05 18:41:24,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:24,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928969481] [2022-12-05 18:41:24,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:24,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:24,986 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 18:41:24,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:24,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928969481] [2022-12-05 18:41:24,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928969481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:24,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:24,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:41:24,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107157205] [2022-12-05 18:41:24,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:24,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:41:24,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:24,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:41:24,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:41:24,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-05 18:41:24,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 128 transitions, 746 flow. Second operand has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:24,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:24,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-05 18:41:24,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:25,834 INFO L130 PetriNetUnfolder]: 1095/2726 cut-off events. [2022-12-05 18:41:25,835 INFO L131 PetriNetUnfolder]: For 17346/27046 co-relation queries the response was YES. [2022-12-05 18:41:25,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12231 conditions, 2726 events. 1095/2726 cut-off events. For 17346/27046 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 21338 event pairs, 56 based on Foata normal form. 70/2741 useless extension candidates. Maximal degree in co-relation 12136. Up to 837 conditions per place. [2022-12-05 18:41:25,857 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 66 selfloop transitions, 34 changer transitions 87/248 dead transitions. [2022-12-05 18:41:25,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 248 transitions, 2490 flow [2022-12-05 18:41:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:41:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:41:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1060 transitions. [2022-12-05 18:41:25,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7765567765567766 [2022-12-05 18:41:25,861 INFO L175 Difference]: Start difference. First operand has 140 places, 128 transitions, 746 flow. Second operand 13 states and 1060 transitions. [2022-12-05 18:41:25,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 248 transitions, 2490 flow [2022-12-05 18:41:25,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 248 transitions, 2414 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-05 18:41:25,886 INFO L231 Difference]: Finished difference. Result has 152 places, 145 transitions, 1120 flow [2022-12-05 18:41:25,887 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1120, PETRI_PLACES=152, PETRI_TRANSITIONS=145} [2022-12-05 18:41:25,887 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 42 predicate places. [2022-12-05 18:41:25,888 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 145 transitions, 1120 flow [2022-12-05 18:41:25,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:25,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:25,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:25,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 18:41:25,889 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 18:41:25,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1254750422, now seen corresponding path program 1 times [2022-12-05 18:41:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:25,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147192929] [2022-12-05 18:41:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:26,847 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 18:41:26,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:26,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147192929] [2022-12-05 18:41:26,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147192929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:26,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:26,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:41:26,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002003000] [2022-12-05 18:41:26,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:26,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:41:26,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:26,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:41:26,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:41:26,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-05 18:41:26,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 145 transitions, 1120 flow. Second operand has 10 states, 10 states have (on average 75.2) internal successors, (752), 10 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:26,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:26,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-05 18:41:26,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:27,842 INFO L130 PetriNetUnfolder]: 945/2295 cut-off events. [2022-12-05 18:41:27,843 INFO L131 PetriNetUnfolder]: For 24592/40149 co-relation queries the response was YES. [2022-12-05 18:41:27,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12405 conditions, 2295 events. 945/2295 cut-off events. For 24592/40149 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16741 event pairs, 64 based on Foata normal form. 75/2307 useless extension candidates. Maximal degree in co-relation 12299. Up to 790 conditions per place. [2022-12-05 18:41:27,867 INFO L137 encePairwiseOnDemand]: 86/105 looper letters, 51 selfloop transitions, 59 changer transitions 67/238 dead transitions. [2022-12-05 18:41:27,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 238 transitions, 2790 flow [2022-12-05 18:41:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:41:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:41:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1131 transitions. [2022-12-05 18:41:27,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7693877551020408 [2022-12-05 18:41:27,871 INFO L175 Difference]: Start difference. First operand has 152 places, 145 transitions, 1120 flow. Second operand 14 states and 1131 transitions. [2022-12-05 18:41:27,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 238 transitions, 2790 flow [2022-12-05 18:41:27,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 238 transitions, 2732 flow, removed 29 selfloop flow, removed 6 redundant places. [2022-12-05 18:41:27,929 INFO L231 Difference]: Finished difference. Result has 160 places, 158 transitions, 1527 flow [2022-12-05 18:41:27,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1527, PETRI_PLACES=160, PETRI_TRANSITIONS=158} [2022-12-05 18:41:27,932 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 50 predicate places. [2022-12-05 18:41:27,932 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 158 transitions, 1527 flow [2022-12-05 18:41:27,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.2) internal successors, (752), 10 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:27,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:27,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:27,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 18:41:27,933 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 18:41:27,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:27,934 INFO L85 PathProgramCache]: Analyzing trace with hash -529630980, now seen corresponding path program 2 times [2022-12-05 18:41:27,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:27,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325966335] [2022-12-05 18:41:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:27,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:28,510 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 18:41:28,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:28,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325966335] [2022-12-05 18:41:28,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325966335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:28,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:28,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:41:28,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326994101] [2022-12-05 18:41:28,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:28,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:41:28,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:28,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:41:28,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:41:28,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-05 18:41:28,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 158 transitions, 1527 flow. Second operand has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 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 18:41:28,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:28,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-05 18:41:28,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:29,386 INFO L130 PetriNetUnfolder]: 967/2520 cut-off events. [2022-12-05 18:41:29,386 INFO L131 PetriNetUnfolder]: For 33036/53719 co-relation queries the response was YES. [2022-12-05 18:41:29,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14841 conditions, 2520 events. 967/2520 cut-off events. For 33036/53719 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 19538 event pairs, 94 based on Foata normal form. 134/2578 useless extension candidates. Maximal degree in co-relation 14721. Up to 694 conditions per place. [2022-12-05 18:41:29,464 INFO L137 encePairwiseOnDemand]: 90/105 looper letters, 75 selfloop transitions, 40 changer transitions 76/252 dead transitions. [2022-12-05 18:41:29,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 252 transitions, 3199 flow [2022-12-05 18:41:29,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:41:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:41:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1055 transitions. [2022-12-05 18:41:29,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7728937728937729 [2022-12-05 18:41:29,468 INFO L175 Difference]: Start difference. First operand has 160 places, 158 transitions, 1527 flow. Second operand 13 states and 1055 transitions. [2022-12-05 18:41:29,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 252 transitions, 3199 flow [2022-12-05 18:41:29,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 252 transitions, 3024 flow, removed 82 selfloop flow, removed 6 redundant places. [2022-12-05 18:41:29,544 INFO L231 Difference]: Finished difference. Result has 172 places, 156 transitions, 1644 flow [2022-12-05 18:41:29,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1644, PETRI_PLACES=172, PETRI_TRANSITIONS=156} [2022-12-05 18:41:29,545 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 62 predicate places. [2022-12-05 18:41:29,545 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 156 transitions, 1644 flow [2022-12-05 18:41:29,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 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 18:41:29,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:29,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:29,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 18:41:29,546 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 18:41:29,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:29,547 INFO L85 PathProgramCache]: Analyzing trace with hash 43043921, now seen corresponding path program 1 times [2022-12-05 18:41:29,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:29,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903121595] [2022-12-05 18:41:29,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:29,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:41:30,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:30,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903121595] [2022-12-05 18:41:30,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903121595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:30,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:30,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:41:30,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6818849] [2022-12-05 18:41:30,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:30,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:41:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:30,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:41:30,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:41:30,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-05 18:41:30,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 156 transitions, 1644 flow. Second operand has 10 states, 10 states have (on average 75.2) internal successors, (752), 10 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:30,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:30,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-05 18:41:30,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:31,446 INFO L130 PetriNetUnfolder]: 858/2315 cut-off events. [2022-12-05 18:41:31,446 INFO L131 PetriNetUnfolder]: For 39189/45546 co-relation queries the response was YES. [2022-12-05 18:41:31,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14798 conditions, 2315 events. 858/2315 cut-off events. For 39189/45546 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17748 event pairs, 107 based on Foata normal form. 148/2397 useless extension candidates. Maximal degree in co-relation 14747. Up to 741 conditions per place. [2022-12-05 18:41:31,473 INFO L137 encePairwiseOnDemand]: 87/105 looper letters, 56 selfloop transitions, 61 changer transitions 84/262 dead transitions. [2022-12-05 18:41:31,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 262 transitions, 4076 flow [2022-12-05 18:41:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 18:41:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 18:41:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1417 transitions. [2022-12-05 18:41:31,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7497354497354497 [2022-12-05 18:41:31,478 INFO L175 Difference]: Start difference. First operand has 172 places, 156 transitions, 1644 flow. Second operand 18 states and 1417 transitions. [2022-12-05 18:41:31,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 262 transitions, 4076 flow [2022-12-05 18:41:31,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 262 transitions, 3858 flow, removed 109 selfloop flow, removed 10 redundant places. [2022-12-05 18:41:31,555 INFO L231 Difference]: Finished difference. Result has 183 places, 166 transitions, 1998 flow [2022-12-05 18:41:31,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1998, PETRI_PLACES=183, PETRI_TRANSITIONS=166} [2022-12-05 18:41:31,556 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 73 predicate places. [2022-12-05 18:41:31,556 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 166 transitions, 1998 flow [2022-12-05 18:41:31,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.2) internal successors, (752), 10 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:31,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:31,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:31,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 18:41:31,557 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 18:41:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:31,558 INFO L85 PathProgramCache]: Analyzing trace with hash -751304793, now seen corresponding path program 1 times [2022-12-05 18:41:31,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:31,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325508494] [2022-12-05 18:41:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:31,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:32,121 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 18:41:32,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:32,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325508494] [2022-12-05 18:41:32,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325508494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:32,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:32,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:41:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375513157] [2022-12-05 18:41:32,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:32,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:41:32,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:32,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:41:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:41:32,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-12-05 18:41:32,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 166 transitions, 1998 flow. Second operand has 10 states, 10 states have (on average 82.6) internal successors, (826), 10 states have internal predecessors, (826), 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 18:41:32,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:32,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-12-05 18:41:32,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:32,897 INFO L130 PetriNetUnfolder]: 686/2037 cut-off events. [2022-12-05 18:41:32,897 INFO L131 PetriNetUnfolder]: For 43059/49684 co-relation queries the response was YES. [2022-12-05 18:41:32,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13265 conditions, 2037 events. 686/2037 cut-off events. For 43059/49684 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16465 event pairs, 88 based on Foata normal form. 246/2233 useless extension candidates. Maximal degree in co-relation 13210. Up to 527 conditions per place. [2022-12-05 18:41:32,918 INFO L137 encePairwiseOnDemand]: 93/105 looper letters, 43 selfloop transitions, 33 changer transitions 122/305 dead transitions. [2022-12-05 18:41:32,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 305 transitions, 5062 flow [2022-12-05 18:41:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 18:41:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 18:41:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1781 transitions. [2022-12-05 18:41:32,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8077097505668934 [2022-12-05 18:41:32,921 INFO L175 Difference]: Start difference. First operand has 183 places, 166 transitions, 1998 flow. Second operand 21 states and 1781 transitions. [2022-12-05 18:41:32,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 305 transitions, 5062 flow [2022-12-05 18:41:32,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 305 transitions, 4721 flow, removed 109 selfloop flow, removed 15 redundant places. [2022-12-05 18:41:32,986 INFO L231 Difference]: Finished difference. Result has 194 places, 175 transitions, 2193 flow [2022-12-05 18:41:32,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2193, PETRI_PLACES=194, PETRI_TRANSITIONS=175} [2022-12-05 18:41:32,987 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 84 predicate places. [2022-12-05 18:41:32,987 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 175 transitions, 2193 flow [2022-12-05 18:41:32,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 82.6) internal successors, (826), 10 states have internal predecessors, (826), 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 18:41:32,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:32,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:32,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 18:41:32,988 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 18:41:32,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1928332586, now seen corresponding path program 1 times [2022-12-05 18:41:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:32,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044733851] [2022-12-05 18:41:32,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:32,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:33,699 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 18:41:33,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:33,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044733851] [2022-12-05 18:41:33,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044733851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:33,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:33,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:41:33,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843954975] [2022-12-05 18:41:33,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:33,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:41:33,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:33,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:41:33,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:41:33,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2022-12-05 18:41:33,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 175 transitions, 2193 flow. Second operand has 11 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 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 18:41:33,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:33,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2022-12-05 18:41:33,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:34,195 INFO L130 PetriNetUnfolder]: 419/1390 cut-off events. [2022-12-05 18:41:34,196 INFO L131 PetriNetUnfolder]: For 31909/40771 co-relation queries the response was YES. [2022-12-05 18:41:34,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10031 conditions, 1390 events. 419/1390 cut-off events. For 31909/40771 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10385 event pairs, 47 based on Foata normal form. 112/1437 useless extension candidates. Maximal degree in co-relation 9972. Up to 417 conditions per place. [2022-12-05 18:41:34,210 INFO L137 encePairwiseOnDemand]: 93/105 looper letters, 57 selfloop transitions, 38 changer transitions 24/225 dead transitions. [2022-12-05 18:41:34,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 225 transitions, 3575 flow [2022-12-05 18:41:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:41:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:41:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1170 transitions. [2022-12-05 18:41:34,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7959183673469388 [2022-12-05 18:41:34,214 INFO L175 Difference]: Start difference. First operand has 194 places, 175 transitions, 2193 flow. Second operand 14 states and 1170 transitions. [2022-12-05 18:41:34,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 225 transitions, 3575 flow [2022-12-05 18:41:34,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 225 transitions, 3342 flow, removed 83 selfloop flow, removed 10 redundant places. [2022-12-05 18:41:34,294 INFO L231 Difference]: Finished difference. Result has 194 places, 193 transitions, 2588 flow [2022-12-05 18:41:34,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2588, PETRI_PLACES=194, PETRI_TRANSITIONS=193} [2022-12-05 18:41:34,295 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 84 predicate places. [2022-12-05 18:41:34,295 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 193 transitions, 2588 flow [2022-12-05 18:41:34,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 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 18:41:34,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:34,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:34,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 18:41:34,296 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 18:41:34,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:34,297 INFO L85 PathProgramCache]: Analyzing trace with hash -146797542, now seen corresponding path program 2 times [2022-12-05 18:41:34,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:34,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287354503] [2022-12-05 18:41:34,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:34,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:35,015 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 18:41:35,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:35,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287354503] [2022-12-05 18:41:35,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287354503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:35,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:35,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:41:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309786617] [2022-12-05 18:41:35,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:35,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:41:35,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:35,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:41:35,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:41:35,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 105 [2022-12-05 18:41:35,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 193 transitions, 2588 flow. Second operand has 13 states, 13 states have (on average 79.61538461538461) internal successors, (1035), 13 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:35,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:35,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 105 [2022-12-05 18:41:35,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:35,511 INFO L130 PetriNetUnfolder]: 439/1468 cut-off events. [2022-12-05 18:41:35,512 INFO L131 PetriNetUnfolder]: For 36451/47007 co-relation queries the response was YES. [2022-12-05 18:41:35,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11058 conditions, 1468 events. 439/1468 cut-off events. For 36451/47007 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11257 event pairs, 55 based on Foata normal form. 118/1524 useless extension candidates. Maximal degree in co-relation 10994. Up to 491 conditions per place. [2022-12-05 18:41:35,530 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 78 selfloop transitions, 19 changer transitions 24/225 dead transitions. [2022-12-05 18:41:35,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 225 transitions, 3690 flow [2022-12-05 18:41:35,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:41:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:41:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1136 transitions. [2022-12-05 18:41:35,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7727891156462585 [2022-12-05 18:41:35,534 INFO L175 Difference]: Start difference. First operand has 194 places, 193 transitions, 2588 flow. Second operand 14 states and 1136 transitions. [2022-12-05 18:41:35,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 225 transitions, 3690 flow [2022-12-05 18:41:35,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 225 transitions, 3629 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-12-05 18:41:35,611 INFO L231 Difference]: Finished difference. Result has 202 places, 196 transitions, 2712 flow [2022-12-05 18:41:35,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2551, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2712, PETRI_PLACES=202, PETRI_TRANSITIONS=196} [2022-12-05 18:41:35,611 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 92 predicate places. [2022-12-05 18:41:35,612 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 196 transitions, 2712 flow [2022-12-05 18:41:35,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 79.61538461538461) internal successors, (1035), 13 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:35,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:35,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:35,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 18:41:35,613 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 18:41:35,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:35,613 INFO L85 PathProgramCache]: Analyzing trace with hash -283370782, now seen corresponding path program 3 times [2022-12-05 18:41:35,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:35,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627802976] [2022-12-05 18:41:35,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:35,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:36,718 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 18:41:36,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:36,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627802976] [2022-12-05 18:41:36,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627802976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:36,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:36,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:41:36,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501387417] [2022-12-05 18:41:36,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:36,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:41:36,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:36,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:41:36,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:41:36,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 105 [2022-12-05 18:41:36,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 196 transitions, 2712 flow. Second operand has 13 states, 13 states have (on average 73.0) internal successors, (949), 13 states have internal predecessors, (949), 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 18:41:36,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:36,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 105 [2022-12-05 18:41:36,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:37,485 INFO L130 PetriNetUnfolder]: 534/1796 cut-off events. [2022-12-05 18:41:37,485 INFO L131 PetriNetUnfolder]: For 42975/60665 co-relation queries the response was YES. [2022-12-05 18:41:37,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13680 conditions, 1796 events. 534/1796 cut-off events. For 42975/60665 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14293 event pairs, 35 based on Foata normal form. 226/1957 useless extension candidates. Maximal degree in co-relation 13613. Up to 472 conditions per place. [2022-12-05 18:41:37,508 INFO L137 encePairwiseOnDemand]: 87/105 looper letters, 84 selfloop transitions, 88 changer transitions 67/298 dead transitions. [2022-12-05 18:41:37,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 298 transitions, 5617 flow [2022-12-05 18:41:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-05 18:41:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-05 18:41:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1515 transitions. [2022-12-05 18:41:37,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7214285714285714 [2022-12-05 18:41:37,511 INFO L175 Difference]: Start difference. First operand has 202 places, 196 transitions, 2712 flow. Second operand 20 states and 1515 transitions. [2022-12-05 18:41:37,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 298 transitions, 5617 flow [2022-12-05 18:41:37,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 298 transitions, 5395 flow, removed 102 selfloop flow, removed 10 redundant places. [2022-12-05 18:41:37,657 INFO L231 Difference]: Finished difference. Result has 218 places, 216 transitions, 3398 flow [2022-12-05 18:41:37,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2629, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3398, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2022-12-05 18:41:37,659 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 108 predicate places. [2022-12-05 18:41:37,659 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 3398 flow [2022-12-05 18:41:37,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 73.0) internal successors, (949), 13 states have internal predecessors, (949), 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 18:41:37,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:37,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:37,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 18:41:37,662 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 18:41:37,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1604109638, now seen corresponding path program 4 times [2022-12-05 18:41:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:37,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585225174] [2022-12-05 18:41:37,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:38,274 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 18:41:38,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:38,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585225174] [2022-12-05 18:41:38,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585225174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:38,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:38,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 18:41:38,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53706719] [2022-12-05 18:41:38,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:38,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 18:41:38,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:38,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 18:41:38,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-05 18:41:38,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2022-12-05 18:41:38,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 3398 flow. Second operand has 12 states, 12 states have (on average 81.58333333333333) internal successors, (979), 12 states have internal predecessors, (979), 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 18:41:38,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:38,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2022-12-05 18:41:38,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:38,813 INFO L130 PetriNetUnfolder]: 403/1591 cut-off events. [2022-12-05 18:41:38,813 INFO L131 PetriNetUnfolder]: For 46028/65305 co-relation queries the response was YES. [2022-12-05 18:41:38,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12469 conditions, 1591 events. 403/1591 cut-off events. For 46028/65305 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13449 event pairs, 42 based on Foata normal form. 126/1657 useless extension candidates. Maximal degree in co-relation 12395. Up to 373 conditions per place. [2022-12-05 18:41:38,829 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 79 selfloop transitions, 27 changer transitions 48/255 dead transitions. [2022-12-05 18:41:38,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 255 transitions, 4899 flow [2022-12-05 18:41:38,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:41:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:41:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1085 transitions. [2022-12-05 18:41:38,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7948717948717948 [2022-12-05 18:41:38,832 INFO L175 Difference]: Start difference. First operand has 218 places, 216 transitions, 3398 flow. Second operand 13 states and 1085 transitions. [2022-12-05 18:41:38,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 255 transitions, 4899 flow [2022-12-05 18:41:39,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 255 transitions, 4696 flow, removed 85 selfloop flow, removed 13 redundant places. [2022-12-05 18:41:39,028 INFO L231 Difference]: Finished difference. Result has 215 places, 201 transitions, 3168 flow [2022-12-05 18:41:39,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=3295, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3168, PETRI_PLACES=215, PETRI_TRANSITIONS=201} [2022-12-05 18:41:39,029 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 105 predicate places. [2022-12-05 18:41:39,029 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 201 transitions, 3168 flow [2022-12-05 18:41:39,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 81.58333333333333) internal successors, (979), 12 states have internal predecessors, (979), 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 18:41:39,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:39,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:39,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 18:41:39,030 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:41:39,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:39,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2024332690, now seen corresponding path program 1 times [2022-12-05 18:41:39,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:39,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38965157] [2022-12-05 18:41:39,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:39,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:39,163 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 18:41:39,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:39,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38965157] [2022-12-05 18:41:39,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38965157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:39,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:39,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:41:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523265558] [2022-12-05 18:41:39,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:39,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:41:39,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:39,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:41:39,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:41:39,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2022-12-05 18:41:39,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 201 transitions, 3168 flow. Second operand has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:39,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:39,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2022-12-05 18:41:39,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:40,212 INFO L130 PetriNetUnfolder]: 2590/5953 cut-off events. [2022-12-05 18:41:40,212 INFO L131 PetriNetUnfolder]: For 92101/96643 co-relation queries the response was YES. [2022-12-05 18:41:40,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27994 conditions, 5953 events. 2590/5953 cut-off events. For 92101/96643 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 54636 event pairs, 139 based on Foata normal form. 475/6101 useless extension candidates. Maximal degree in co-relation 27920. Up to 1705 conditions per place. [2022-12-05 18:41:40,255 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 94 selfloop transitions, 7 changer transitions 134/338 dead transitions. [2022-12-05 18:41:40,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 338 transitions, 6377 flow [2022-12-05 18:41:40,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:41:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:41:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 893 transitions. [2022-12-05 18:41:40,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8504761904761905 [2022-12-05 18:41:40,258 INFO L175 Difference]: Start difference. First operand has 215 places, 201 transitions, 3168 flow. Second operand 10 states and 893 transitions. [2022-12-05 18:41:40,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 338 transitions, 6377 flow [2022-12-05 18:41:40,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 338 transitions, 6047 flow, removed 109 selfloop flow, removed 20 redundant places. [2022-12-05 18:41:40,440 INFO L231 Difference]: Finished difference. Result has 204 places, 172 transitions, 2392 flow [2022-12-05 18:41:40,441 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2330, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2392, PETRI_PLACES=204, PETRI_TRANSITIONS=172} [2022-12-05 18:41:40,441 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 94 predicate places. [2022-12-05 18:41:40,441 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 172 transitions, 2392 flow [2022-12-05 18:41:40,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:40,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:40,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:40,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 18:41:40,442 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:41:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1441962752, now seen corresponding path program 1 times [2022-12-05 18:41:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:40,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430811382] [2022-12-05 18:41:40,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:41,089 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 18:41:41,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:41,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430811382] [2022-12-05 18:41:41,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430811382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:41,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:41,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:41:41,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012339000] [2022-12-05 18:41:41,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:41,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:41:41,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:41,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:41:41,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:41:41,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2022-12-05 18:41:41,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 172 transitions, 2392 flow. Second operand has 13 states, 13 states have (on average 81.46153846153847) internal successors, (1059), 13 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:41,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:41,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2022-12-05 18:41:41,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:41,656 INFO L130 PetriNetUnfolder]: 628/2522 cut-off events. [2022-12-05 18:41:41,657 INFO L131 PetriNetUnfolder]: For 30222/31575 co-relation queries the response was YES. [2022-12-05 18:41:41,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11940 conditions, 2522 events. 628/2522 cut-off events. For 30222/31575 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 25301 event pairs, 254 based on Foata normal form. 93/2423 useless extension candidates. Maximal degree in co-relation 11874. Up to 748 conditions per place. [2022-12-05 18:41:41,677 INFO L137 encePairwiseOnDemand]: 93/105 looper letters, 53 selfloop transitions, 20 changer transitions 27/195 dead transitions. [2022-12-05 18:41:41,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 195 transitions, 3213 flow [2022-12-05 18:41:41,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:41:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:41:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1160 transitions. [2022-12-05 18:41:41,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7891156462585034 [2022-12-05 18:41:41,682 INFO L175 Difference]: Start difference. First operand has 204 places, 172 transitions, 2392 flow. Second operand 14 states and 1160 transitions. [2022-12-05 18:41:41,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 195 transitions, 3213 flow [2022-12-05 18:41:41,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 195 transitions, 3142 flow, removed 33 selfloop flow, removed 4 redundant places. [2022-12-05 18:41:41,787 INFO L231 Difference]: Finished difference. Result has 216 places, 165 transitions, 2228 flow [2022-12-05 18:41:41,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2357, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2228, PETRI_PLACES=216, PETRI_TRANSITIONS=165} [2022-12-05 18:41:41,788 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 106 predicate places. [2022-12-05 18:41:41,788 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 165 transitions, 2228 flow [2022-12-05 18:41:41,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 81.46153846153847) internal successors, (1059), 13 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:41,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:41,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:41,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 18:41:41,789 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:41:41,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1971169800, now seen corresponding path program 1 times [2022-12-05 18:41:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:41,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274719902] [2022-12-05 18:41:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:41,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:41,935 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 18:41:41,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:41,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274719902] [2022-12-05 18:41:41,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274719902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:41,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:41,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:41:41,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330758872] [2022-12-05 18:41:41,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:41,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:41:41,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:41,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:41:41,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:41:41,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2022-12-05 18:41:41,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 165 transitions, 2228 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:41,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:41,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2022-12-05 18:41:41,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:42,523 INFO L130 PetriNetUnfolder]: 1013/2736 cut-off events. [2022-12-05 18:41:42,523 INFO L131 PetriNetUnfolder]: For 31198/32053 co-relation queries the response was YES. [2022-12-05 18:41:42,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14608 conditions, 2736 events. 1013/2736 cut-off events. For 31198/32053 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 23449 event pairs, 63 based on Foata normal form. 234/2938 useless extension candidates. Maximal degree in co-relation 14537. Up to 991 conditions per place. [2022-12-05 18:41:42,547 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 71 selfloop transitions, 18 changer transitions 69/254 dead transitions. [2022-12-05 18:41:42,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 254 transitions, 4211 flow [2022-12-05 18:41:42,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 18:41:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 18:41:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 977 transitions. [2022-12-05 18:41:42,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8458874458874459 [2022-12-05 18:41:42,550 INFO L175 Difference]: Start difference. First operand has 216 places, 165 transitions, 2228 flow. Second operand 11 states and 977 transitions. [2022-12-05 18:41:42,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 254 transitions, 4211 flow [2022-12-05 18:41:42,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 254 transitions, 3876 flow, removed 67 selfloop flow, removed 35 redundant places. [2022-12-05 18:41:42,614 INFO L231 Difference]: Finished difference. Result has 191 places, 160 transitions, 1831 flow [2022-12-05 18:41:42,615 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1831, PETRI_PLACES=191, PETRI_TRANSITIONS=160} [2022-12-05 18:41:42,615 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 81 predicate places. [2022-12-05 18:41:42,615 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 160 transitions, 1831 flow [2022-12-05 18:41:42,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:42,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:42,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:42,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 18:41:42,616 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:41:42,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash 601020923, now seen corresponding path program 1 times [2022-12-05 18:41:42,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:42,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380854930] [2022-12-05 18:41:42,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:41:42,772 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 18:41:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:41:42,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380854930] [2022-12-05 18:41:42,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380854930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:41:42,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:41:42,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:41:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592651685] [2022-12-05 18:41:42,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:41:42,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:41:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:41:42,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:41:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:41:42,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2022-12-05 18:41:42,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 160 transitions, 1831 flow. Second operand has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:42,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:41:42,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2022-12-05 18:41:42,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:41:43,302 INFO L130 PetriNetUnfolder]: 656/2039 cut-off events. [2022-12-05 18:41:43,302 INFO L131 PetriNetUnfolder]: For 20910/21757 co-relation queries the response was YES. [2022-12-05 18:41:43,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11532 conditions, 2039 events. 656/2039 cut-off events. For 20910/21757 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18366 event pairs, 39 based on Foata normal form. 144/2154 useless extension candidates. Maximal degree in co-relation 11481. Up to 642 conditions per place. [2022-12-05 18:41:43,315 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 20 selfloop transitions, 12 changer transitions 127/228 dead transitions. [2022-12-05 18:41:43,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 228 transitions, 3168 flow [2022-12-05 18:41:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:41:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:41:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1216 transitions. [2022-12-05 18:41:43,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8272108843537415 [2022-12-05 18:41:43,318 INFO L175 Difference]: Start difference. First operand has 191 places, 160 transitions, 1831 flow. Second operand 14 states and 1216 transitions. [2022-12-05 18:41:43,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 228 transitions, 3168 flow [2022-12-05 18:41:43,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 228 transitions, 2939 flow, removed 91 selfloop flow, removed 11 redundant places. [2022-12-05 18:41:43,395 INFO L231 Difference]: Finished difference. Result has 199 places, 95 transitions, 568 flow [2022-12-05 18:41:43,395 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=568, PETRI_PLACES=199, PETRI_TRANSITIONS=95} [2022-12-05 18:41:43,396 INFO L294 CegarLoopForPetriNet]: 110 programPoint places, 89 predicate places. [2022-12-05 18:41:43,396 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 95 transitions, 568 flow [2022-12-05 18:41:43,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:41:43,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:41:43,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:43,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 18:41:43,397 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:41:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:41:43,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1532914130, now seen corresponding path program 1 times [2022-12-05 18:41:43,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:41:43,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775555955] [2022-12-05 18:41:43,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:41:43,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:41:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:41:43,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 18:41:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:41:43,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 18:41:43,487 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 18:41:43,488 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 18:41:43,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 18:41:43,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 18:41:43,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 18:41:43,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 18:41:43,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 18:41:43,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 18:41:43,493 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:41:43,499 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 18:41:43,500 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 18:41:43,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 06:41:43 BasicIcfg [2022-12-05 18:41:43,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 18:41:43,601 INFO L158 Benchmark]: Toolchain (without parser) took 26887.46ms. Allocated memory was 218.1MB in the beginning and 791.7MB in the end (delta: 573.6MB). Free memory was 194.0MB in the beginning and 598.8MB in the end (delta: -404.9MB). Peak memory consumption was 169.2MB. Max. memory is 8.0GB. [2022-12-05 18:41:43,602 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 218.1MB. Free memory is still 195.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 18:41:43,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.96ms. Allocated memory is still 218.1MB. Free memory was 193.4MB in the beginning and 167.7MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 18:41:43,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.07ms. Allocated memory is still 218.1MB. Free memory was 167.7MB in the beginning and 165.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:41:43,602 INFO L158 Benchmark]: Boogie Preprocessor took 25.04ms. Allocated memory is still 218.1MB. Free memory was 165.1MB in the beginning and 163.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:41:43,602 INFO L158 Benchmark]: RCFGBuilder took 601.49ms. Allocated memory is still 218.1MB. Free memory was 163.0MB in the beginning and 131.0MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-05 18:41:43,603 INFO L158 Benchmark]: TraceAbstraction took 25632.59ms. Allocated memory was 218.1MB in the beginning and 791.7MB in the end (delta: 573.6MB). Free memory was 130.0MB in the beginning and 598.8MB in the end (delta: -468.8MB). Peak memory consumption was 105.3MB. Max. memory is 8.0GB. [2022-12-05 18:41:43,604 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 218.1MB. Free memory is still 195.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 551.96ms. Allocated memory is still 218.1MB. Free memory was 193.4MB in the beginning and 167.7MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.07ms. Allocated memory is still 218.1MB. Free memory was 167.7MB in the beginning and 165.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.04ms. Allocated memory is still 218.1MB. Free memory was 165.1MB in the beginning and 163.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 601.49ms. Allocated memory is still 218.1MB. Free memory was 163.0MB in the beginning and 131.0MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 25632.59ms. Allocated memory was 218.1MB in the beginning and 791.7MB in the end (delta: 573.6MB). Free memory was 130.0MB in the beginning and 598.8MB in the end (delta: -468.8MB). Peak memory consumption was 105.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t2492; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2493; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2494; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1206 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1206 mSDsluCounter, 1663 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1346 mSDsCounter, 213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2271 IncrementalHoareTripleChecker+Invalid, 2484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 213 mSolverCounterUnsat, 317 mSDtfsCounter, 2271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3398occurred in iteration=12, InterpolantAutomatonStates: 237, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1306 NumberOfCodeBlocks, 1306 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1208 ConstructedInterpolants, 0 QuantifiedInterpolants, 7930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 18:41:43,624 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...