/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:28:14,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:28:14,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:28:14,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:28:14,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:28:14,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:28:14,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:28:14,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:28:14,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:28:14,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:28:14,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:28:14,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:28:14,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:28:14,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:28:14,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:28:14,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:28:14,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:28:14,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:28:14,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:28:14,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:28:14,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:28:14,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:28:14,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:28:14,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:28:14,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:28:14,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:28:14,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:28:14,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:28:14,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:28:14,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:28:14,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:28:14,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:28:14,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:28:14,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:28:14,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:28:14,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:28:14,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:28:14,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:28:14,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:28:14,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:28:14,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:28:14,818 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-05 20:28:14,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:28:14,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:28:14,840 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:28:14,841 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:28:14,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:28:14,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:28:14,842 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:28:14,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:28:14,842 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:28:14,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:28:14,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:28:14,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:28:14,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:28:14,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:28:14,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:28:14,843 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:28:14,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:28:14,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:28:14,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:28:14,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:28:14,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:28:14,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:28:14,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:28:14,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:28:14,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:28:14,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:28:14,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:28:14,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:28:14,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:28:14,845 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:28:14,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:28:15,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:28:15,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:28:15,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:28:15,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:28:15,210 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:28:15,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 20:28:16,255 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:28:16,530 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:28:16,530 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 20:28:16,550 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5479af3b6/bf65e2993c4f4c3bb0a6c8443432782c/FLAGb2b0fff7f [2022-12-05 20:28:16,562 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5479af3b6/bf65e2993c4f4c3bb0a6c8443432782c [2022-12-05 20:28:16,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:28:16,566 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:28:16,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:28:16,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:28:16,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:28:16,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:28:16" (1/1) ... [2022-12-05 20:28:16,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45bc055a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:16, skipping insertion in model container [2022-12-05 20:28:16,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:28:16" (1/1) ... [2022-12-05 20:28:16,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:28:16,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:28:16,739 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-05 20:28:16,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:28:16,953 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:28:16,964 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-05 20:28:16,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:16,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:16,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:17,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:17,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:17,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:17,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:17,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:17,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:17,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:17,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:17,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:17,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:17,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:17,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:17,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:17,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:17,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:17,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:17,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:17,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:17,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:17,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:28:17,074 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:28:17,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17 WrapperNode [2022-12-05 20:28:17,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:28:17,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:28:17,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:28:17,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:28:17,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17" (1/1) ... [2022-12-05 20:28:17,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17" (1/1) ... [2022-12-05 20:28:17,145 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-05 20:28:17,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:28:17,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:28:17,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:28:17,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:28:17,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17" (1/1) ... [2022-12-05 20:28:17,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17" (1/1) ... [2022-12-05 20:28:17,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17" (1/1) ... [2022-12-05 20:28:17,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17" (1/1) ... [2022-12-05 20:28:17,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17" (1/1) ... [2022-12-05 20:28:17,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17" (1/1) ... [2022-12-05 20:28:17,189 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17" (1/1) ... [2022-12-05 20:28:17,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17" (1/1) ... [2022-12-05 20:28:17,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:28:17,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:28:17,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:28:17,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:28:17,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17" (1/1) ... [2022-12-05 20:28:17,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:28:17,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:28:17,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 20:28:17,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 20:28:17,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:28:17,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:28:17,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:28:17,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:28:17,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:28:17,287 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:28:17,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:28:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:28:17,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:28:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:28:17,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:28:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:28:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:28:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:28:17,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:28:17,290 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:28:17,468 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:28:17,469 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:28:17,767 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:28:17,902 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:28:17,902 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:28:17,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:28:17 BoogieIcfgContainer [2022-12-05 20:28:17,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:28:17,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:28:17,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:28:17,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:28:17,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:28:16" (1/3) ... [2022-12-05 20:28:17,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0936d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:28:17, skipping insertion in model container [2022-12-05 20:28:17,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:17" (2/3) ... [2022-12-05 20:28:17,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0936d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:28:17, skipping insertion in model container [2022-12-05 20:28:17,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:28:17" (3/3) ... [2022-12-05 20:28:17,916 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 20:28:17,933 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:28:17,933 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:28:17,934 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:28:17,995 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:28:18,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 20:28:18,090 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 20:28:18,090 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:28:18,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-05 20:28:18,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 20:28:18,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-05 20:28:18,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:28:18,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 20:28:18,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-05 20:28:18,184 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 20:28:18,184 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:28:18,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-05 20:28:18,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 20:28:18,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 1676 [2022-12-05 20:28:22,681 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-05 20:28:22,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:28:22,701 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;@3ce9cdc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:28:22,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:28:22,705 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-05 20:28:22,705 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:28:22,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:22,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:22,707 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash -580746594, now seen corresponding path program 1 times [2022-12-05 20:28:22,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:22,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285036960] [2022-12-05 20:28:22,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:22,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:23,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:23,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285036960] [2022-12-05 20:28:23,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285036960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:23,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:23,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:28:23,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058386268] [2022-12-05 20:28:23,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:23,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:28:23,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:23,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:28:23,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:28:23,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 20:28:23,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:23,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:23,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 20:28:23,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:23,395 INFO L130 PetriNetUnfolder]: 615/1020 cut-off events. [2022-12-05 20:28:23,395 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 20:28:23,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1991 conditions, 1020 events. 615/1020 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5095 event pairs, 129 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1980. Up to 703 conditions per place. [2022-12-05 20:28:23,408 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 23 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-05 20:28:23,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 131 flow [2022-12-05 20:28:23,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:28:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:28:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-05 20:28:23,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-05 20:28:23,422 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 43 transitions. [2022-12-05 20:28:23,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 131 flow [2022-12-05 20:28:23,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:28:23,426 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2022-12-05 20:28:23,428 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-05 20:28:23,432 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-05 20:28:23,433 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 50 flow [2022-12-05 20:28:23,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:23,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:23,433 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:23,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:28:23,434 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash -894240433, now seen corresponding path program 1 times [2022-12-05 20:28:23,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:23,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703083866] [2022-12-05 20:28:23,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:23,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:23,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:23,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703083866] [2022-12-05 20:28:23,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703083866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:23,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:23,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:28:23,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164575214] [2022-12-05 20:28:23,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:23,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:28:23,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:23,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:28:23,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:28:23,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:28:23,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 50 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:23,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:23,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:28:23,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:24,010 INFO L130 PetriNetUnfolder]: 1397/2150 cut-off events. [2022-12-05 20:28:24,010 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-12-05 20:28:24,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4438 conditions, 2150 events. 1397/2150 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10458 event pairs, 417 based on Foata normal form. 122/2272 useless extension candidates. Maximal degree in co-relation 4428. Up to 1257 conditions per place. [2022-12-05 20:28:24,021 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 32 selfloop transitions, 5 changer transitions 21/58 dead transitions. [2022-12-05 20:28:24,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 58 transitions, 252 flow [2022-12-05 20:28:24,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:28:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:28:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-05 20:28:24,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-05 20:28:24,023 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 50 flow. Second operand 5 states and 60 transitions. [2022-12-05 20:28:24,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 58 transitions, 252 flow [2022-12-05 20:28:24,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 58 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:24,025 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 96 flow [2022-12-05 20:28:24,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-12-05 20:28:24,026 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-05 20:28:24,026 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 96 flow [2022-12-05 20:28:24,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:24,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:24,027 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:24,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:28:24,027 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:24,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:24,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1951505538, now seen corresponding path program 1 times [2022-12-05 20:28:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:24,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265526334] [2022-12-05 20:28:24,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:24,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:24,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:24,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265526334] [2022-12-05 20:28:24,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265526334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:24,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:24,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:28:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563312928] [2022-12-05 20:28:24,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:24,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:28:24,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:24,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:28:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:28:24,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 20:28:24,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:24,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:24,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 20:28:24,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:24,405 INFO L130 PetriNetUnfolder]: 637/1113 cut-off events. [2022-12-05 20:28:24,406 INFO L131 PetriNetUnfolder]: For 817/851 co-relation queries the response was YES. [2022-12-05 20:28:24,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2868 conditions, 1113 events. 637/1113 cut-off events. For 817/851 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5804 event pairs, 133 based on Foata normal form. 103/1184 useless extension candidates. Maximal degree in co-relation 2854. Up to 696 conditions per place. [2022-12-05 20:28:24,413 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 43 selfloop transitions, 8 changer transitions 3/59 dead transitions. [2022-12-05 20:28:24,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 59 transitions, 326 flow [2022-12-05 20:28:24,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:28:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:28:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-05 20:28:24,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.504 [2022-12-05 20:28:24,417 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 96 flow. Second operand 5 states and 63 transitions. [2022-12-05 20:28:24,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 59 transitions, 326 flow [2022-12-05 20:28:24,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 59 transitions, 302 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:24,422 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 144 flow [2022-12-05 20:28:24,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2022-12-05 20:28:24,426 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-05 20:28:24,428 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 144 flow [2022-12-05 20:28:24,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:24,430 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:24,430 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:24,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:28:24,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:24,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:24,432 INFO L85 PathProgramCache]: Analyzing trace with hash 565980478, now seen corresponding path program 1 times [2022-12-05 20:28:24,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:24,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993920794] [2022-12-05 20:28:24,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:24,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:24,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:24,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993920794] [2022-12-05 20:28:24,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993920794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:24,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:24,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:28:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037675895] [2022-12-05 20:28:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:24,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:28:24,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:24,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:28:24,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:28:24,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 20:28:24,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:24,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:24,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 20:28:24,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:24,914 INFO L130 PetriNetUnfolder]: 428/790 cut-off events. [2022-12-05 20:28:24,914 INFO L131 PetriNetUnfolder]: For 758/782 co-relation queries the response was YES. [2022-12-05 20:28:24,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2580 conditions, 790 events. 428/790 cut-off events. For 758/782 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4009 event pairs, 50 based on Foata normal form. 61/831 useless extension candidates. Maximal degree in co-relation 2563. Up to 307 conditions per place. [2022-12-05 20:28:24,919 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 49 selfloop transitions, 15 changer transitions 13/82 dead transitions. [2022-12-05 20:28:24,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 82 transitions, 504 flow [2022-12-05 20:28:24,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:28:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:28:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-12-05 20:28:24,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5028571428571429 [2022-12-05 20:28:24,922 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 144 flow. Second operand 7 states and 88 transitions. [2022-12-05 20:28:24,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 82 transitions, 504 flow [2022-12-05 20:28:24,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 82 transitions, 498 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:24,930 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 237 flow [2022-12-05 20:28:24,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=237, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-05 20:28:24,931 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-05 20:28:24,931 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 237 flow [2022-12-05 20:28:24,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:24,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:24,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:24,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:28:24,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash -411258407, now seen corresponding path program 1 times [2022-12-05 20:28:24,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:24,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496247749] [2022-12-05 20:28:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:25,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496247749] [2022-12-05 20:28:25,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496247749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:25,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:25,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:28:25,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482142098] [2022-12-05 20:28:25,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:25,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:28:25,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:25,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:28:25,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:28:25,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:28:25,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 237 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:25,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:25,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:28:25,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:25,499 INFO L130 PetriNetUnfolder]: 678/1224 cut-off events. [2022-12-05 20:28:25,499 INFO L131 PetriNetUnfolder]: For 2982/2982 co-relation queries the response was YES. [2022-12-05 20:28:25,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 1224 events. 678/1224 cut-off events. For 2982/2982 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6559 event pairs, 15 based on Foata normal form. 13/1237 useless extension candidates. Maximal degree in co-relation 4729. Up to 533 conditions per place. [2022-12-05 20:28:25,506 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 66 selfloop transitions, 11 changer transitions 38/115 dead transitions. [2022-12-05 20:28:25,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 115 transitions, 964 flow [2022-12-05 20:28:25,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:28:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:28:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-05 20:28:25,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4057142857142857 [2022-12-05 20:28:25,510 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 237 flow. Second operand 7 states and 71 transitions. [2022-12-05 20:28:25,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 115 transitions, 964 flow [2022-12-05 20:28:25,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 115 transitions, 847 flow, removed 44 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:25,528 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 233 flow [2022-12-05 20:28:25,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2022-12-05 20:28:25,530 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2022-12-05 20:28:25,530 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 233 flow [2022-12-05 20:28:25,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:25,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:25,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:25,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:28:25,531 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:25,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1000096481, now seen corresponding path program 2 times [2022-12-05 20:28:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:25,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445834421] [2022-12-05 20:28:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:25,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:25,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445834421] [2022-12-05 20:28:25,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445834421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:25,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:25,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:28:25,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584940156] [2022-12-05 20:28:25,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:25,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:28:25,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:25,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:28:25,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:28:25,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 20:28:25,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:25,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:25,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 20:28:25,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:25,906 INFO L130 PetriNetUnfolder]: 215/428 cut-off events. [2022-12-05 20:28:25,906 INFO L131 PetriNetUnfolder]: For 1107/1116 co-relation queries the response was YES. [2022-12-05 20:28:25,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 428 events. 215/428 cut-off events. For 1107/1116 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1919 event pairs, 32 based on Foata normal form. 26/442 useless extension candidates. Maximal degree in co-relation 1669. Up to 157 conditions per place. [2022-12-05 20:28:25,909 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 36 selfloop transitions, 10 changer transitions 20/75 dead transitions. [2022-12-05 20:28:25,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 591 flow [2022-12-05 20:28:25,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:28:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:28:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-05 20:28:25,914 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4057142857142857 [2022-12-05 20:28:25,914 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 233 flow. Second operand 7 states and 71 transitions. [2022-12-05 20:28:25,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 591 flow [2022-12-05 20:28:25,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 541 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-05 20:28:25,919 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 235 flow [2022-12-05 20:28:25,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2022-12-05 20:28:25,921 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2022-12-05 20:28:25,921 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 235 flow [2022-12-05 20:28:25,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:25,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:25,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:25,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:28:25,922 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:25,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1534571282, now seen corresponding path program 1 times [2022-12-05 20:28:25,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:25,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21681868] [2022-12-05 20:28:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:25,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:26,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:26,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21681868] [2022-12-05 20:28:26,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21681868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:26,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:26,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:28:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814170714] [2022-12-05 20:28:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:26,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:28:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:26,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:28:26,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:28:26,101 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-05 20:28:26,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:26,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:26,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-05 20:28:26,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:26,245 INFO L130 PetriNetUnfolder]: 237/485 cut-off events. [2022-12-05 20:28:26,245 INFO L131 PetriNetUnfolder]: For 1294/1304 co-relation queries the response was YES. [2022-12-05 20:28:26,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 485 events. 237/485 cut-off events. For 1294/1304 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2301 event pairs, 93 based on Foata normal form. 1/473 useless extension candidates. Maximal degree in co-relation 2056. Up to 266 conditions per place. [2022-12-05 20:28:26,249 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 28 selfloop transitions, 3 changer transitions 23/56 dead transitions. [2022-12-05 20:28:26,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 488 flow [2022-12-05 20:28:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:28:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:28:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-05 20:28:26,250 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34 [2022-12-05 20:28:26,250 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 235 flow. Second operand 4 states and 34 transitions. [2022-12-05 20:28:26,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 488 flow [2022-12-05 20:28:26,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 413 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-12-05 20:28:26,257 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 166 flow [2022-12-05 20:28:26,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2022-12-05 20:28:26,257 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-05 20:28:26,258 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 166 flow [2022-12-05 20:28:26,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:26,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:26,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:26,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:28:26,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:26,259 INFO L85 PathProgramCache]: Analyzing trace with hash 144840018, now seen corresponding path program 2 times [2022-12-05 20:28:26,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:26,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634369188] [2022-12-05 20:28:26,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:26,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:26,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:26,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634369188] [2022-12-05 20:28:26,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634369188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:26,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:26,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:28:26,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722105379] [2022-12-05 20:28:26,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:26,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:28:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:28:26,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:28:26,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 20:28:26,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 166 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:26,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:26,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 20:28:26,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:26,929 INFO L130 PetriNetUnfolder]: 62/153 cut-off events. [2022-12-05 20:28:26,929 INFO L131 PetriNetUnfolder]: For 259/261 co-relation queries the response was YES. [2022-12-05 20:28:26,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 153 events. 62/153 cut-off events. For 259/261 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 546 event pairs, 4 based on Foata normal form. 1/153 useless extension candidates. Maximal degree in co-relation 565. Up to 68 conditions per place. [2022-12-05 20:28:26,930 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 28 selfloop transitions, 4 changer transitions 18/53 dead transitions. [2022-12-05 20:28:26,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 408 flow [2022-12-05 20:28:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:28:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:28:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-12-05 20:28:26,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.235 [2022-12-05 20:28:26,932 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 166 flow. Second operand 8 states and 47 transitions. [2022-12-05 20:28:26,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 408 flow [2022-12-05 20:28:26,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 370 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-05 20:28:26,934 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 161 flow [2022-12-05 20:28:26,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=161, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2022-12-05 20:28:26,936 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-05 20:28:26,936 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 161 flow [2022-12-05 20:28:26,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:26,936 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:26,937 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:26,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:28:26,937 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:26,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:26,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1248773714, now seen corresponding path program 3 times [2022-12-05 20:28:26,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:26,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741287241] [2022-12-05 20:28:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:26,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:27,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741287241] [2022-12-05 20:28:27,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741287241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:27,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:27,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:28:27,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773164507] [2022-12-05 20:28:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:27,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:28:27,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:27,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:28:27,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:28:27,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:28:27,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 30 transitions, 161 flow. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:27,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:27,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:28:27,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:27,284 INFO L130 PetriNetUnfolder]: 64/156 cut-off events. [2022-12-05 20:28:27,284 INFO L131 PetriNetUnfolder]: For 271/271 co-relation queries the response was YES. [2022-12-05 20:28:27,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 156 events. 64/156 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 524 event pairs, 7 based on Foata normal form. 1/157 useless extension candidates. Maximal degree in co-relation 583. Up to 62 conditions per place. [2022-12-05 20:28:27,285 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 24 selfloop transitions, 3 changer transitions 29/56 dead transitions. [2022-12-05 20:28:27,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 409 flow [2022-12-05 20:28:27,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:28:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:28:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-12-05 20:28:27,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24571428571428572 [2022-12-05 20:28:27,287 INFO L175 Difference]: Start difference. First operand has 50 places, 30 transitions, 161 flow. Second operand 7 states and 43 transitions. [2022-12-05 20:28:27,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 409 flow [2022-12-05 20:28:27,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 383 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-05 20:28:27,289 INFO L231 Difference]: Finished difference. Result has 49 places, 26 transitions, 129 flow [2022-12-05 20:28:27,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=129, PETRI_PLACES=49, PETRI_TRANSITIONS=26} [2022-12-05 20:28:27,290 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-12-05 20:28:27,290 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 26 transitions, 129 flow [2022-12-05 20:28:27,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:27,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:27,290 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:27,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:28:27,291 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:27,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1740766096, now seen corresponding path program 4 times [2022-12-05 20:28:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:27,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966016937] [2022-12-05 20:28:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:27,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:28:27,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:28:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:28:27,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:28:27,381 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:28:27,382 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:28:27,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:28:27,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:28:27,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:28:27,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:28:27,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:28:27,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:28:27,385 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2022-12-05 20:28:27,393 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:28:27,393 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:28:27,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:28:27 BasicIcfg [2022-12-05 20:28:27,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:28:27,468 INFO L158 Benchmark]: Toolchain (without parser) took 10902.26ms. Allocated memory was 190.8MB in the beginning and 352.3MB in the end (delta: 161.5MB). Free memory was 154.1MB in the beginning and 176.7MB in the end (delta: -22.6MB). Peak memory consumption was 139.4MB. Max. memory is 8.0GB. [2022-12-05 20:28:27,468 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 190.8MB. Free memory is still 168.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:28:27,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.48ms. Allocated memory is still 190.8MB. Free memory was 153.5MB in the beginning and 127.9MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 20:28:27,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.47ms. Allocated memory is still 190.8MB. Free memory was 127.9MB in the beginning and 125.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:28:27,469 INFO L158 Benchmark]: Boogie Preprocessor took 58.16ms. Allocated memory is still 190.8MB. Free memory was 125.2MB in the beginning and 123.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:28:27,469 INFO L158 Benchmark]: RCFGBuilder took 701.65ms. Allocated memory is still 190.8MB. Free memory was 123.7MB in the beginning and 93.3MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-05 20:28:27,469 INFO L158 Benchmark]: TraceAbstraction took 9558.84ms. Allocated memory was 190.8MB in the beginning and 352.3MB in the end (delta: 161.5MB). Free memory was 92.7MB in the beginning and 176.7MB in the end (delta: -84.0MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. [2022-12-05 20:28:27,470 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.18ms. Allocated memory is still 190.8MB. Free memory is still 168.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 508.48ms. Allocated memory is still 190.8MB. Free memory was 153.5MB in the beginning and 127.9MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.47ms. Allocated memory is still 190.8MB. Free memory was 127.9MB in the beginning and 125.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.16ms. Allocated memory is still 190.8MB. Free memory was 125.2MB in the beginning and 123.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 701.65ms. Allocated memory is still 190.8MB. Free memory was 123.7MB in the beginning and 93.3MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9558.84ms. Allocated memory was 190.8MB in the beginning and 352.3MB in the end (delta: 161.5MB). Free memory was 92.7MB in the beginning and 176.7MB in the end (delta: -84.0MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 111 PlacesBefore, 34 PlacesAfterwards, 103 TransitionsBefore, 25 TransitionsAfterwards, 1676 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1500, independent: 1457, independent conditional: 1457, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1500, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1500, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1500, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1112, independent: 1083, independent conditional: 0, independent unconditional: 1083, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1112, independent: 1063, independent conditional: 0, independent unconditional: 1063, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 156, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1500, independent: 374, independent conditional: 0, independent unconditional: 374, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1112, unknown conditional: 0, unknown unconditional: 1112] , Statistics on independence cache: Total cache size (in pairs): 1906, Positive cache size: 1877, Positive conditional cache size: 0, Positive unconditional cache size: 1877, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2577; [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2577, ((void *)0), P0, ((void *)0))=-2, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t2578; [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2578, ((void *)0), P1, ((void *)0))=-1, t2577={5:0}, t2578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L831] 0 pthread_t t2579; [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2579, ((void *)0), P2, ((void *)0))=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 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) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] 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) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=2, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 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) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 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 [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=2, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=2, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 830]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 794 IncrementalHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 16 mSDtfsCounter, 794 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=4, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 713 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:28:27,489 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...