/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:33:24,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:33:24,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:33:24,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:33:24,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:33:24,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:33:24,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:33:24,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:33:24,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:33:24,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:33:24,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:33:24,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:33:24,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:33:24,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:33:24,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:33:24,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:33:24,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:33:24,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:33:24,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:33:24,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:33:24,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:33:24,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:33:24,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:33:24,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:33:24,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:33:24,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:33:24,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:33:24,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:33:24,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:33:24,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:33:24,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:33:24,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:33:24,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:33:24,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:33:24,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:33:24,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:33:24,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:33:24,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:33:24,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:33:24,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:33:24,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:33:24,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 18:33:24,878 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:33:24,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:33:24,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:33:24,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:33:24,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:33:24,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:33:24,882 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:33:24,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:33:24,882 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:33:24,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:33:24,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:33:24,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:33:24,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:33:24,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:33:24,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:33:24,883 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:33:24,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:33:24,883 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:33:24,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:33:24,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:33:24,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:33:24,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:33:24,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:33:24,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:33:24,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:33:24,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:33:24,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:33:24,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:33:24,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:33:24,885 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:33:24,885 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 18:33:25,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:33:25,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:33:25,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:33:25,193 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:33:25,193 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:33:25,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-12-12 18:33:26,337 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:33:26,583 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:33:26,583 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-12-12 18:33:26,601 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a32424f1/c1dbb4f8cd3849fea6440ea013718f04/FLAGeda2b8e83 [2022-12-12 18:33:26,613 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a32424f1/c1dbb4f8cd3849fea6440ea013718f04 [2022-12-12 18:33:26,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:33:26,616 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:33:26,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:33:26,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:33:26,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:33:26,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:33:26" (1/1) ... [2022-12-12 18:33:26,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50208a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:26, skipping insertion in model container [2022-12-12 18:33:26,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:33:26" (1/1) ... [2022-12-12 18:33:26,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:33:26,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:33:26,809 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/mix017_power.opt_rmo.opt.i[958,971] [2022-12-12 18:33:26,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:26,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:26,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:33:27,013 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:33:27,021 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/mix017_power.opt_rmo.opt.i[958,971] [2022-12-12 18:33:27,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:33:27,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:33:27,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:33:27,118 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:33:27,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27 WrapperNode [2022-12-12 18:33:27,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:33:27,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:33:27,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:33:27,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:33:27,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27" (1/1) ... [2022-12-12 18:33:27,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27" (1/1) ... [2022-12-12 18:33:27,183 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-12 18:33:27,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:33:27,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:33:27,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:33:27,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:33:27,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27" (1/1) ... [2022-12-12 18:33:27,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27" (1/1) ... [2022-12-12 18:33:27,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27" (1/1) ... [2022-12-12 18:33:27,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27" (1/1) ... [2022-12-12 18:33:27,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27" (1/1) ... [2022-12-12 18:33:27,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27" (1/1) ... [2022-12-12 18:33:27,218 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27" (1/1) ... [2022-12-12 18:33:27,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27" (1/1) ... [2022-12-12 18:33:27,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:33:27,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:33:27,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:33:27,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:33:27,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27" (1/1) ... [2022-12-12 18:33:27,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:33:27,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:33:27,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 18:33:27,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 18:33:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:33:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:33:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:33:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:33:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:33:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:33:27,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:33:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:33:27,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:33:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:33:27,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:33:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 18:33:27,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 18:33:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:33:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:33:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:33:27,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:33:27,294 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:33:27,452 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:33:27,453 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:33:27,665 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:33:27,760 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:33:27,760 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:33:27,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:33:27 BoogieIcfgContainer [2022-12-12 18:33:27,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:33:27,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:33:27,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:33:27,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:33:27,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:33:26" (1/3) ... [2022-12-12 18:33:27,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e092ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:33:27, skipping insertion in model container [2022-12-12 18:33:27,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:33:27" (2/3) ... [2022-12-12 18:33:27,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e092ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:33:27, skipping insertion in model container [2022-12-12 18:33:27,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:33:27" (3/3) ... [2022-12-12 18:33:27,774 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2022-12-12 18:33:27,790 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:33:27,791 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:33:27,791 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:33:27,853 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:33:27,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-12 18:33:27,936 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-12 18:33:27,937 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:33:27,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-12 18:33:27,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-12 18:33:27,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-12 18:33:27,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:33:27,956 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-12 18:33:27,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-12 18:33:27,976 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-12 18:33:27,976 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:33:27,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-12 18:33:27,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-12 18:33:27,980 INFO L226 LiptonReduction]: Number of co-enabled transitions 2852 [2022-12-12 18:33:33,121 INFO L241 LiptonReduction]: Total number of compositions: 101 [2022-12-12 18:33:33,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:33:33,172 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;@51e0d38c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:33:33,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 18:33:33,187 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-12 18:33:33,187 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:33:33,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:33,188 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:33,188 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:33:33,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:33,208 INFO L85 PathProgramCache]: Analyzing trace with hash -710551530, now seen corresponding path program 1 times [2022-12-12 18:33:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:33,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274182531] [2022-12-12 18:33:33,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:33,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:33,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:33,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274182531] [2022-12-12 18:33:33,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274182531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:33,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:33,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:33:33,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001235299] [2022-12-12 18:33:33,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:33,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:33:33,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:33,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:33:33,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:33:33,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 71 [2022-12-12 18:33:33,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:33,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:33,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 71 [2022-12-12 18:33:33,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:33:38,299 INFO L130 PetriNetUnfolder]: 43504/62894 cut-off events. [2022-12-12 18:33:38,299 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-12 18:33:38,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120803 conditions, 62894 events. 43504/62894 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 3603. Compared 474314 event pairs, 11360 based on Foata normal form. 0/38728 useless extension candidates. Maximal degree in co-relation 120791. Up to 48285 conditions per place. [2022-12-12 18:33:38,525 INFO L137 encePairwiseOnDemand]: 66/71 looper letters, 40 selfloop transitions, 2 changer transitions 54/111 dead transitions. [2022-12-12 18:33:38,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 111 transitions, 429 flow [2022-12-12 18:33:38,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:33:38,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:33:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-12-12 18:33:38,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6854460093896714 [2022-12-12 18:33:38,537 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 0 predicate places. [2022-12-12 18:33:38,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 111 transitions, 429 flow [2022-12-12 18:33:38,609 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 57 transitions, 213 flow [2022-12-12 18:33:38,610 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 213 flow [2022-12-12 18:33:38,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:38,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:38,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:38,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:33:38,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:33:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:38,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1665542740, now seen corresponding path program 1 times [2022-12-12 18:33:38,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:38,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972167270] [2022-12-12 18:33:38,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:38,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:38,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972167270] [2022-12-12 18:33:38,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972167270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:38,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:38,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:33:38,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929302295] [2022-12-12 18:33:38,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:38,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:33:38,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:38,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:33:38,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:33:38,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 18:33:38,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:38,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:38,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 18:33:38,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:33:40,530 INFO L130 PetriNetUnfolder]: 16980/23587 cut-off events. [2022-12-12 18:33:40,530 INFO L131 PetriNetUnfolder]: For 4112/4112 co-relation queries the response was YES. [2022-12-12 18:33:40,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64533 conditions, 23587 events. 16980/23587 cut-off events. For 4112/4112 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 133240 event pairs, 2775 based on Foata normal form. 16/19686 useless extension candidates. Maximal degree in co-relation 64518. Up to 22336 conditions per place. [2022-12-12 18:33:40,718 INFO L137 encePairwiseOnDemand]: 65/71 looper letters, 64 selfloop transitions, 6 changer transitions 2/82 dead transitions. [2022-12-12 18:33:40,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 461 flow [2022-12-12 18:33:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:33:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:33:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-12 18:33:40,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37089201877934275 [2022-12-12 18:33:40,721 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -25 predicate places. [2022-12-12 18:33:40,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 82 transitions, 461 flow [2022-12-12 18:33:40,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 80 transitions, 453 flow [2022-12-12 18:33:40,798 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 80 transitions, 453 flow [2022-12-12 18:33:40,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:40,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:40,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:40,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:33:40,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:33:40,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:40,799 INFO L85 PathProgramCache]: Analyzing trace with hash 525850217, now seen corresponding path program 1 times [2022-12-12 18:33:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:40,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021220772] [2022-12-12 18:33:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:40,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:40,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021220772] [2022-12-12 18:33:40,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021220772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:40,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:40,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:33:40,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35525523] [2022-12-12 18:33:40,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:40,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:33:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:40,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:33:40,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:33:40,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 18:33:40,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 80 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:40,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:40,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 18:33:40,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:33:42,423 INFO L130 PetriNetUnfolder]: 12559/17593 cut-off events. [2022-12-12 18:33:42,423 INFO L131 PetriNetUnfolder]: For 3001/3001 co-relation queries the response was YES. [2022-12-12 18:33:42,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65821 conditions, 17593 events. 12559/17593 cut-off events. For 3001/3001 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 93870 event pairs, 739 based on Foata normal form. 284/14875 useless extension candidates. Maximal degree in co-relation 65803. Up to 16629 conditions per place. [2022-12-12 18:33:42,590 INFO L137 encePairwiseOnDemand]: 68/71 looper letters, 91 selfloop transitions, 3 changer transitions 0/104 dead transitions. [2022-12-12 18:33:42,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 104 transitions, 781 flow [2022-12-12 18:33:42,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:33:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:33:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-12 18:33:42,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3568075117370892 [2022-12-12 18:33:42,603 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2022-12-12 18:33:42,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 104 transitions, 781 flow [2022-12-12 18:33:42,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 104 transitions, 781 flow [2022-12-12 18:33:42,701 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 104 transitions, 781 flow [2022-12-12 18:33:42,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:42,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:42,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:42,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:33:42,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:33:42,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:42,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1437862159, now seen corresponding path program 1 times [2022-12-12 18:33:42,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:42,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261030291] [2022-12-12 18:33:42,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:42,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:42,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:42,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261030291] [2022-12-12 18:33:42,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261030291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:42,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:42,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:33:42,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390351919] [2022-12-12 18:33:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:42,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:33:42,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:42,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:33:42,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:33:42,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 71 [2022-12-12 18:33:42,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 104 transitions, 781 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:42,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:42,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 71 [2022-12-12 18:33:42,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:33:45,598 INFO L130 PetriNetUnfolder]: 26619/36332 cut-off events. [2022-12-12 18:33:45,598 INFO L131 PetriNetUnfolder]: For 39822/40776 co-relation queries the response was YES. [2022-12-12 18:33:45,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159146 conditions, 36332 events. 26619/36332 cut-off events. For 39822/40776 co-relation queries the response was YES. Maximal size of possible extension queue 1393. Compared 207939 event pairs, 2912 based on Foata normal form. 2167/32480 useless extension candidates. Maximal degree in co-relation 159125. Up to 31351 conditions per place. [2022-12-12 18:33:46,004 INFO L137 encePairwiseOnDemand]: 56/71 looper letters, 112 selfloop transitions, 29 changer transitions 111/267 dead transitions. [2022-12-12 18:33:46,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 267 transitions, 2529 flow [2022-12-12 18:33:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:33:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:33:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2022-12-12 18:33:46,006 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4253521126760563 [2022-12-12 18:33:46,007 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -20 predicate places. [2022-12-12 18:33:46,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 267 transitions, 2529 flow [2022-12-12 18:33:46,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 156 transitions, 1467 flow [2022-12-12 18:33:46,142 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 156 transitions, 1467 flow [2022-12-12 18:33:46,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:46,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:46,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:46,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:33:46,142 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:33:46,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1704568889, now seen corresponding path program 1 times [2022-12-12 18:33:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:46,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273453552] [2022-12-12 18:33:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:46,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:46,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:46,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273453552] [2022-12-12 18:33:46,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273453552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:46,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:46,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:33:46,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062323053] [2022-12-12 18:33:46,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:46,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:33:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:46,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:33:46,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:33:46,279 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 71 [2022-12-12 18:33:46,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 156 transitions, 1467 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:46,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:46,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 71 [2022-12-12 18:33:46,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:33:48,502 INFO L130 PetriNetUnfolder]: 18695/26618 cut-off events. [2022-12-12 18:33:48,502 INFO L131 PetriNetUnfolder]: For 38379/40678 co-relation queries the response was YES. [2022-12-12 18:33:48,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140230 conditions, 26618 events. 18695/26618 cut-off events. For 38379/40678 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 160346 event pairs, 1341 based on Foata normal form. 2504/24969 useless extension candidates. Maximal degree in co-relation 140206. Up to 22998 conditions per place. [2022-12-12 18:33:48,703 INFO L137 encePairwiseOnDemand]: 56/71 looper letters, 131 selfloop transitions, 57 changer transitions 93/296 dead transitions. [2022-12-12 18:33:48,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 296 transitions, 3366 flow [2022-12-12 18:33:48,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:33:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:33:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2022-12-12 18:33:48,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43427230046948356 [2022-12-12 18:33:48,707 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -17 predicate places. [2022-12-12 18:33:48,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 296 transitions, 3366 flow [2022-12-12 18:33:48,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 203 transitions, 2298 flow [2022-12-12 18:33:48,824 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 203 transitions, 2298 flow [2022-12-12 18:33:48,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:48,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:48,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:48,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:33:48,825 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:33:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:48,825 INFO L85 PathProgramCache]: Analyzing trace with hash -396631431, now seen corresponding path program 1 times [2022-12-12 18:33:48,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:48,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783061036] [2022-12-12 18:33:48,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:49,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783061036] [2022-12-12 18:33:49,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783061036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:49,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:49,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:33:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774259320] [2022-12-12 18:33:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:49,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:33:49,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:49,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:33:49,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:33:49,048 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 18:33:49,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 203 transitions, 2298 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:49,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:49,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 18:33:49,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:33:51,806 INFO L130 PetriNetUnfolder]: 22109/31761 cut-off events. [2022-12-12 18:33:51,806 INFO L131 PetriNetUnfolder]: For 55554/57752 co-relation queries the response was YES. [2022-12-12 18:33:51,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195560 conditions, 31761 events. 22109/31761 cut-off events. For 55554/57752 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 199940 event pairs, 1349 based on Foata normal form. 854/27302 useless extension candidates. Maximal degree in co-relation 195533. Up to 27749 conditions per place. [2022-12-12 18:33:52,022 INFO L137 encePairwiseOnDemand]: 64/71 looper letters, 326 selfloop transitions, 24 changer transitions 73/441 dead transitions. [2022-12-12 18:33:52,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 441 transitions, 5979 flow [2022-12-12 18:33:52,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:33:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:33:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2022-12-12 18:33:52,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3732394366197183 [2022-12-12 18:33:52,024 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -14 predicate places. [2022-12-12 18:33:52,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 441 transitions, 5979 flow [2022-12-12 18:33:52,146 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 368 transitions, 4957 flow [2022-12-12 18:33:52,146 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 368 transitions, 4957 flow [2022-12-12 18:33:52,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:52,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:52,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:52,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:33:52,147 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:33:52,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:52,147 INFO L85 PathProgramCache]: Analyzing trace with hash 500970681, now seen corresponding path program 1 times [2022-12-12 18:33:52,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:52,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219990245] [2022-12-12 18:33:52,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:52,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:52,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:52,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219990245] [2022-12-12 18:33:52,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219990245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:52,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:52,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:33:52,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387977411] [2022-12-12 18:33:52,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:52,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:33:52,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:52,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:33:52,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:33:52,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 71 [2022-12-12 18:33:52,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 368 transitions, 4957 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:52,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:52,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 71 [2022-12-12 18:33:52,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:33:54,379 INFO L130 PetriNetUnfolder]: 11890/18830 cut-off events. [2022-12-12 18:33:54,379 INFO L131 PetriNetUnfolder]: For 49066/53125 co-relation queries the response was YES. [2022-12-12 18:33:54,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131373 conditions, 18830 events. 11890/18830 cut-off events. For 49066/53125 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 131640 event pairs, 351 based on Foata normal form. 2552/18328 useless extension candidates. Maximal degree in co-relation 131343. Up to 16073 conditions per place. [2022-12-12 18:33:54,479 INFO L137 encePairwiseOnDemand]: 56/71 looper letters, 224 selfloop transitions, 121 changer transitions 130/503 dead transitions. [2022-12-12 18:33:54,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 503 transitions, 7707 flow [2022-12-12 18:33:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:33:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:33:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 217 transitions. [2022-12-12 18:33:54,481 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43661971830985913 [2022-12-12 18:33:54,481 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -8 predicate places. [2022-12-12 18:33:54,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 503 transitions, 7707 flow [2022-12-12 18:33:54,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 373 transitions, 5688 flow [2022-12-12 18:33:54,544 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 373 transitions, 5688 flow [2022-12-12 18:33:54,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:54,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:54,545 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:54,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:33:54,545 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:33:54,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash -776910707, now seen corresponding path program 1 times [2022-12-12 18:33:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:54,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772788847] [2022-12-12 18:33:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:54,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:54,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:54,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772788847] [2022-12-12 18:33:54,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772788847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:54,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:54,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:33:54,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578210500] [2022-12-12 18:33:54,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:54,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:33:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:54,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:33:54,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:33:54,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 18:33:54,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 373 transitions, 5688 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:54,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:54,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 18:33:54,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:33:56,899 INFO L130 PetriNetUnfolder]: 11786/18870 cut-off events. [2022-12-12 18:33:56,900 INFO L131 PetriNetUnfolder]: For 52771/55354 co-relation queries the response was YES. [2022-12-12 18:33:56,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147232 conditions, 18870 events. 11786/18870 cut-off events. For 52771/55354 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 133821 event pairs, 314 based on Foata normal form. 664/16453 useless extension candidates. Maximal degree in co-relation 147199. Up to 16224 conditions per place. [2022-12-12 18:33:57,063 INFO L137 encePairwiseOnDemand]: 63/71 looper letters, 528 selfloop transitions, 49 changer transitions 60/659 dead transitions. [2022-12-12 18:33:57,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 659 transitions, 11458 flow [2022-12-12 18:33:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:33:57,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:33:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2022-12-12 18:33:57,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3971830985915493 [2022-12-12 18:33:57,065 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -6 predicate places. [2022-12-12 18:33:57,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 659 transitions, 11458 flow [2022-12-12 18:33:57,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 599 transitions, 10399 flow [2022-12-12 18:33:57,140 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 599 transitions, 10399 flow [2022-12-12 18:33:57,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:57,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:33:57,140 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:57,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:33:57,140 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:33:57,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:33:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash -982908435, now seen corresponding path program 1 times [2022-12-12 18:33:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:33:57,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62063395] [2022-12-12 18:33:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:33:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:33:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:33:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:33:57,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:33:57,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62063395] [2022-12-12 18:33:57,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62063395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:33:57,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:33:57,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:33:57,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800601534] [2022-12-12 18:33:57,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:33:57,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:33:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:33:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:33:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:33:57,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 18:33:57,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 599 transitions, 10399 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:33:57,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:33:57,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 18:33:57,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:00,213 INFO L130 PetriNetUnfolder]: 14066/23175 cut-off events. [2022-12-12 18:34:00,213 INFO L131 PetriNetUnfolder]: For 68244/71509 co-relation queries the response was YES. [2022-12-12 18:34:00,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198646 conditions, 23175 events. 14066/23175 cut-off events. For 68244/71509 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 178431 event pairs, 490 based on Foata normal form. 654/19945 useless extension candidates. Maximal degree in co-relation 198610. Up to 20371 conditions per place. [2022-12-12 18:34:00,376 INFO L137 encePairwiseOnDemand]: 63/71 looper letters, 466 selfloop transitions, 28 changer transitions 222/738 dead transitions. [2022-12-12 18:34:00,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 738 transitions, 14293 flow [2022-12-12 18:34:00,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:34:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:34:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2022-12-12 18:34:00,378 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36619718309859156 [2022-12-12 18:34:00,379 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -1 predicate places. [2022-12-12 18:34:00,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 738 transitions, 14293 flow [2022-12-12 18:34:00,456 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 516 transitions, 9884 flow [2022-12-12 18:34:00,456 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 516 transitions, 9884 flow [2022-12-12 18:34:00,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:00,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:00,456 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:00,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:34:00,456 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:34:00,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:00,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1066817151, now seen corresponding path program 2 times [2022-12-12 18:34:00,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:00,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502213902] [2022-12-12 18:34:00,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:00,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:00,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:00,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502213902] [2022-12-12 18:34:00,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502213902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:00,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:00,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 18:34:00,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396679192] [2022-12-12 18:34:00,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:00,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:34:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:00,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:34:00,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:34:00,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 71 [2022-12-12 18:34:00,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 516 transitions, 9884 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:00,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:00,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 71 [2022-12-12 18:34:00,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:02,347 INFO L130 PetriNetUnfolder]: 6484/10896 cut-off events. [2022-12-12 18:34:02,347 INFO L131 PetriNetUnfolder]: For 45701/48426 co-relation queries the response was YES. [2022-12-12 18:34:02,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103144 conditions, 10896 events. 6484/10896 cut-off events. For 45701/48426 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 75904 event pairs, 19 based on Foata normal form. 1244/10277 useless extension candidates. Maximal degree in co-relation 103105. Up to 9240 conditions per place. [2022-12-12 18:34:02,390 INFO L137 encePairwiseOnDemand]: 56/71 looper letters, 74 selfloop transitions, 105 changer transitions 343/534 dead transitions. [2022-12-12 18:34:02,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 534 transitions, 11188 flow [2022-12-12 18:34:02,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 18:34:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 18:34:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2022-12-12 18:34:02,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36795774647887325 [2022-12-12 18:34:02,392 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 6 predicate places. [2022-12-12 18:34:02,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 534 transitions, 11188 flow [2022-12-12 18:34:02,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 191 transitions, 3871 flow [2022-12-12 18:34:02,419 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 191 transitions, 3871 flow [2022-12-12 18:34:02,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:02,420 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:02,420 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:02,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:34:02,420 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:34:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1036545289, now seen corresponding path program 1 times [2022-12-12 18:34:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:02,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995276448] [2022-12-12 18:34:02,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:02,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:02,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995276448] [2022-12-12 18:34:02,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995276448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:02,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:02,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:34:02,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92865465] [2022-12-12 18:34:02,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:02,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:34:02,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:02,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:34:02,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:34:02,548 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 18:34:02,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 191 transitions, 3871 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:02,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:02,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 18:34:02,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:03,373 INFO L130 PetriNetUnfolder]: 4387/7057 cut-off events. [2022-12-12 18:34:03,373 INFO L131 PetriNetUnfolder]: For 20246/20505 co-relation queries the response was YES. [2022-12-12 18:34:03,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72765 conditions, 7057 events. 4387/7057 cut-off events. For 20246/20505 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 43731 event pairs, 32 based on Foata normal form. 90/5578 useless extension candidates. Maximal degree in co-relation 72723. Up to 6596 conditions per place. [2022-12-12 18:34:03,411 INFO L137 encePairwiseOnDemand]: 66/71 looper letters, 113 selfloop transitions, 4 changer transitions 155/291 dead transitions. [2022-12-12 18:34:03,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 291 transitions, 6573 flow [2022-12-12 18:34:03,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:34:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:34:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-12 18:34:03,413 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28169014084507044 [2022-12-12 18:34:03,413 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 2 predicate places. [2022-12-12 18:34:03,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 291 transitions, 6573 flow [2022-12-12 18:34:03,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 136 transitions, 2955 flow [2022-12-12 18:34:03,438 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 136 transitions, 2955 flow [2022-12-12 18:34:03,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:03,438 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:03,438 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:03,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:34:03,438 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:34:03,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:03,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1535611242, now seen corresponding path program 1 times [2022-12-12 18:34:03,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:03,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494973054] [2022-12-12 18:34:03,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:03,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:04,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:04,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494973054] [2022-12-12 18:34:04,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494973054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:04,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:04,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:34:04,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430839801] [2022-12-12 18:34:04,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:04,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:34:04,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:04,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:34:04,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:34:04,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 18:34:04,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 136 transitions, 2955 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:04,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:04,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 18:34:04,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:04,846 INFO L130 PetriNetUnfolder]: 3627/6210 cut-off events. [2022-12-12 18:34:04,846 INFO L131 PetriNetUnfolder]: For 18790/18907 co-relation queries the response was YES. [2022-12-12 18:34:04,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68421 conditions, 6210 events. 3627/6210 cut-off events. For 18790/18907 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 41748 event pairs, 8 based on Foata normal form. 86/4771 useless extension candidates. Maximal degree in co-relation 68376. Up to 6067 conditions per place. [2022-12-12 18:34:04,884 INFO L137 encePairwiseOnDemand]: 64/71 looper letters, 151 selfloop transitions, 12 changer transitions 98/280 dead transitions. [2022-12-12 18:34:04,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 280 transitions, 6896 flow [2022-12-12 18:34:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:34:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:34:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2022-12-12 18:34:04,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2937625754527163 [2022-12-12 18:34:04,886 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 5 predicate places. [2022-12-12 18:34:04,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 280 transitions, 6896 flow [2022-12-12 18:34:04,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 182 transitions, 4372 flow [2022-12-12 18:34:04,909 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 182 transitions, 4372 flow [2022-12-12 18:34:04,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:04,909 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:04,909 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:04,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 18:34:04,909 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:34:04,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:04,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1474210903, now seen corresponding path program 2 times [2022-12-12 18:34:04,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:04,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992409820] [2022-12-12 18:34:04,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:04,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:34:04,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:34:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:34:05,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:34:05,033 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:34:05,034 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 18:34:05,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 18:34:05,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 18:34:05,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 18:34:05,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 18:34:05,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 18:34:05,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 18:34:05,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 18:34:05,040 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:05,044 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:34:05,044 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:34:05,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:34:05 BasicIcfg [2022-12-12 18:34:05,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:34:05,128 INFO L158 Benchmark]: Toolchain (without parser) took 38511.84ms. Allocated memory was 181.4MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 156.3MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-12 18:34:05,128 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:34:05,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.94ms. Allocated memory is still 181.4MB. Free memory was 155.8MB in the beginning and 128.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 18:34:05,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.30ms. Allocated memory is still 181.4MB. Free memory was 128.5MB in the beginning and 125.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:34:05,128 INFO L158 Benchmark]: Boogie Preprocessor took 36.13ms. Allocated memory is still 181.4MB. Free memory was 125.9MB in the beginning and 124.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:34:05,129 INFO L158 Benchmark]: RCFGBuilder took 546.07ms. Allocated memory is still 181.4MB. Free memory was 124.3MB in the beginning and 90.3MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-12 18:34:05,129 INFO L158 Benchmark]: TraceAbstraction took 37357.84ms. Allocated memory was 181.4MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 89.2MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-12 18:34:05,130 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.10ms. Allocated memory is still 181.4MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 500.94ms. Allocated memory is still 181.4MB. Free memory was 155.8MB in the beginning and 128.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.30ms. Allocated memory is still 181.4MB. Free memory was 128.5MB in the beginning and 125.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.13ms. Allocated memory is still 181.4MB. Free memory was 125.9MB in the beginning and 124.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 546.07ms. Allocated memory is still 181.4MB. Free memory was 124.3MB in the beginning and 90.3MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 37357.84ms. Allocated memory was 181.4MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 89.2MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 137 PlacesBefore, 83 PlacesAfterwards, 126 TransitionsBefore, 71 TransitionsAfterwards, 2852 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 4 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 5589, independent unconditional: 0, dependent: 149, dependent conditional: 149, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 0, independent unconditional: 5589, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 0, independent unconditional: 5589, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 0, independent unconditional: 5589, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2731, independent: 2681, independent conditional: 0, independent unconditional: 2681, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2731, independent: 2635, independent conditional: 0, independent unconditional: 2635, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 96, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 233, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5738, independent: 2908, independent conditional: 0, independent unconditional: 2908, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 2731, unknown conditional: 0, unknown unconditional: 2731] , Statistics on independence cache: Total cache size (in pairs): 5388, Positive cache size: 5338, Positive conditional cache size: 0, Positive unconditional cache size: 5338, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=-2, t437={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=-1, t437={5:0}, t438={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=0, t437={5:0}, t438={6:0}, t439={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=1, t437={5:0}, t438={6:0}, t439={7:0}, t440={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 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) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 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 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 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 [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 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=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 863]: 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: 859]: 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: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.9s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 37.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 659 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 659 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1620 IncrementalHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 44 mSDtfsCounter, 1620 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10399occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 24322 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:34:05,154 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...