/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:50:31,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:50:31,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:50:31,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:50:31,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:50:31,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:50:31,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:50:31,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:50:31,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:50:31,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:50:31,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:50:31,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:50:31,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:50:31,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:50:31,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:50:31,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:50:31,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:50:31,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:50:31,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:50:31,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:50:31,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:50:31,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:50:31,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:50:31,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:50:31,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:50:31,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:50:31,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:50:31,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:50:31,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:50:31,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:50:31,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:50:31,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:50:31,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:50:31,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:50:31,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:50:31,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:50:31,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:50:31,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:50:31,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:50:31,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:50:31,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:50:31,923 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-RepeatedSemanticLbe.epf [2022-12-13 00:50:31,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:50:31,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:50:31,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:50:31,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:50:31,949 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:50:31,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:50:31,950 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:50:31,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:50:31,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:50:31,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:50:31,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:50:31,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:50:31,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:50:31,951 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:50:31,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:50:31,951 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:50:31,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:50:31,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:50:31,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:50:31,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:50:31,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:50:31,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:50:31,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:50:31,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:50:31,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:50:31,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:50:31,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:50:31,953 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:50:31,953 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-13 00:50:32,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:50:32,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:50:32,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:50:32,238 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:50:32,238 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:50:32,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.opt.i [2022-12-13 00:50:33,418 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:50:33,651 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:50:33,652 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_rmo.opt.i [2022-12-13 00:50:33,668 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176e47fa1/93aa66b02dc14d169f7648212375debf/FLAG531c123f3 [2022-12-13 00:50:33,678 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176e47fa1/93aa66b02dc14d169f7648212375debf [2022-12-13 00:50:33,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:50:33,684 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:50:33,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:50:33,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:50:33,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:50:33,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:50:33" (1/1) ... [2022-12-13 00:50:33,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f12cce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:33, skipping insertion in model container [2022-12-13 00:50:33,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:50:33" (1/1) ... [2022-12-13 00:50:33,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:50:33,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:50:33,873 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/safe014_rmo.opt.i[992,1005] [2022-12-13 00:50:34,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:50:34,089 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:50:34,100 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/safe014_rmo.opt.i[992,1005] [2022-12-13 00:50:34,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:34,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:34,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:50:34,219 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:50:34,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34 WrapperNode [2022-12-13 00:50:34,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:50:34,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:50:34,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:50:34,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:50:34,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34" (1/1) ... [2022-12-13 00:50:34,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34" (1/1) ... [2022-12-13 00:50:34,268 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-12-13 00:50:34,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:50:34,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:50:34,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:50:34,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:50:34,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34" (1/1) ... [2022-12-13 00:50:34,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34" (1/1) ... [2022-12-13 00:50:34,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34" (1/1) ... [2022-12-13 00:50:34,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34" (1/1) ... [2022-12-13 00:50:34,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34" (1/1) ... [2022-12-13 00:50:34,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34" (1/1) ... [2022-12-13 00:50:34,302 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34" (1/1) ... [2022-12-13 00:50:34,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34" (1/1) ... [2022-12-13 00:50:34,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:50:34,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:50:34,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:50:34,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:50:34,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34" (1/1) ... [2022-12-13 00:50:34,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:50:34,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:50:34,374 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-13 00:50:34,381 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-13 00:50:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:50:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:50:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:50:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:50:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:50:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:50:34,407 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:50:34,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:50:34,407 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:50:34,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:50:34,407 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:50:34,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:50:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:50:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:50:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:50:34,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:50:34,409 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:50:34,585 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:50:34,586 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:50:34,923 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:50:35,158 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:50:35,158 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:50:35,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:50:35 BoogieIcfgContainer [2022-12-13 00:50:35,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:50:35,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:50:35,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:50:35,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:50:35,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:50:33" (1/3) ... [2022-12-13 00:50:35,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ad2d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:50:35, skipping insertion in model container [2022-12-13 00:50:35,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:34" (2/3) ... [2022-12-13 00:50:35,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ad2d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:50:35, skipping insertion in model container [2022-12-13 00:50:35,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:50:35" (3/3) ... [2022-12-13 00:50:35,167 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.opt.i [2022-12-13 00:50:35,181 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:50:35,181 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:50:35,181 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:50:35,234 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:50:35,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 00:50:35,322 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 00:50:35,323 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:35,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 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/119 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 00:50:35,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 00:50:35,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-13 00:50:35,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:35,356 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 00:50:35,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-13 00:50:35,378 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-13 00:50:35,378 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:35,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 00:50:35,382 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 00:50:35,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-13 00:50:42,012 INFO L241 LiptonReduction]: Total number of compositions: 91 [2022-12-13 00:50:42,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:50:42,028 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=REPEATED_LIPTON_PN, 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;@1ebb46d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:50:42,028 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 00:50:42,032 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 00:50:42,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:42,032 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:42,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:42,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:42,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:42,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1041809867, now seen corresponding path program 1 times [2022-12-13 00:50:42,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:42,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252034584] [2022-12-13 00:50:42,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:42,191 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-13 00:50:42,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:42,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252034584] [2022-12-13 00:50:42,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252034584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:42,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:42,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:50:42,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314100823] [2022-12-13 00:50:42,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:42,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:50:42,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:42,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:50:42,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:50:42,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2022-12-13 00:50:42,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 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-13 00:50:42,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:42,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2022-12-13 00:50:42,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:42,539 INFO L130 PetriNetUnfolder]: 1164/1816 cut-off events. [2022-12-13 00:50:42,539 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-13 00:50:42,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3608 conditions, 1816 events. 1164/1816 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8647 event pairs, 1164 based on Foata normal form. 0/1454 useless extension candidates. Maximal degree in co-relation 3597. Up to 1726 conditions per place. [2022-12-13 00:50:42,553 INFO L137 encePairwiseOnDemand]: 29/30 looper letters, 21 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2022-12-13 00:50:42,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 109 flow [2022-12-13 00:50:42,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:50:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:50:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2022-12-13 00:50:42,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-13 00:50:42,562 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 38 transitions. [2022-12-13 00:50:42,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 109 flow [2022-12-13 00:50:42,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:50:42,566 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2022-12-13 00:50:42,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 00:50:42,569 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-13 00:50:42,569 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:42,569 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 64 flow [2022-12-13 00:50:42,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:42,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:42,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 64 flow [2022-12-13 00:50:42,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 64 flow [2022-12-13 00:50:42,576 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 00:50:42,576 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:42,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 00:50:42,578 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 64 flow [2022-12-13 00:50:42,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-13 00:50:42,745 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:42,746 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-13 00:50:42,746 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 64 flow [2022-12-13 00:50:42,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 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-13 00:50:42,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:42,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:42,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:50:42,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash 451851333, now seen corresponding path program 1 times [2022-12-13 00:50:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:42,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27458584] [2022-12-13 00:50:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:43,056 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-13 00:50:43,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:43,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27458584] [2022-12-13 00:50:43,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27458584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:43,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:43,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:50:43,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923741481] [2022-12-13 00:50:43,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:43,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:50:43,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:43,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:50:43,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:50:43,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 00:50:43,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:43,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:43,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 00:50:43,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:43,374 INFO L130 PetriNetUnfolder]: 1099/1764 cut-off events. [2022-12-13 00:50:43,374 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:43,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3463 conditions, 1764 events. 1099/1764 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8814 event pairs, 614 based on Foata normal form. 25/1469 useless extension candidates. Maximal degree in co-relation 3455. Up to 1444 conditions per place. [2022-12-13 00:50:43,382 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 33 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-12-13 00:50:43,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 166 flow [2022-12-13 00:50:43,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:50:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:50:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 00:50:43,383 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2022-12-13 00:50:43,383 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 64 flow. Second operand 3 states and 60 transitions. [2022-12-13 00:50:43,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 166 flow [2022-12-13 00:50:43,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:50:43,385 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 72 flow [2022-12-13 00:50:43,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-13 00:50:43,386 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2022-12-13 00:50:43,386 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:43,386 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 72 flow [2022-12-13 00:50:43,386 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:43,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:43,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 72 flow [2022-12-13 00:50:43,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 72 flow [2022-12-13 00:50:43,392 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 00:50:43,393 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:43,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:50:43,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 72 flow [2022-12-13 00:50:43,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 00:50:43,395 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:43,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 00:50:43,396 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 72 flow [2022-12-13 00:50:43,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:43,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:43,397 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:43,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:50:43,397 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:43,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1122488397, now seen corresponding path program 1 times [2022-12-13 00:50:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:43,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287074195] [2022-12-13 00:50:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:43,637 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-13 00:50:43,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:43,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287074195] [2022-12-13 00:50:43,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287074195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:43,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:43,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:50:43,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452903246] [2022-12-13 00:50:43,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:43,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:50:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:43,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:50:43,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:50:43,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 00:50:43,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-13 00:50:43,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:43,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 00:50:43,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:43,952 INFO L130 PetriNetUnfolder]: 1690/2683 cut-off events. [2022-12-13 00:50:43,953 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-12-13 00:50:43,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5555 conditions, 2683 events. 1690/2683 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 14034 event pairs, 414 based on Foata normal form. 120/2297 useless extension candidates. Maximal degree in co-relation 5544. Up to 1037 conditions per place. [2022-12-13 00:50:43,963 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 34 selfloop transitions, 3 changer transitions 7/51 dead transitions. [2022-12-13 00:50:43,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 207 flow [2022-12-13 00:50:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 00:50:43,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2022-12-13 00:50:43,968 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 72 flow. Second operand 4 states and 74 transitions. [2022-12-13 00:50:43,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 207 flow [2022-12-13 00:50:43,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:50:43,969 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 82 flow [2022-12-13 00:50:43,969 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-12-13 00:50:43,970 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2022-12-13 00:50:43,970 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:43,970 INFO L89 Accepts]: Start accepts. Operand has 42 places, 29 transitions, 82 flow [2022-12-13 00:50:43,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:43,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:43,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 82 flow [2022-12-13 00:50:43,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 29 transitions, 82 flow [2022-12-13 00:50:43,977 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 00:50:43,977 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:50:43,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 29 events. 0/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 57 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:50:43,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 29 transitions, 82 flow [2022-12-13 00:50:43,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-13 00:50:44,496 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:50:44,497 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 527 [2022-12-13 00:50:44,497 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 80 flow [2022-12-13 00:50:44,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-13 00:50:44,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:44,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:44,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:50:44,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:44,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:44,498 INFO L85 PathProgramCache]: Analyzing trace with hash 438670382, now seen corresponding path program 1 times [2022-12-13 00:50:44,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:44,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850022851] [2022-12-13 00:50:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:44,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:45,495 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-13 00:50:45,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:45,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850022851] [2022-12-13 00:50:45,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850022851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:45,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:45,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:50:45,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746819455] [2022-12-13 00:50:45,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:45,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:50:45,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:45,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:50:45,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:50:45,499 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 00:50:45,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-13 00:50:45,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:45,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 00:50:45,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:45,790 INFO L130 PetriNetUnfolder]: 960/1516 cut-off events. [2022-12-13 00:50:45,790 INFO L131 PetriNetUnfolder]: For 688/688 co-relation queries the response was YES. [2022-12-13 00:50:45,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3464 conditions, 1516 events. 960/1516 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7434 event pairs, 140 based on Foata normal form. 16/1249 useless extension candidates. Maximal degree in co-relation 3451. Up to 1290 conditions per place. [2022-12-13 00:50:45,797 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 32 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-12-13 00:50:45,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 182 flow [2022-12-13 00:50:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:50:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:50:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-13 00:50:45,799 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-13 00:50:45,799 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 80 flow. Second operand 3 states and 53 transitions. [2022-12-13 00:50:45,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 182 flow [2022-12-13 00:50:45,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 165 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 00:50:45,801 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 76 flow [2022-12-13 00:50:45,801 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-13 00:50:45,802 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2022-12-13 00:50:45,802 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:45,802 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 76 flow [2022-12-13 00:50:45,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:45,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:45,803 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 76 flow [2022-12-13 00:50:45,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 76 flow [2022-12-13 00:50:45,809 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-13 00:50:45,809 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:50:45,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 0/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:50:45,809 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 76 flow [2022-12-13 00:50:45,809 INFO L226 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-13 00:50:45,881 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:45,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-13 00:50:45,882 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 76 flow [2022-12-13 00:50:45,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-13 00:50:45,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:45,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:45,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:50:45,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:45,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:45,883 INFO L85 PathProgramCache]: Analyzing trace with hash 713880621, now seen corresponding path program 1 times [2022-12-13 00:50:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:45,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18026724] [2022-12-13 00:50:45,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:45,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:46,211 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-13 00:50:46,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:46,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18026724] [2022-12-13 00:50:46,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18026724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:46,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:46,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:50:46,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585426216] [2022-12-13 00:50:46,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:46,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:50:46,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:46,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:50:46,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:50:46,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 00:50:46,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 00:50:46,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:46,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 00:50:46,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:46,448 INFO L130 PetriNetUnfolder]: 1099/1727 cut-off events. [2022-12-13 00:50:46,448 INFO L131 PetriNetUnfolder]: For 376/376 co-relation queries the response was YES. [2022-12-13 00:50:46,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3782 conditions, 1727 events. 1099/1727 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8083 event pairs, 875 based on Foata normal form. 16/1433 useless extension candidates. Maximal degree in co-relation 3770. Up to 1483 conditions per place. [2022-12-13 00:50:46,456 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 27 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2022-12-13 00:50:46,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 177 flow [2022-12-13 00:50:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-13 00:50:46,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-13 00:50:46,458 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 76 flow. Second operand 4 states and 60 transitions. [2022-12-13 00:50:46,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 177 flow [2022-12-13 00:50:46,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:50:46,459 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 122 flow [2022-12-13 00:50:46,459 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2022-12-13 00:50:46,460 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2022-12-13 00:50:46,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:46,460 INFO L89 Accepts]: Start accepts. Operand has 42 places, 34 transitions, 122 flow [2022-12-13 00:50:46,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:46,461 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:46,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 34 transitions, 122 flow [2022-12-13 00:50:46,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 34 transitions, 122 flow [2022-12-13 00:50:46,481 INFO L130 PetriNetUnfolder]: 65/209 cut-off events. [2022-12-13 00:50:46,482 INFO L131 PetriNetUnfolder]: For 35/37 co-relation queries the response was YES. [2022-12-13 00:50:46,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 209 events. 65/209 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1132 event pairs, 39 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 395. Up to 105 conditions per place. [2022-12-13 00:50:46,483 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 34 transitions, 122 flow [2022-12-13 00:50:46,483 INFO L226 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-13 00:50:46,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [721] L3-->L868: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd0~0_114 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_320 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd0~0_113 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_317 256) 0)) (.cse4 (not .cse8)) (.cse3 (not (= (mod v_~x$w_buff0_used~0_319 256) 0)))) (let ((.cse0 (and .cse4 .cse3)) (.cse1 (not .cse9)) (.cse2 (not .cse10)) (.cse5 (not .cse7)) (.cse11 (select |v_#memory_int_379| |v_~#x~0.base_224|))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| 0)) (= (ite .cse0 0 v_~x$r_buff0_thd0~0_114) v_~x$r_buff0_thd0~0_113) (= (ite (or .cse0 (and .cse1 .cse2)) 0 v_~x$w_buff1_used~0_317) v_~x$w_buff1_used~0_316) (= v_~x$r_buff1_thd0~0_112 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_316 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_113 256) 0)))) 0 v_~x$r_buff1_thd0~0_113)) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem31#1_55| |v_ULTIMATE.start_main_#t~mem31#1_53|))) (or (and .cse4 (= |v_ULTIMATE.start_main_#t~ite32#1_52| |v_ULTIMATE.start_main_#t~ite32#1_50|) .cse5 (= |v_ULTIMATE.start_main_#t~ite33#1_41| v_~x$w_buff0~0_178) .cse6) (and (or .cse7 .cse8) (= |v_ULTIMATE.start_main_#t~ite33#1_41| |v_ULTIMATE.start_main_#t~ite32#1_50|) (or (and (or .cse9 .cse10) (= |v_ULTIMATE.start_main_#t~mem31#1_53| |v_ULTIMATE.start_main_#t~ite32#1_50|) (= (select .cse11 |v_~#x~0.offset_224|) |v_ULTIMATE.start_main_#t~mem31#1_53|)) (and (= v_~x$w_buff1~0_190 |v_ULTIMATE.start_main_#t~ite32#1_50|) .cse6 .cse1 .cse2))))) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_320) v_~x$w_buff0_used~0_319) (= (store |v_#memory_int_379| |v_~#x~0.base_224| (store .cse11 |v_~#x~0.offset_224| |v_ULTIMATE.start_main_#t~ite33#1_41|)) |v_#memory_int_378|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_178, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_114, ~#x~0.offset=|v_~#x~0.offset_224|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_55|, ~x$w_buff1~0=v_~x$w_buff1~0_190, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_52|, #memory_int=|v_#memory_int_379|, ~#x~0.base=|v_~#x~0.base_224|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_317, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_113, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_320, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_178, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_113, ~#x~0.offset=|v_~#x~0.offset_224|, ~x$w_buff1~0=v_~x$w_buff1~0_190, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_316, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_112, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_319, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_40|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, #memory_int=|v_#memory_int_378|, ~#x~0.base=|v_~#x~0.base_224|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[|v_ULTIMATE.start_main_#t~mem31#1_53|, |v_ULTIMATE.start_main_#t~ite32#1_50|, |v_ULTIMATE.start_main_#t~ite33#1_41|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [757] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_525| |v_~#x~0.base_272| (store (select |v_#memory_int_525| |v_~#x~0.base_272|) |v_~#x~0.offset_272| 1)) |v_#memory_int_524|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_525|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_524|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-13 00:50:46,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L828-->L835: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd3~0_78 256) 0))) (let ((.cse1 (not .cse8)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_235 256) 0))) (.cse3 (= (mod v_~x$w_buff1_used~0_235 256) 0)) (.cse2 (= (mod v_~x$r_buff1_thd3~0_77 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_236 256) 0))) (let ((.cse0 (not .cse9)) (.cse6 (not .cse2)) (.cse7 (not .cse3)) (.cse11 (and .cse1 .cse10)) (.cse4 (select |v_#memory_int_263| |v_~#x~0.base_174|))) (and (= v_~x$w_buff0_used~0_235 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_236)) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and (or .cse2 .cse3) (= (select .cse4 |v_~#x~0.offset_174|) |v_P2_#t~mem22_30|) (= |v_P2_#t~ite23_29| |v_P2_#t~mem22_30|)) (and .cse5 (= |v_P2_#t~ite23_29| v_~x$w_buff1~0_122) .cse6 .cse7)) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_29|) (or .cse8 .cse9)) (and .cse5 (= |v_P2_#t~ite24_25| v_~x$w_buff0~0_114) (= |v_P2_#t~ite23_29| |v_P2Thread1of1ForFork0_#t~ite23_1|) .cse0 .cse1))) (= v_~x$r_buff1_thd3~0_76 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_77 256) 0)) .cse10) (and (not (= (mod v_~x$w_buff1_used~0_234 256) 0)) .cse6)) 0 v_~x$r_buff1_thd3~0_77)) (= v_~x$r_buff0_thd3~0_77 (ite .cse11 0 v_~x$r_buff0_thd3~0_78)) (= (ite (or (and .cse6 .cse7) .cse11) 0 v_~x$w_buff1_used~0_235) v_~x$w_buff1_used~0_234) (= (store |v_#memory_int_263| |v_~#x~0.base_174| (store .cse4 |v_~#x~0.offset_174| |v_P2_#t~ite24_25|)) |v_#memory_int_262|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_114, ~#x~0.offset=|v_~#x~0.offset_174|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~x$w_buff1~0=v_~x$w_buff1~0_122, #memory_int=|v_#memory_int_263|, ~#x~0.base=|v_~#x~0.base_174|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_77, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_235, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_78, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_236} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_114, ~#x~0.offset=|v_~#x~0.offset_174|, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, ~x$w_buff1~0=v_~x$w_buff1~0_122, #memory_int=|v_#memory_int_262|, ~#x~0.base=|v_~#x~0.base_174|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_234, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_235} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~mem22_30|, |v_P2_#t~ite23_29|] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] and [757] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_525| |v_~#x~0.base_272| (store (select |v_#memory_int_525| |v_~#x~0.base_272|) |v_~#x~0.offset_272| 1)) |v_#memory_int_524|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_525|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_524|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-13 00:50:47,373 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [753] L855-3-->L857-2: Formula: (and (= |v_#pthreadsForks_44| (+ |v_#pthreadsForks_45| 1)) (= |v_ULTIMATE.start_main_~#t2114~0#1.offset_18| 0) (= (select |v_#valid_76| |v_ULTIMATE.start_main_~#t2114~0#1.base_18|) 0) (= |v_#pthreadsForks_45| |v_ULTIMATE.start_main_#t~pre29#1_47|) (= |v_#length_68| (store |v_#length_69| |v_ULTIMATE.start_main_~#t2114~0#1.base_18| 4)) (not (= |v_ULTIMATE.start_main_~#t2114~0#1.base_18| 0)) (< |v_#StackHeapBarrier_33| |v_ULTIMATE.start_main_~#t2114~0#1.base_18|) (= |v_#valid_75| (store |v_#valid_76| |v_ULTIMATE.start_main_~#t2114~0#1.base_18| 1)) (= (store |v_#memory_int_511| |v_ULTIMATE.start_main_~#t2114~0#1.base_18| (store (select |v_#memory_int_511| |v_ULTIMATE.start_main_~#t2114~0#1.base_18|) |v_ULTIMATE.start_main_~#t2114~0#1.offset_18| |v_ULTIMATE.start_main_#t~pre29#1_47|)) |v_#memory_int_510|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_33|, #pthreadsForks=|v_#pthreadsForks_45|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_511|, #length=|v_#length_69|} OutVars{ULTIMATE.start_main_~#t2114~0#1.offset=|v_ULTIMATE.start_main_~#t2114~0#1.offset_18|, #StackHeapBarrier=|v_#StackHeapBarrier_33|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_47|, ULTIMATE.start_main_~#t2114~0#1.base=|v_ULTIMATE.start_main_~#t2114~0#1.base_18|, #pthreadsForks=|v_#pthreadsForks_44|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_510|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_27|, #length=|v_#length_68|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2114~0#1.offset, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_~#t2114~0#1.base, #pthreadsForks, #valid, #memory_int, ULTIMATE.start_main_#t~pre27#1, #length, ULTIMATE.start_main_#t~nondet28#1] and [757] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_525| |v_~#x~0.base_272| (store (select |v_#memory_int_525| |v_~#x~0.base_272|) |v_~#x~0.offset_272| 1)) |v_#memory_int_524|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_525|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_524|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-13 00:50:47,430 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] L789-->L792: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#x~0.base_9| (store (select |v_#memory_int_14| |v_~#x~0.base_9|) |v_~#x~0.offset_9| 2))) InVars {#memory_int=|v_#memory_int_14|, ~#x~0.base=|v_~#x~0.base_9|, ~#x~0.offset=|v_~#x~0.offset_9|} OutVars{#memory_int=|v_#memory_int_13|, ~#x~0.base=|v_~#x~0.base_9|, ~#x~0.offset=|v_~#x~0.offset_9|} AuxVars[] AssignedVars[#memory_int] and [757] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_525| |v_~#x~0.base_272| (store (select |v_#memory_int_525| |v_~#x~0.base_272|) |v_~#x~0.offset_272| 1)) |v_#memory_int_524|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_525|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_524|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-13 00:50:47,467 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [642] L762-->L778: Formula: (let ((.cse6 (= (mod v_~x$w_buff1_used~0_223 256) 0)) (.cse4 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse11 (= (mod v_~x$r_buff0_thd1~0_49 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_224 256) 0))) (let ((.cse15 (select |v_#memory_int_251| |v_~#x~0.base_166|)) (.cse14 (= (mod v_~weak$$choice2~0_108 256) 0)) (.cse8 (not .cse16)) (.cse5 (not .cse11)) (.cse2 (and .cse11 .cse4)) (.cse3 (and .cse11 .cse6))) (let ((.cse9 (or .cse16 .cse2 .cse3)) (.cse7 (and .cse8 .cse5)) (.cse12 (= (mod v_~x$w_buff1_used~0_222 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_223 256) 0)) (.cse0 (not .cse14)) (.cse10 (select .cse15 |v_~#x~0.offset_166|))) (and (= v_~x$w_buff1~0_113 v_~x$w_buff1~0_112) (= v_~x$w_buff1_used~0_222 (ite .cse0 v_~x$w_buff1_used~0_223 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_223 0))) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_29) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_108) (or (and (or (not .cse4) .cse5) (or (not .cse6) .cse5) (= v_~__unbuffered_p0_EBX~0_18 (ite .cse7 v_~x$w_buff0~0_109 v_~x$w_buff1~0_113)) .cse8 (= |v_P0_#t~mem6_34| |v_P0Thread1of1ForFork1_#t~mem6_1|)) (and .cse9 (= .cse10 |v_P0_#t~mem6_34|) (= v_~__unbuffered_p0_EBX~0_18 |v_P0_#t~mem6_34|))) (= (ite .cse0 v_~x$r_buff0_thd1~0_49 (ite (or .cse1 .cse2 (and .cse11 .cse12)) v_~x$r_buff0_thd1~0_49 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_49))) v_~x$r_buff0_thd1~0_48) (= (ite .cse0 v_~x$w_buff0_used~0_224 (ite .cse9 v_~x$w_buff0_used~0_224 (ite .cse7 0 v_~x$w_buff0_used~0_224))) v_~x$w_buff0_used~0_223) (= v_~x$r_buff1_thd1~0_45 (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd1~0_48 256) 0))) (or (and .cse13 .cse12) .cse1 (and .cse13 .cse4))) v_~x$r_buff1_thd1~0_46 0))) (= v_~x$w_buff0~0_109 v_~x$w_buff0~0_108) (or (and (= v_~__unbuffered_p0_EBX~0_18 |v_P0_#t~mem9_32|) .cse14 (= |v_P0_#t~ite10_33| |v_P0_#t~mem9_32|)) (and .cse0 (= |v_P0_#t~ite10_33| v_~x$mem_tmp~0_46) (= |v_P0_#t~mem9_32| |v_P0Thread1of1ForFork1_#t~mem9_1|))) (= v_~x$mem_tmp~0_46 .cse10) (= (store |v_#memory_int_251| |v_~#x~0.base_166| (store .cse15 |v_~#x~0.offset_166| |v_P0_#t~ite10_33|)) |v_#memory_int_250|) (= v_~x$flush_delayed~0_84 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_109, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~#x~0.offset=|v_~#x~0.offset_166|, ~x$w_buff1~0=v_~x$w_buff1~0_113, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_223, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_1|, #memory_int=|v_#memory_int_251|, ~#x~0.base=|v_~#x~0.base_166|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_108, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_18, ~x$flush_delayed~0=v_~x$flush_delayed~0_84, ~#x~0.offset=|v_~#x~0.offset_166|, ~x$w_buff1~0=v_~x$w_buff1~0_112, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_222, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_1|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_1|, #memory_int=|v_#memory_int_250|, ~#x~0.base=|v_~#x~0.base_166|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[|v_P0_#t~mem9_32|, |v_P0_#t~ite10_33|, |v_P0_#t~mem6_34|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, ~x$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem6, ~weak$$choice0~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] and [757] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_525| |v_~#x~0.base_272| (store (select |v_#memory_int_525| |v_~#x~0.base_272|) |v_~#x~0.offset_272| 1)) |v_#memory_int_524|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_525|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_524|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-13 00:50:47,892 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L828: Formula: (let ((.cse2 (= (mod v_~x$r_buff1_thd3~0_163 256) 0)) (.cse12 (= (mod v_~x$w_buff1_used~0_569 256) 0)) (.cse15 (= (mod v_~x$r_buff0_thd3~0_164 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_572 256) 0))) (let ((.cse5 (= (mod v_~weak$$choice2~0_276 256) 0)) (.cse8 (select |v_#memory_int_707| |v_~#x~0.base_340|)) (.cse11 (not .cse16)) (.cse10 (not .cse15)) (.cse13 (and .cse15 .cse12)) (.cse14 (and .cse15 .cse2))) (let ((.cse6 (or .cse13 .cse14 .cse16)) (.cse7 (and .cse11 .cse10)) (.cse9 (select .cse8 |v_~#x~0.offset_340|)) (.cse0 (not .cse5)) (.cse4 (= (mod v_~x$w_buff1_used~0_568 256) 0)) (.cse3 (= 0 (mod v_~x$w_buff0_used~0_571 256)))) (and (= (ite .cse0 v_~x$r_buff1_thd3~0_163 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd3~0_163 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~x$r_buff1_thd3~0_163 0)) v_~x$r_buff1_thd3~0_162) (= v_~weak$$choice2~0_276 |v_P2Thread1of1ForFork0_#t~nondet15_38|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (or (and (= |v_P2_#t~mem20_50| v_~__unbuffered_p2_EAX~0_159) .cse5 (= |v_P2_#t~ite21_53| |v_P2_#t~mem20_50|)) (and (= |v_P2Thread1of1ForFork0_#t~mem20_38| |v_P2_#t~mem20_50|) .cse0 (= |v_P2_#t~ite21_53| v_~x$mem_tmp~0_214))) (= v_~x$w_buff0_used~0_571 (ite .cse0 v_~x$w_buff0_used~0_572 (ite .cse6 v_~x$w_buff0_used~0_572 (ite .cse7 0 v_~x$w_buff0_used~0_572)))) (= v_~__unbuffered_p2_EAX$read_delayed~0_81 1) (= |v_~#x~0.offset_340| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_84) (= v_~x$w_buff0~0_387 v_~x$w_buff0~0_386) (= v_~x$w_buff1~0_397 v_~x$w_buff1~0_396) (= (store |v_#memory_int_707| |v_~#x~0.base_340| (store .cse8 |v_~#x~0.offset_340| |v_P2_#t~ite21_53|)) |v_#memory_int_706|) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= |v_~#x~0.base_340| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_84) (= v_~x$flush_delayed~0_262 0) (or (and (= |v_P2_#t~mem17_54| .cse9) .cse6 (= |v_P2_#t~mem17_54| v_~__unbuffered_p2_EAX~0_159)) (and (or .cse10 (not .cse2)) .cse11 (= |v_P2Thread1of1ForFork0_#t~mem17_38| |v_P2_#t~mem17_54|) (or (not .cse12) .cse10) (= (ite .cse7 v_~x$w_buff0~0_387 v_~x$w_buff1~0_397) v_~__unbuffered_p2_EAX~0_159))) (= .cse9 v_~x$mem_tmp~0_214) (= (ite .cse0 v_~x$w_buff1_used~0_569 (ite (or .cse13 .cse14 .cse3) v_~x$w_buff1_used~0_569 0)) v_~x$w_buff1_used~0_568) (= |v_P2Thread1of1ForFork0_#t~nondet14_38| v_~weak$$choice0~0_191) (= v_~y~0_37 1) (= (ite .cse0 v_~x$r_buff0_thd3~0_164 (ite (or (and .cse15 .cse4) .cse14 .cse3) v_~x$r_buff0_thd3~0_164 (ite (and .cse10 (not .cse3)) 0 v_~x$r_buff0_thd3~0_164))) v_~x$r_buff0_thd3~0_163))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_387, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~#x~0.offset=|v_~#x~0.offset_340|, ~x$w_buff1~0=v_~x$w_buff1~0_397, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_38|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_38|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_163, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_569, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_38|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_164, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_572, #memory_int=|v_#memory_int_707|, ~#x~0.base=|v_~#x~0.base_340|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_38|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_386, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_21|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_262, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_84, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_84, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_162, ~x$mem_tmp~0=v_~x$mem_tmp~0_214, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_163, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_159, ~y~0=v_~y~0_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~#x~0.offset=|v_~#x~0.offset_340|, ~x$w_buff1~0=v_~x$w_buff1~0_396, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_568, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_571, ~weak$$choice0~0=v_~weak$$choice0~0_191, #memory_int=|v_#memory_int_706|, ~#x~0.base=|v_~#x~0.base_340|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_21|, ~weak$$choice2~0=v_~weak$$choice2~0_276, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} AuxVars[|v_P2_#t~ite21_53|, |v_P2_#t~mem17_54|, |v_P2_#t~mem20_50|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~mem17, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, ~__unbuffered_p2_EAX~0, ~y~0, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem20] and [757] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_525| |v_~#x~0.base_272| (store (select |v_#memory_int_525| |v_~#x~0.base_272|) |v_~#x~0.offset_272| 1)) |v_#memory_int_524|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_525|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_272|, #memory_int=|v_#memory_int_524|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-13 00:50:48,412 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 00:50:48,867 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:50:48,867 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2407 [2022-12-13 00:50:48,867 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 136 flow [2022-12-13 00:50:48,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 00:50:48,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:48,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:48,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:50:48,868 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash 708396411, now seen corresponding path program 2 times [2022-12-13 00:50:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:48,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152628568] [2022-12-13 00:50:48,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:48,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:49,437 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-13 00:50:49,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:49,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152628568] [2022-12-13 00:50:49,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152628568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:49,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:49,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:50:49,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327021305] [2022-12-13 00:50:49,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:49,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:50:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:49,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:50:49,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:50:49,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2022-12-13 00:50:49,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-13 00:50:49,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:49,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2022-12-13 00:50:49,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:49,507 INFO L130 PetriNetUnfolder]: 164/310 cut-off events. [2022-12-13 00:50:49,507 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-12-13 00:50:49,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 310 events. 164/310 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1367 event pairs, 76 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 818. Up to 153 conditions per place. [2022-12-13 00:50:49,508 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2022-12-13 00:50:49,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 137 flow [2022-12-13 00:50:49,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:50:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:50:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 4 states and 48 transitions. [2022-12-13 00:50:49,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2022-12-13 00:50:49,509 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 136 flow. Second operand 4 states and 48 transitions. [2022-12-13 00:50:49,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 137 flow [2022-12-13 00:50:49,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 129 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:50:49,511 INFO L231 Difference]: Finished difference. Result has 36 places, 0 transitions, 0 flow [2022-12-13 00:50:49,511 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=36, PETRI_TRANSITIONS=0} [2022-12-13 00:50:49,513 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-13 00:50:49,513 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:49,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 0 transitions, 0 flow [2022-12-13 00:50:49,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 00:50:49,513 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 00:50:49,513 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:49,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 00:50:49,514 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 00:50:49,514 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 00:50:49,514 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:49,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 00:50:49,515 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 00:50:49,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-13 00:50:49,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 00:50:49,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 00:50:49,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 00:50:49,518 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 00:50:49,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:50:49,518 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-12-13 00:50:49,523 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:50:49,523 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:50:49,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:50:49 BasicIcfg [2022-12-13 00:50:49,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:50:49,527 INFO L158 Benchmark]: Toolchain (without parser) took 15842.76ms. Allocated memory was 199.2MB in the beginning and 457.2MB in the end (delta: 257.9MB). Free memory was 174.0MB in the beginning and 305.4MB in the end (delta: -131.5MB). Peak memory consumption was 127.8MB. Max. memory is 8.0GB. [2022-12-13 00:50:49,527 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 175.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:50:49,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.36ms. Allocated memory is still 199.2MB. Free memory was 173.7MB in the beginning and 144.9MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 00:50:49,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.10ms. Allocated memory is still 199.2MB. Free memory was 144.9MB in the beginning and 142.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:50:49,528 INFO L158 Benchmark]: Boogie Preprocessor took 61.50ms. Allocated memory is still 199.2MB. Free memory was 142.3MB in the beginning and 139.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:50:49,528 INFO L158 Benchmark]: RCFGBuilder took 829.70ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 139.7MB in the beginning and 209.9MB in the end (delta: -70.3MB). Peak memory consumption was 82.8MB. Max. memory is 8.0GB. [2022-12-13 00:50:49,528 INFO L158 Benchmark]: TraceAbstraction took 14364.06ms. Allocated memory was 239.1MB in the beginning and 457.2MB in the end (delta: 218.1MB). Free memory was 208.3MB in the beginning and 305.4MB in the end (delta: -97.1MB). Peak memory consumption was 121.5MB. Max. memory is 8.0GB. [2022-12-13 00:50:49,529 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 175.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 534.36ms. Allocated memory is still 199.2MB. Free memory was 173.7MB in the beginning and 144.9MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.10ms. Allocated memory is still 199.2MB. Free memory was 144.9MB in the beginning and 142.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.50ms. Allocated memory is still 199.2MB. Free memory was 142.3MB in the beginning and 139.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 829.70ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 139.7MB in the beginning and 209.9MB in the end (delta: -70.3MB). Peak memory consumption was 82.8MB. Max. memory is 8.0GB. * TraceAbstraction took 14364.06ms. Allocated memory was 239.1MB in the beginning and 457.2MB in the end (delta: 218.1MB). Free memory was 208.3MB in the beginning and 305.4MB in the end (delta: -97.1MB). Peak memory consumption was 121.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 119 PlacesBefore, 39 PlacesAfterwards, 110 TransitionsBefore, 30 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 967, independent: 896, independent conditional: 896, independent unconditional: 0, dependent: 71, dependent conditional: 71, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 967, independent: 896, independent conditional: 0, independent unconditional: 896, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 967, independent: 896, independent conditional: 0, independent unconditional: 896, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 967, independent: 896, independent conditional: 0, independent unconditional: 896, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 837, independent: 801, independent conditional: 0, independent unconditional: 801, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 837, independent: 777, independent conditional: 0, independent unconditional: 777, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 331, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 305, dependent conditional: 0, dependent unconditional: 305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 967, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 837, unknown conditional: 0, unknown unconditional: 837] , Statistics on independence cache: Total cache size (in pairs): 1167, Positive cache size: 1131, Positive conditional cache size: 0, Positive unconditional cache size: 1131, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 127, independent conditional: 127, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 137, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 137, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 159, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 137, unknown conditional: 0, unknown unconditional: 137] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 111, independent conditional: 111, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 141, independent: 111, independent conditional: 21, independent unconditional: 90, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 141, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 141, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 141, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 42 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 272, independent: 217, independent conditional: 217, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 272, independent: 217, independent conditional: 50, independent unconditional: 167, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 272, independent: 217, independent conditional: 0, independent unconditional: 217, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 272, independent: 217, independent conditional: 0, independent unconditional: 217, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 272, independent: 200, independent conditional: 0, independent unconditional: 200, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 40 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 67, independent conditional: 9, independent unconditional: 58, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 67, independent conditional: 9, independent unconditional: 58, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 67, independent conditional: 9, independent unconditional: 58, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 57, dependent conditional: 26, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 57, independent conditional: 7, independent unconditional: 50, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 20, unknown conditional: 6, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 141, Positive conditional cache size: 2, Positive unconditional cache size: 139, Negative cache size: 36, Negative conditional cache size: 4, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 42 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 162, independent: 146, independent conditional: 86, independent unconditional: 60, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 162, independent: 146, independent conditional: 10, independent unconditional: 136, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 162, independent: 146, independent conditional: 10, independent unconditional: 136, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, independent: 131, independent conditional: 7, independent unconditional: 124, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 16, unknown conditional: 3, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 191, Positive conditional cache size: 5, Positive unconditional cache size: 186, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 76, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 191, Positive conditional cache size: 5, Positive unconditional cache size: 186, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 4 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: 14.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 302 IncrementalHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 2 mSDtfsCounter, 302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=5, InterpolantAutomatonStates: 20, 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.2s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 00:50:49,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...