java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_unlock.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 12:50:14,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 12:50:14,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 12:50:14,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 12:50:14,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 12:50:14,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 12:50:14,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 12:50:14,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 12:50:14,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 12:50:14,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 12:50:14,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 12:50:14,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 12:50:14,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 12:50:14,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 12:50:14,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 12:50:14,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 12:50:14,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 12:50:14,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 12:50:14,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 12:50:14,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 12:50:14,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 12:50:14,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 12:50:14,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 12:50:14,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 12:50:14,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 12:50:14,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 12:50:14,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 12:50:14,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 12:50:14,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 12:50:14,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 12:50:14,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 12:50:14,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 12:50:14,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 12:50:14,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 12:50:14,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 12:50:14,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 12:50:14,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 12:50:14,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 12:50:14,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 12:50:14,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 12:50:14,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 12:50:14,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 12:50:14,206 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 12:50:14,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 12:50:14,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 12:50:14,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 12:50:14,209 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 12:50:14,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 12:50:14,209 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 12:50:14,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 12:50:14,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 12:50:14,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 12:50:14,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 12:50:14,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 12:50:14,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 12:50:14,212 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 12:50:14,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 12:50:14,212 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 12:50:14,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 12:50:14,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 12:50:14,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 12:50:14,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 12:50:14,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 12:50:14,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 12:50:14,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 12:50:14,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 12:50:14,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 12:50:14,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 12:50:14,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 12:50:14,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 12:50:14,215 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 12:50:14,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 12:50:14,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 12:50:14,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 12:50:14,579 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 12:50:14,579 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 12:50:14,580 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_unlock.i [2019-10-07 12:50:14,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8610f546a/e1b9d04c98cf4ff28cf214839f15b46d/FLAGcdb94254f [2019-10-07 12:50:15,268 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 12:50:15,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_unlock.i [2019-10-07 12:50:15,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8610f546a/e1b9d04c98cf4ff28cf214839f15b46d/FLAGcdb94254f [2019-10-07 12:50:15,478 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8610f546a/e1b9d04c98cf4ff28cf214839f15b46d [2019-10-07 12:50:15,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 12:50:15,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 12:50:15,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 12:50:15,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 12:50:15,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 12:50:15,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:50:15" (1/1) ... [2019-10-07 12:50:15,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d6129f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:50:15, skipping insertion in model container [2019-10-07 12:50:15,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:50:15" (1/1) ... [2019-10-07 12:50:15,506 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 12:50:15,570 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 12:50:16,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 12:50:16,094 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 12:50:16,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 12:50:16,233 INFO L192 MainTranslator]: Completed translation [2019-10-07 12:50:16,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:50:16 WrapperNode [2019-10-07 12:50:16,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 12:50:16,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 12:50:16,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 12:50:16,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 12:50:16,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:50:16" (1/1) ... [2019-10-07 12:50:16,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:50:16" (1/1) ... [2019-10-07 12:50:16,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:50:16" (1/1) ... [2019-10-07 12:50:16,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:50:16" (1/1) ... [2019-10-07 12:50:16,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:50:16" (1/1) ... [2019-10-07 12:50:16,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:50:16" (1/1) ... [2019-10-07 12:50:16,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:50:16" (1/1) ... [2019-10-07 12:50:16,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 12:50:16,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 12:50:16,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 12:50:16,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 12:50:16,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:50:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 12:50:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 12:50:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 12:50:16,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-07 12:50:16,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-07 12:50:16,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-07 12:50:16,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2019-10-07 12:50:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-10-07 12:50:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-10-07 12:50:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-10-07 12:50:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-10-07 12:50:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-10-07 12:50:16,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-10-07 12:50:16,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2019-10-07 12:50:16,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_set [2019-10-07 12:50:16,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-10-07 12:50:16,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2019-10-07 12:50:16,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2019-10-07 12:50:16,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2019-10-07 12:50:16,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-07 12:50:16,384 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-07 12:50:16,384 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-07 12:50:16,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-07 12:50:16,385 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-10-07 12:50:16,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 12:50:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-07 12:50:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-07 12:50:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 12:50:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 12:50:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 12:50:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 12:50:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 12:50:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 12:50:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 12:50:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 12:50:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 12:50:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 12:50:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 12:50:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 12:50:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 12:50:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 12:50:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 12:50:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 12:50:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 12:50:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 12:50:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 12:50:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 12:50:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 12:50:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 12:50:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 12:50:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 12:50:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 12:50:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 12:50:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 12:50:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 12:50:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 12:50:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 12:50:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 12:50:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 12:50:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 12:50:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 12:50:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 12:50:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 12:50:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 12:50:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 12:50:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 12:50:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 12:50:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 12:50:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 12:50:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 12:50:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 12:50:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 12:50:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 12:50:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 12:50:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 12:50:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 12:50:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 12:50:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 12:50:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 12:50:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 12:50:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 12:50:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 12:50:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 12:50:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 12:50:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 12:50:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 12:50:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 12:50:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 12:50:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 12:50:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 12:50:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 12:50:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 12:50:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 12:50:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 12:50:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 12:50:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 12:50:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 12:50:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 12:50:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 12:50:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 12:50:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 12:50:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 12:50:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 12:50:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 12:50:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 12:50:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 12:50:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 12:50:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 12:50:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 12:50:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 12:50:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 12:50:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 12:50:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 12:50:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 12:50:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 12:50:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 12:50:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 12:50:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 12:50:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 12:50:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 12:50:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 12:50:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 12:50:16,403 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 12:50:16,403 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 12:50:16,403 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 12:50:16,403 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 12:50:16,403 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 12:50:16,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 12:50:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 12:50:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 12:50:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 12:50:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-07 12:50:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 12:50:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2019-10-07 12:50:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-10-07 12:50:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 12:50:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-10-07 12:50:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-10-07 12:50:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-10-07 12:50:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 12:50:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-10-07 12:50:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-10-07 12:50:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2019-10-07 12:50:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_set [2019-10-07 12:50:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-10-07 12:50:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2019-10-07 12:50:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2019-10-07 12:50:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2019-10-07 12:50:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 12:50:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-07 12:50:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-07 12:50:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-07 12:50:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-07 12:50:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-10-07 12:50:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 12:50:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 12:50:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 12:50:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-07 12:50:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 12:50:17,279 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 12:50:17,279 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 12:50:17,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:50:17 BoogieIcfgContainer [2019-10-07 12:50:17,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 12:50:17,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 12:50:17,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 12:50:17,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 12:50:17,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:50:15" (1/3) ... [2019-10-07 12:50:17,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d040e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:50:17, skipping insertion in model container [2019-10-07 12:50:17,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:50:16" (2/3) ... [2019-10-07 12:50:17,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d040e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:50:17, skipping insertion in model container [2019-10-07 12:50:17,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:50:17" (3/3) ... [2019-10-07 12:50:17,289 INFO L109 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2019-10-07 12:50:17,299 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 12:50:17,307 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-07 12:50:17,317 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-07 12:50:17,341 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 12:50:17,341 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 12:50:17,342 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 12:50:17,342 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 12:50:17,342 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 12:50:17,342 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 12:50:17,342 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 12:50:17,342 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 12:50:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-10-07 12:50:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 12:50:17,372 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:50:17,373 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:50:17,375 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:50:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:50:17,383 INFO L82 PathProgramCache]: Analyzing trace with hash 74425245, now seen corresponding path program 1 times [2019-10-07 12:50:17,393 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:50:17,393 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:50:17,393 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:50:17,394 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:50:17,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:50:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:50:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 12:50:17,647 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:50:17,647 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 12:50:17,648 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 12:50:17,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 12:50:17,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 12:50:17,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 12:50:17,669 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2019-10-07 12:50:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:50:17,725 INFO L93 Difference]: Finished difference Result 169 states and 200 transitions. [2019-10-07 12:50:17,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 12:50:17,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-10-07 12:50:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:50:17,740 INFO L225 Difference]: With dead ends: 169 [2019-10-07 12:50:17,740 INFO L226 Difference]: Without dead ends: 85 [2019-10-07 12:50:17,745 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 12:50:17,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-07 12:50:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-10-07 12:50:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-07 12:50:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2019-10-07 12:50:17,802 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 26 [2019-10-07 12:50:17,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:50:17,803 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2019-10-07 12:50:17,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 12:50:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2019-10-07 12:50:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 12:50:17,805 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:50:17,805 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:50:17,806 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:50:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:50:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1430307179, now seen corresponding path program 1 times [2019-10-07 12:50:17,807 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:50:17,807 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:50:17,807 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:50:17,807 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:50:17,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:50:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:50:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 12:50:18,030 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:50:18,030 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 12:50:18,030 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 12:50:18,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 12:50:18,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 12:50:18,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 12:50:18,033 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand 5 states. [2019-10-07 12:50:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:50:18,590 INFO L93 Difference]: Finished difference Result 226 states and 280 transitions. [2019-10-07 12:50:18,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 12:50:18,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-07 12:50:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:50:18,595 INFO L225 Difference]: With dead ends: 226 [2019-10-07 12:50:18,595 INFO L226 Difference]: Without dead ends: 154 [2019-10-07 12:50:18,597 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 12:50:18,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-07 12:50:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 124. [2019-10-07 12:50:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-07 12:50:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2019-10-07 12:50:18,638 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 27 [2019-10-07 12:50:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:50:18,638 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2019-10-07 12:50:18,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 12:50:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2019-10-07 12:50:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-07 12:50:18,644 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:50:18,644 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:50:18,644 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:50:18,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:50:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash 192926419, now seen corresponding path program 1 times [2019-10-07 12:50:18,647 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:50:18,647 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:50:18,648 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:50:18,648 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:50:18,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:50:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:50:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-07 12:50:18,809 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:50:18,809 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 12:50:18,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:50:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:50:19,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 12:50:19,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 12:50:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 12:50:19,062 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 12:50:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-07 12:50:19,253 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 12:50:19,253 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 4 [2019-10-07 12:50:19,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 12:50:19,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 12:50:19,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 12:50:19,256 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand 4 states. [2019-10-07 12:50:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:50:19,297 INFO L93 Difference]: Finished difference Result 224 states and 276 transitions. [2019-10-07 12:50:19,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 12:50:19,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-10-07 12:50:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:50:19,305 INFO L225 Difference]: With dead ends: 224 [2019-10-07 12:50:19,306 INFO L226 Difference]: Without dead ends: 130 [2019-10-07 12:50:19,309 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 12:50:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-07 12:50:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-10-07 12:50:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-07 12:50:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2019-10-07 12:50:19,330 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 70 [2019-10-07 12:50:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:50:19,331 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2019-10-07 12:50:19,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 12:50:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2019-10-07 12:50:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 12:50:19,334 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:50:19,334 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:50:19,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:50:19,537 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:50:19,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:50:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash -272147404, now seen corresponding path program 1 times [2019-10-07 12:50:19,538 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:50:19,538 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:50:19,538 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:50:19,538 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:50:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:50:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:50:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-07 12:50:19,975 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:50:19,976 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 12:50:19,976 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-07 12:50:19,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-07 12:50:19,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-07 12:50:19,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-07 12:50:19,978 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand 15 states. [2019-10-07 12:50:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:50:21,815 INFO L93 Difference]: Finished difference Result 257 states and 313 transitions. [2019-10-07 12:50:21,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 12:50:21,815 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 82 [2019-10-07 12:50:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:50:21,819 INFO L225 Difference]: With dead ends: 257 [2019-10-07 12:50:21,819 INFO L226 Difference]: Without dead ends: 190 [2019-10-07 12:50:21,820 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2019-10-07 12:50:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-07 12:50:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 153. [2019-10-07 12:50:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-07 12:50:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2019-10-07 12:50:21,848 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 82 [2019-10-07 12:50:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:50:21,849 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2019-10-07 12:50:21,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-07 12:50:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2019-10-07 12:50:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 12:50:21,851 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:50:21,852 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:50:21,852 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:50:21,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:50:21,852 INFO L82 PathProgramCache]: Analyzing trace with hash 334435873, now seen corresponding path program 1 times [2019-10-07 12:50:21,853 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:50:21,853 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:50:21,853 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:50:21,853 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:50:21,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:50:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:50:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-07 12:50:22,202 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:50:22,202 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 12:50:22,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:50:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:50:22,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-07 12:50:22,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 12:50:22,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-07 12:50:22,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:22,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:22,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-07 12:50:22,523 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:22,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:22,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 12:50:22,531 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-10-07 12:50:22,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-07 12:50:22,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:22,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:22,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-07 12:50:22,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:22,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:22,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 12:50:22,613 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-10-07 12:50:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-07 12:50:22,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 12:50:23,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:50:23,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-10-07 12:50:23,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:23,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:23,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-10-07 12:50:23,350 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:23,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:23,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 12:50:23,381 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2019-10-07 12:50:23,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:50:23,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-10-07 12:50:23,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:23,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:23,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-10-07 12:50:23,576 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:23,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:23,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 12:50:23,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-10-07 12:50:23,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:50:23,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:50:23,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2019-10-07 12:50:23,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:23,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2019-10-07 12:50:23,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:23,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:23,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-10-07 12:50:23,791 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:23,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-10-07 12:50:23,796 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:23,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:23,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-07 12:50:23,813 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:49 [2019-10-07 12:50:23,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:50:23,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:50:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-07 12:50:23,919 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 12:50:23,919 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14, 10] total 28 [2019-10-07 12:50:23,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 12:50:23,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 12:50:23,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2019-10-07 12:50:23,921 INFO L87 Difference]: Start difference. First operand 153 states and 190 transitions. Second operand 10 states. [2019-10-07 12:50:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:50:25,097 INFO L93 Difference]: Finished difference Result 313 states and 384 transitions. [2019-10-07 12:50:25,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 12:50:25,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-10-07 12:50:25,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:50:25,101 INFO L225 Difference]: With dead ends: 313 [2019-10-07 12:50:25,101 INFO L226 Difference]: Without dead ends: 185 [2019-10-07 12:50:25,105 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2019-10-07 12:50:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-07 12:50:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 144. [2019-10-07 12:50:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-07 12:50:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 171 transitions. [2019-10-07 12:50:25,146 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 171 transitions. Word has length 72 [2019-10-07 12:50:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:50:25,147 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 171 transitions. [2019-10-07 12:50:25,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 12:50:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 171 transitions. [2019-10-07 12:50:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 12:50:25,152 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:50:25,152 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:50:25,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:50:25,366 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:50:25,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:50:25,367 INFO L82 PathProgramCache]: Analyzing trace with hash -569045583, now seen corresponding path program 1 times [2019-10-07 12:50:25,367 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:50:25,367 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:50:25,368 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:50:25,368 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:50:25,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:50:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:50:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 12:50:27,010 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:50:27,011 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 12:50:27,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:50:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:50:27,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 132 conjunts are in the unsatisfiable core [2019-10-07 12:50:27,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 12:50:27,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-07 12:50:27,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:27,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:27,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 12:50:27,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2019-10-07 12:50:27,604 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:27,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-07 12:50:27,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:27,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:27,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 12:50:27,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-10-07 12:50:27,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-07 12:50:27,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:27,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:50:27,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 12:50:27,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-10-07 12:50:28,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:50:28,599 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-10-07 12:50:28,602 INFO L341 Elim1Store]: treesize reduction 100, result has 50.2 percent of original size [2019-10-07 12:50:28,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 108 [2019-10-07 12:50:28,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:50:28,797 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-10-07 12:50:28,798 INFO L567 ElimStorePlain]: treesize reduction 36, result has 81.2 percent of original size [2019-10-07 12:50:28,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:50:28,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:50:28,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 12:50:28,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:161, output treesize:155 [2019-10-07 12:50:28,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:50:28,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:50:29,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:50:29,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:50:33,010 WARN L191 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-10-07 12:50:33,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 12:50:50,165 WARN L191 SmtUtils]: Spent 8.49 s on a formula simplification that was a NOOP. DAG size: 155 [2019-10-07 12:51:03,441 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 153 DAG size of output: 104 [2019-10-07 12:51:03,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:51:03,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:03,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:03,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:03,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:03,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:03,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:03,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:03,610 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 12:51:03,746 INFO L341 Elim1Store]: treesize reduction 70, result has 38.6 percent of original size [2019-10-07 12:51:03,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 332 treesize of output 137 [2019-10-07 12:51:03,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:51:03,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:03,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:03,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:03,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:03,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:04,065 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-10-07 12:51:04,066 INFO L341 Elim1Store]: treesize reduction 148, result has 55.2 percent of original size [2019-10-07 12:51:04,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 335 treesize of output 265 [2019-10-07 12:51:04,068 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 12:51:04,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:04,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:04,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:04,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:04,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:04,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:04,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:51:04,108 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 12:51:04,180 INFO L341 Elim1Store]: treesize reduction 17, result has 85.1 percent of original size [2019-10-07 12:51:04,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 334 treesize of output 192 [2019-10-07 12:51:04,182 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 12:51:04,295 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 40 [2019-10-07 12:51:04,296 INFO L567 ElimStorePlain]: treesize reduction 501, result has 17.7 percent of original size [2019-10-07 12:51:04,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 12:51:04,298 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:1464, output treesize:130 [2019-10-07 12:51:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 12:51:06,026 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 12:51:07,507 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-07 12:51:07,749 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-07 12:51:08,223 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-07 12:51:08,343 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-10-07 12:51:08,511 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-07 12:51:08,650 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-10-07 12:51:08,821 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-07 12:51:08,924 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-10-07 12:51:09,057 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-07 12:51:09,178 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-10-07 12:51:10,954 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-07 12:51:11,200 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-07 12:51:11,392 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-10-07 12:51:11,686 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-07 12:51:11,793 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-10-07 12:51:11,968 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-07 12:51:12,125 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-10-07 12:51:37,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:51:37,842 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-07 12:51:37,847 INFO L168 Benchmark]: Toolchain (without parser) took 82358.07 ms. Allocated memory was 139.5 MB in the beginning and 413.7 MB in the end (delta: 274.2 MB). Free memory was 102.5 MB in the beginning and 307.1 MB in the end (delta: -204.6 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. [2019-10-07 12:51:37,853 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-07 12:51:37,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.89 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.3 MB in the beginning and 165.2 MB in the end (delta: -62.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-10-07 12:51:37,855 INFO L168 Benchmark]: Boogie Preprocessor took 86.13 ms. Allocated memory is still 203.9 MB. Free memory was 165.2 MB in the beginning and 161.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-10-07 12:51:37,858 INFO L168 Benchmark]: RCFGBuilder took 959.38 ms. Allocated memory was 203.9 MB in the beginning and 235.9 MB in the end (delta: 32.0 MB). Free memory was 161.2 MB in the beginning and 205.8 MB in the end (delta: -44.7 MB). Peak memory consumption was 75.5 MB. Max. memory is 7.1 GB. [2019-10-07 12:51:37,859 INFO L168 Benchmark]: TraceAbstraction took 80563.87 ms. Allocated memory was 235.9 MB in the beginning and 413.7 MB in the end (delta: 177.7 MB). Free memory was 205.8 MB in the beginning and 307.1 MB in the end (delta: -101.3 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB. [2019-10-07 12:51:37,870 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.89 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.3 MB in the beginning and 165.2 MB in the end (delta: -62.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.13 ms. Allocated memory is still 203.9 MB. Free memory was 165.2 MB in the beginning and 161.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 959.38 ms. Allocated memory was 203.9 MB in the beginning and 235.9 MB in the end (delta: 32.0 MB). Free memory was 161.2 MB in the beginning and 205.8 MB in the end (delta: -44.7 MB). Peak memory consumption was 75.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80563.87 ms. Allocated memory was 235.9 MB in the beginning and 413.7 MB in the end (delta: 177.7 MB). Free memory was 205.8 MB in the beginning and 307.1 MB in the end (delta: -101.3 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...