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 -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_unlock.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 10:19:43,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 10:19:43,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 10:19:43,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 10:19:43,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 10:19:43,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 10:19:43,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 10:19:43,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 10:19:43,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 10:19:43,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 10:19:43,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 10:19:43,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 10:19:43,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 10:19:43,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 10:19:43,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 10:19:43,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 10:19:43,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 10:19:43,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 10:19:43,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 10:19:43,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 10:19:43,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 10:19:43,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 10:19:43,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 10:19:43,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 10:19:43,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 10:19:43,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 10:19:43,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 10:19:43,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 10:19:43,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 10:19:43,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 10:19:43,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 10:19:43,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 10:19:43,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 10:19:43,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 10:19:43,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 10:19:43,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 10:19:43,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 10:19:43,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 10:19:43,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 10:19:43,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 10:19:43,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 10:19:43,244 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-02 10:19:43,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 10:19:43,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 10:19:43,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 10:19:43,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 10:19:43,263 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 10:19:43,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 10:19:43,263 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 10:19:43,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 10:19:43,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 10:19:43,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 10:19:43,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 10:19:43,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 10:19:43,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 10:19:43,265 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 10:19:43,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 10:19:43,265 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 10:19:43,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 10:19:43,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 10:19:43,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 10:19:43,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 10:19:43,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 10:19:43,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:19:43,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 10:19:43,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 10:19:43,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 10:19:43,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 10:19:43,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 10:19:43,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 10:19:43,268 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 10:19:43,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 10:19:43,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 10:19:43,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 10:19:43,318 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 10:19:43,318 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 10:19:43,319 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-02 10:19:43,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f10dc882/82fcd73042994ae58a7e0f6294d55251/FLAG068965d81 [2019-10-02 10:19:43,973 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 10:19:43,974 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_unlock.i [2019-10-02 10:19:43,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f10dc882/82fcd73042994ae58a7e0f6294d55251/FLAG068965d81 [2019-10-02 10:19:44,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f10dc882/82fcd73042994ae58a7e0f6294d55251 [2019-10-02 10:19:44,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 10:19:44,269 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 10:19:44,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 10:19:44,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 10:19:44,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 10:19:44,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:19:44" (1/1) ... [2019-10-02 10:19:44,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a3f083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:44, skipping insertion in model container [2019-10-02 10:19:44,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:19:44" (1/1) ... [2019-10-02 10:19:44,286 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 10:19:44,338 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 10:19:44,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:19:44,857 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 10:19:44,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:19:45,012 INFO L192 MainTranslator]: Completed translation [2019-10-02 10:19:45,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:45 WrapperNode [2019-10-02 10:19:45,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 10:19:45,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 10:19:45,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 10:19:45,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 10:19:45,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:45" (1/1) ... [2019-10-02 10:19:45,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:45" (1/1) ... [2019-10-02 10:19:45,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:45" (1/1) ... [2019-10-02 10:19:45,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:45" (1/1) ... [2019-10-02 10:19:45,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:45" (1/1) ... [2019-10-02 10:19:45,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:45" (1/1) ... [2019-10-02 10:19:45,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:45" (1/1) ... [2019-10-02 10:19:45,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 10:19:45,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 10:19:45,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 10:19:45,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 10:19:45,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:45" (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-02 10:19:45,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 10:19:45,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 10:19:45,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 10:19:45,183 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 10:19:45,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-02 10:19:45,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2019-10-02 10:19:45,184 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-10-02 10:19:45,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-10-02 10:19:45,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-10-02 10:19:45,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-10-02 10:19:45,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-10-02 10:19:45,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-10-02 10:19:45,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2019-10-02 10:19:45,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_set [2019-10-02 10:19:45,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-10-02 10:19:45,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2019-10-02 10:19:45,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2019-10-02 10:19:45,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2019-10-02 10:19:45,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 10:19:45,191 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-02 10:19:45,191 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-02 10:19:45,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 10:19:45,192 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-10-02 10:19:45,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 10:19:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 10:19:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 10:19:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 10:19:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 10:19:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 10:19:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 10:19:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 10:19:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 10:19:45,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 10:19:45,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 10:19:45,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 10:19:45,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 10:19:45,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 10:19:45,195 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 10:19:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 10:19:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 10:19:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 10:19:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 10:19:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 10:19:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 10:19:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 10:19:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 10:19:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 10:19:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 10:19:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 10:19:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 10:19:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 10:19:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 10:19:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 10:19:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 10:19:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 10:19:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 10:19:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 10:19:45,199 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 10:19:45,199 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 10:19:45,199 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 10:19:45,199 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 10:19:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 10:19:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 10:19:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 10:19:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 10:19:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 10:19:45,201 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 10:19:45,201 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 10:19:45,202 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 10:19:45,202 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 10:19:45,202 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 10:19:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 10:19:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 10:19:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 10:19:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 10:19:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 10:19:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 10:19:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 10:19:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 10:19:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 10:19:45,205 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 10:19:45,205 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 10:19:45,205 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 10:19:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 10:19:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 10:19:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 10:19:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 10:19:45,207 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 10:19:45,207 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 10:19:45,207 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 10:19:45,208 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 10:19:45,208 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 10:19:45,208 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 10:19:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 10:19:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 10:19:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 10:19:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 10:19:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 10:19:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 10:19:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 10:19:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 10:19:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 10:19:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 10:19:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 10:19:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 10:19:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 10:19:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 10:19:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 10:19:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 10:19:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 10:19:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 10:19:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 10:19:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 10:19:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 10:19:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 10:19:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 10:19:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 10:19:45,213 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 10:19:45,213 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 10:19:45,213 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 10:19:45,213 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 10:19:45,214 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 10:19:45,214 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 10:19:45,214 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 10:19:45,214 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 10:19:45,214 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 10:19:45,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 10:19:45,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 10:19:45,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 10:19:45,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 10:19:45,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-02 10:19:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 10:19:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2019-10-02 10:19:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-10-02 10:19:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 10:19:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-10-02 10:19:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-10-02 10:19:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-10-02 10:19:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 10:19:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-10-02 10:19:45,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-10-02 10:19:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2019-10-02 10:19:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_set [2019-10-02 10:19:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-10-02 10:19:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2019-10-02 10:19:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2019-10-02 10:19:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2019-10-02 10:19:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 10:19:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 10:19:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-02 10:19:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-02 10:19:45,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 10:19:45,234 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-10-02 10:19:45,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 10:19:45,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 10:19:45,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 10:19:45,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 10:19:45,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 10:19:45,924 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 10:19:45,925 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 10:19:45,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:19:45 BoogieIcfgContainer [2019-10-02 10:19:45,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 10:19:45,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 10:19:45,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 10:19:45,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 10:19:45,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 10:19:44" (1/3) ... [2019-10-02 10:19:45,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb3d55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:19:45, skipping insertion in model container [2019-10-02 10:19:45,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:45" (2/3) ... [2019-10-02 10:19:45,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb3d55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:19:45, skipping insertion in model container [2019-10-02 10:19:45,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:19:45" (3/3) ... [2019-10-02 10:19:45,936 INFO L109 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2019-10-02 10:19:45,948 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 10:19:45,959 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-02 10:19:45,979 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-02 10:19:46,018 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 10:19:46,019 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 10:19:46,019 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 10:19:46,020 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 10:19:46,020 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 10:19:46,020 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 10:19:46,020 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 10:19:46,020 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 10:19:46,020 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 10:19:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2019-10-02 10:19:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 10:19:46,054 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:46,055 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 10:19:46,058 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:46,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:46,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1643511096, now seen corresponding path program 1 times [2019-10-02 10:19:46,066 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:46,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:46,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:46,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:46,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:19:46,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:19:46,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 10:19:46,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 10:19:46,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 10:19:46,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:19:46,320 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 2 states. [2019-10-02 10:19:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:19:46,403 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2019-10-02 10:19:46,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 10:19:46,405 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2019-10-02 10:19:46,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:19:46,418 INFO L225 Difference]: With dead ends: 188 [2019-10-02 10:19:46,418 INFO L226 Difference]: Without dead ends: 92 [2019-10-02 10:19:46,423 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:19:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-02 10:19:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-02 10:19:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-02 10:19:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-10-02 10:19:46,496 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 30 [2019-10-02 10:19:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:19:46,498 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-10-02 10:19:46,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 10:19:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-10-02 10:19:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 10:19:46,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:46,501 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 10:19:46,501 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:46,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:46,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1928613314, now seen corresponding path program 1 times [2019-10-02 10:19:46,502 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:46,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:46,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:46,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:46,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:19:46,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:19:46,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 10:19:46,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:19:46,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:19:46,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:19:46,711 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 4 states. [2019-10-02 10:19:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:19:46,775 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2019-10-02 10:19:46,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 10:19:46,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-02 10:19:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:19:46,785 INFO L225 Difference]: With dead ends: 98 [2019-10-02 10:19:46,785 INFO L226 Difference]: Without dead ends: 96 [2019-10-02 10:19:46,790 INFO L640 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-02 10:19:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-02 10:19:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-10-02 10:19:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-02 10:19:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-10-02 10:19:46,831 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2019-10-02 10:19:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:19:46,832 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-10-02 10:19:46,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:19:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-10-02 10:19:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 10:19:46,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:46,834 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 10:19:46,834 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:46,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:46,834 INFO L82 PathProgramCache]: Analyzing trace with hash -354010009, now seen corresponding path program 1 times [2019-10-02 10:19:46,835 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:46,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:46,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:46,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:46,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:19:47,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:19:47,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:19:47,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:19:47,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:19:47,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:19:47,094 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 5 states. [2019-10-02 10:19:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:19:47,669 INFO L93 Difference]: Finished difference Result 257 states and 311 transitions. [2019-10-02 10:19:47,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 10:19:47,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-02 10:19:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:19:47,674 INFO L225 Difference]: With dead ends: 257 [2019-10-02 10:19:47,674 INFO L226 Difference]: Without dead ends: 175 [2019-10-02 10:19:47,676 INFO L640 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-02 10:19:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-02 10:19:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 140. [2019-10-02 10:19:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-02 10:19:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2019-10-02 10:19:47,699 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 30 [2019-10-02 10:19:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:19:47,700 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2019-10-02 10:19:47,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:19:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2019-10-02 10:19:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 10:19:47,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:47,703 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1] [2019-10-02 10:19:47,703 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash 857482600, now seen corresponding path program 1 times [2019-10-02 10:19:47,704 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:47,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:47,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:47,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:47,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 10:19:47,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:19:47,807 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:19:47,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:48,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:19:48,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:19:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 10:19:48,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:19:48,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2019-10-02 10:19:48,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:19:48,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:19:48,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:19:48,122 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand 4 states. [2019-10-02 10:19:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:19:48,147 INFO L93 Difference]: Finished difference Result 254 states and 306 transitions. [2019-10-02 10:19:48,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 10:19:48,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-02 10:19:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:19:48,151 INFO L225 Difference]: With dead ends: 254 [2019-10-02 10:19:48,151 INFO L226 Difference]: Without dead ends: 146 [2019-10-02 10:19:48,153 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 79 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-02 10:19:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-02 10:19:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-10-02 10:19:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-02 10:19:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2019-10-02 10:19:48,175 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 78 [2019-10-02 10:19:48,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:19:48,175 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2019-10-02 10:19:48,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:19:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2019-10-02 10:19:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 10:19:48,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:48,179 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 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, 1] [2019-10-02 10:19:48,180 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:48,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash -676604102, now seen corresponding path program 1 times [2019-10-02 10:19:48,181 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:48,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:48,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:48,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:48,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 10:19:48,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:19:48,624 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:19:48,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:48,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-02 10:19:48,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:19:48,926 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-02 10:19:48,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:48,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:48,947 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-02 10:19:48,948 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:48,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:48,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:48,958 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-10-02 10:19:49,032 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-02 10:19:49,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:49,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:49,048 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-02 10:19:49,049 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:49,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:49,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:49,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-10-02 10:19:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 10:19:49,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:19:49,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2019-10-02 10:19:49,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 10:19:49,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 10:19:49,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2019-10-02 10:19:49,326 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand 22 states. [2019-10-02 10:19:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:19:52,346 INFO L93 Difference]: Finished difference Result 362 states and 428 transitions. [2019-10-02 10:19:52,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 10:19:52,346 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 78 [2019-10-02 10:19:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:19:52,350 INFO L225 Difference]: With dead ends: 362 [2019-10-02 10:19:52,350 INFO L226 Difference]: Without dead ends: 230 [2019-10-02 10:19:52,354 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=451, Invalid=1805, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 10:19:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-02 10:19:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 160. [2019-10-02 10:19:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-02 10:19:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2019-10-02 10:19:52,385 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 78 [2019-10-02 10:19:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:19:52,385 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2019-10-02 10:19:52,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 10:19:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2019-10-02 10:19:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 10:19:52,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:52,387 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2019-10-02 10:19:52,388 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:52,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash 541030350, now seen corresponding path program 1 times [2019-10-02 10:19:52,388 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:52,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:52,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:52,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:52,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:53,305 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-10-02 10:19:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 10:19:54,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:19:54,284 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:19:54,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:54,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 132 conjunts are in the unsatisfiable core [2019-10-02 10:19:54,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:19:54,556 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-02 10:19:54,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:54,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:54,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:54,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2019-10-02 10:19:54,918 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:54,919 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-02 10:19:54,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:54,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:54,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:54,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-10-02 10:19:55,074 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-02 10:19:55,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:55,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:55,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:55,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-10-02 10:19:55,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:19:55,864 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-10-02 10:19:55,865 INFO L341 Elim1Store]: treesize reduction 100, result has 50.2 percent of original size [2019-10-02 10:19:55,865 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-02 10:19:55,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:56,051 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-10-02 10:19:56,051 INFO L567 ElimStorePlain]: treesize reduction 36, result has 81.2 percent of original size [2019-10-02 10:19:56,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:19:56,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:56,065 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-02 10:19:56,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:161, output treesize:155 [2019-10-02 10:19:56,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:19:56,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:56,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:19:56,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:57,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:57,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:19:59,198 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-10-02 10:19:59,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-02 10:20:19,383 WARN L191 SmtUtils]: Spent 9.93 s on a formula simplification that was a NOOP. DAG size: 155 [2019-10-02 10:20:32,843 WARN L191 SmtUtils]: Spent 4.47 s on a formula simplification. DAG size of input: 153 DAG size of output: 104 [2019-10-02 10:20:32,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:20:32,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:32,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:32,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:32,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:32,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,081 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:20:33,166 INFO L341 Elim1Store]: treesize reduction 17, result has 85.1 percent of original size [2019-10-02 10:20:33,167 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-02 10:20:33,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:20:33,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,297 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:20:33,372 INFO L341 Elim1Store]: treesize reduction 70, result has 38.6 percent of original size [2019-10-02 10:20:33,373 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 1 case distinctions, treesize of input 332 treesize of output 137 [2019-10-02 10:20:33,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:20:33,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:20:33,620 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-10-02 10:20:33,620 INFO L341 Elim1Store]: treesize reduction 148, result has 55.2 percent of original size [2019-10-02 10:20:33,621 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-02 10:20:33,624 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:20:33,738 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 40 [2019-10-02 10:20:33,739 INFO L567 ElimStorePlain]: treesize reduction 541, result has 16.6 percent of original size [2019-10-02 10:20:33,741 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-02 10:20:33,741 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:1464, output treesize:130 [2019-10-02 10:20:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 10:20:36,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:20:36,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 58 [2019-10-02 10:20:36,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-02 10:20:36,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-02 10:20:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=3096, Unknown=5, NotChecked=0, Total=3306 [2019-10-02 10:20:36,486 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand 58 states. [2019-10-02 10:21:14,568 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-10-02 10:22:02,314 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-10-02 10:22:30,820 WARN L191 SmtUtils]: Spent 14.19 s on a formula simplification. DAG size of input: 171 DAG size of output: 158 [2019-10-02 10:22:44,845 WARN L191 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 135 DAG size of output: 57 [2019-10-02 10:23:08,441 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-10-02 10:23:16,773 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-10-02 10:23:23,505 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-10-02 10:23:29,897 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-10-02 10:24:29,758 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-10-02 10:26:09,056 WARN L191 SmtUtils]: Spent 8.68 s on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-10-02 10:26:49,104 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-10-02 10:27:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:27:11,743 INFO L93 Difference]: Finished difference Result 388 states and 452 transitions. [2019-10-02 10:27:11,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 10:27:11,744 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 68 [2019-10-02 10:27:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:27:11,747 INFO L225 Difference]: With dead ends: 388 [2019-10-02 10:27:11,748 INFO L226 Difference]: Without dead ends: 270 [2019-10-02 10:27:11,751 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2831 ImplicationChecksByTransitivity, 157.4s TimeCoverageRelationStatistics Valid=925, Invalid=11032, Unknown=33, NotChecked=0, Total=11990 [2019-10-02 10:27:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-10-02 10:27:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 173. [2019-10-02 10:27:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-02 10:27:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 202 transitions. [2019-10-02 10:27:11,799 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 202 transitions. Word has length 68 [2019-10-02 10:27:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:27:11,802 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 202 transitions. [2019-10-02 10:27:11,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-02 10:27:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 202 transitions. [2019-10-02 10:27:11,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 10:27:11,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:27:11,805 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-10-02 10:27:11,810 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:27:11,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:27:11,811 INFO L82 PathProgramCache]: Analyzing trace with hash 781513442, now seen corresponding path program 1 times [2019-10-02 10:27:11,811 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:27:11,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:27:11,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:27:11,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:27:11,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:27:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:27:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 10:27:12,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:27:12,561 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:27:12,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:27:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:27:12,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 105 conjunts are in the unsatisfiable core [2019-10-02 10:27:12,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:27:12,814 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-02 10:27:12,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:27:12,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:27:12,831 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-02 10:27:12,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:27:12,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:27:12,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:27:12,842 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-10-02 10:27:15,164 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2019-10-02 10:27:15,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:27:15,363 INFO L341 Elim1Store]: treesize reduction 139, result has 30.8 percent of original size [2019-10-02 10:27:15,364 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 69 [2019-10-02 10:27:15,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:27:15,491 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-02 10:27:15,491 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.7 percent of original size [2019-10-02 10:27:15,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:27:15,716 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-10-02 10:27:15,717 INFO L341 Elim1Store]: treesize reduction 100, result has 50.2 percent of original size [2019-10-02 10:27:15,718 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-02 10:27:15,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:27:15,886 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-02 10:27:15,887 INFO L567 ElimStorePlain]: treesize reduction 36, result has 78.7 percent of original size [2019-10-02 10:27:15,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:27:15,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:164, output treesize:211 [2019-10-02 10:27:16,818 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-02 10:27:16,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-02 10:27:17,428 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 142 [2019-10-02 10:27:18,129 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 104 [2019-10-02 10:27:18,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:27:18,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:27:18,204 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 85 treesize of output 69 [2019-10-02 10:27:18,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:27:18,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:27:18,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:27:18,241 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 85 treesize of output 69 [2019-10-02 10:27:18,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:27:18,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:27:18,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:27:18,271 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:192, output treesize:151 [2019-10-02 10:27:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 10:27:18,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:27:18,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2019-10-02 10:27:18,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 10:27:18,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 10:27:18,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 10:27:18,744 INFO L87 Difference]: Start difference. First operand 173 states and 202 transitions. Second operand 38 states. [2019-10-02 10:27:23,878 WARN L191 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-10-02 10:27:24,963 WARN L191 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-10-02 10:27:25,464 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-02 10:27:28,003 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 148 [2019-10-02 10:27:28,277 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 62 [2019-10-02 10:27:28,736 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-02 10:27:29,077 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-02 10:27:29,347 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-10-02 10:27:29,739 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-02 10:27:30,137 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-10-02 10:27:30,382 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-10-02 10:27:31,149 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-10-02 10:27:35,248 WARN L191 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-10-02 10:27:35,557 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-10-02 10:27:40,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:27:40,602 INFO L93 Difference]: Finished difference Result 389 states and 465 transitions. [2019-10-02 10:27:40,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 10:27:40,603 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 71 [2019-10-02 10:27:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:27:40,606 INFO L225 Difference]: With dead ends: 389 [2019-10-02 10:27:40,607 INFO L226 Difference]: Without dead ends: 249 [2019-10-02 10:27:40,609 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=526, Invalid=4730, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 10:27:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-02 10:27:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 166. [2019-10-02 10:27:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-02 10:27:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2019-10-02 10:27:40,628 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 71 [2019-10-02 10:27:40,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:27:40,629 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 192 transitions. [2019-10-02 10:27:40,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 10:27:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2019-10-02 10:27:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 10:27:40,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:27:40,631 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:27:40,631 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:27:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:27:40,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1764353280, now seen corresponding path program 1 times [2019-10-02 10:27:40,632 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:27:40,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:27:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:27:40,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:27:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:27:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:27:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 10:27:40,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:27:40,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 10:27:40,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:27:40,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:27:40,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:27:40,687 INFO L87 Difference]: Start difference. First operand 166 states and 192 transitions. Second operand 4 states. [2019-10-02 10:27:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:27:40,715 INFO L93 Difference]: Finished difference Result 176 states and 203 transitions. [2019-10-02 10:27:40,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 10:27:40,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-10-02 10:27:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:27:40,719 INFO L225 Difference]: With dead ends: 176 [2019-10-02 10:27:40,719 INFO L226 Difference]: Without dead ends: 174 [2019-10-02 10:27:40,721 INFO L640 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-02 10:27:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-02 10:27:40,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-10-02 10:27:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-02 10:27:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 198 transitions. [2019-10-02 10:27:40,742 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 198 transitions. Word has length 95 [2019-10-02 10:27:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:27:40,743 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 198 transitions. [2019-10-02 10:27:40,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:27:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 198 transitions. [2019-10-02 10:27:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 10:27:40,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:27:40,745 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:27:40,745 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:27:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:27:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash -416539925, now seen corresponding path program 2 times [2019-10-02 10:27:40,746 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:27:40,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:27:40,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:27:40,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:27:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:27:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:27:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 10:27:41,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:27:41,529 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:27:41,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:27:41,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:27:41,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:27:41,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 185 conjunts are in the unsatisfiable core [2019-10-02 10:27:41,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:27:42,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:27:42,299 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-10-02 10:27:42,300 INFO L341 Elim1Store]: treesize reduction 139, result has 30.8 percent of original size [2019-10-02 10:27:42,300 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 69 [2019-10-02 10:27:42,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:27:42,414 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-02 10:27:42,415 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.5 percent of original size [2019-10-02 10:27:42,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:27:42,644 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-10-02 10:27:42,644 INFO L341 Elim1Store]: treesize reduction 100, result has 50.2 percent of original size [2019-10-02 10:27:42,645 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-02 10:27:42,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:27:42,797 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-10-02 10:27:42,798 INFO L567 ElimStorePlain]: treesize reduction 36, result has 78.3 percent of original size [2019-10-02 10:27:42,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:42,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:42,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:27:42,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:42,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:27:42,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:42,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:27:42,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:161, output treesize:167 [2019-10-02 10:27:42,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:42,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:42,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:27:42,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:42,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:27:42,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:42,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:42,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:27:42,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:42,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:42,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:27:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:43,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:43,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:27:43,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:43,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:43,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:27:44,842 WARN L191 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-10-02 10:27:45,157 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-10-02 10:27:45,391 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-10-02 10:27:45,525 INFO L392 ElimStorePlain]: Different costs {6=[v_prenex_36, v_prenex_39, v_prenex_38, v_prenex_37], 12=[|v_#memory_$Pointer$.offset_BEFORE_CALL_21|, |v_#memory_$Pointer$.base_BEFORE_CALL_31|]} [2019-10-02 10:27:45,556 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:27:45,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 98 [2019-10-02 10:27:45,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:27:45,701 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-10-02 10:27:45,701 INFO L567 ElimStorePlain]: treesize reduction 16, result has 94.2 percent of original size [2019-10-02 10:27:45,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:27:45,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:27:45,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:27:45,715 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:27:45,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 59 [2019-10-02 10:27:45,717 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:27:45,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:27:45,815 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:27:45,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 64 [2019-10-02 10:27:45,817 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:27:45,856 INFO L567 ElimStorePlain]: treesize reduction 188, result has 6.5 percent of original size [2019-10-02 10:27:45,856 INFO L464 ElimStorePlain]: Eliminatee v_prenex_37 vanished before elimination [2019-10-02 10:27:45,856 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_BEFORE_CALL_21| vanished before elimination [2019-10-02 10:27:45,856 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_31| vanished before elimination [2019-10-02 10:27:45,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:27:45,857 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:315, output treesize:13 [2019-10-02 10:27:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 10:27:46,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:27:46,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2019-10-02 10:27:46,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-02 10:27:46,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-02 10:27:46,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2174, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 10:27:46,485 INFO L87 Difference]: Start difference. First operand 172 states and 198 transitions. Second operand 49 states. [2019-10-02 10:27:49,233 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-02 10:27:49,552 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-02 10:27:50,128 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-10-02 10:27:50,402 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-10-02 10:27:50,661 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-10-02 10:27:50,930 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-10-02 10:27:51,204 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-10-02 10:27:51,908 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2019-10-02 10:27:52,402 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2019-10-02 10:27:52,969 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2019-10-02 10:27:53,876 WARN L191 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-10-02 10:27:54,651 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2019-10-02 10:27:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:27:56,726 INFO L93 Difference]: Finished difference Result 340 states and 396 transitions. [2019-10-02 10:27:56,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 10:27:56,726 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 98 [2019-10-02 10:27:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:27:56,729 INFO L225 Difference]: With dead ends: 340 [2019-10-02 10:27:56,729 INFO L226 Difference]: Without dead ends: 251 [2019-10-02 10:27:56,731 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=572, Invalid=5748, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 10:27:56,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-02 10:27:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 198. [2019-10-02 10:27:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-02 10:27:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 232 transitions. [2019-10-02 10:27:56,753 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 232 transitions. Word has length 98 [2019-10-02 10:27:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:27:56,753 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 232 transitions. [2019-10-02 10:27:56,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-02 10:27:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 232 transitions. [2019-10-02 10:27:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-02 10:27:56,755 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:27:56,755 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-10-02 10:27:56,755 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:27:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:27:56,756 INFO L82 PathProgramCache]: Analyzing trace with hash -782591543, now seen corresponding path program 1 times [2019-10-02 10:27:56,756 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:27:56,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:27:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:27:56,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:27:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:27:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:27:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 10:27:56,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:27:56,836 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:27:56,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:27:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:27:57,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 10:27:57,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:27:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 10:27:57,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:27:57,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 10:27:57,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 10:27:57,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 10:27:57,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:27:57,067 INFO L87 Difference]: Start difference. First operand 198 states and 232 transitions. Second operand 6 states. [2019-10-02 10:27:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:27:57,098 INFO L93 Difference]: Finished difference Result 368 states and 432 transitions. [2019-10-02 10:27:57,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 10:27:57,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-10-02 10:27:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:27:57,101 INFO L225 Difference]: With dead ends: 368 [2019-10-02 10:27:57,101 INFO L226 Difference]: Without dead ends: 198 [2019-10-02 10:27:57,102 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:27:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-02 10:27:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-10-02 10:27:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-02 10:27:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 229 transitions. [2019-10-02 10:27:57,132 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 229 transitions. Word has length 109 [2019-10-02 10:27:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:27:57,136 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 229 transitions. [2019-10-02 10:27:57,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 10:27:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 229 transitions. [2019-10-02 10:27:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 10:27:57,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:27:57,140 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 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, 1, 1] [2019-10-02 10:27:57,141 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:27:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:27:57,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2130351811, now seen corresponding path program 3 times [2019-10-02 10:27:57,141 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:27:57,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:27:57,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:27:57,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:27:57,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:27:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:27:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 10:27:58,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:27:58,270 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:27:58,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:27:58,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 10:27:58,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:27:58,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 211 conjunts are in the unsatisfiable core [2019-10-02 10:27:58,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:27:58,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-02 10:27:58,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:27:58,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:27:58,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-02 10:27:58,945 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:27:58,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:27:58,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:27:58,967 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-10-02 10:28:57,683 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 44 [2019-10-02 10:28:57,932 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-10-02 10:28:57,933 INFO L341 Elim1Store]: treesize reduction 154, result has 38.9 percent of original size [2019-10-02 10:28:57,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 108 [2019-10-02 10:28:57,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:28:58,110 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-10-02 10:28:58,111 INFO L567 ElimStorePlain]: treesize reduction 32, result has 83.5 percent of original size [2019-10-02 10:28:58,350 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-10-02 10:28:58,351 INFO L341 Elim1Store]: treesize reduction 121, result has 52.0 percent of original size [2019-10-02 10:28:58,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 141 [2019-10-02 10:28:58,353 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:28:58,566 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-02 10:28:58,567 INFO L567 ElimStorePlain]: treesize reduction 48, result has 78.1 percent of original size [2019-10-02 10:28:58,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:28:58,584 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:170, output treesize:236 [2019-10-02 10:28:58,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:58,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:28:58,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:02,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:02,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:02,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:02,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:02,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:02,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:02,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:02,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:02,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:02,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:02,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:02,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:02,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:02,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:02,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:02,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:02,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:02,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:02,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:02,803 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-10-02 10:29:07,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:07,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:07,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:07,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:07,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:07,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:07,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:07,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:07,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:07,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:07,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:07,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:07,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:29:07,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:07,025 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-10-02 10:29:07,838 WARN L191 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2019-10-02 10:29:07,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:29:08,362 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-10-02 10:29:08,373 INFO L392 ElimStorePlain]: Different costs {4=[v_prenex_41, |v_#memory_$Pointer$.base_BEFORE_CALL_40|], 6=[|v_#memory_$Pointer$.offset_BEFORE_CALL_30|, v_prenex_43, v_prenex_42, v_prenex_40], 10=[v_prenex_45], 14=[v_prenex_44]} [2019-10-02 10:29:08,386 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:29:08,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 52 [2019-10-02 10:29:08,388 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:29:08,571 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-10-02 10:29:08,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:29:08,585 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:29:08,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 52 [2019-10-02 10:29:08,623 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:29:08,745 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-10-02 10:29:08,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:29:08,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:29:08,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2019-10-02 10:29:08,755 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:29:08,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:29:08,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:29:08,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 65 [2019-10-02 10:29:08,864 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:29:08,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:29:08,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:29:08,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2019-10-02 10:29:08,964 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:29:09,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:29:09,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:29:09,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2019-10-02 10:29:09,050 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:29:09,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:29:09,168 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:29:09,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 106 [2019-10-02 10:29:09,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:09,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:09,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:09,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:09,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:09,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:09,174 INFO L496 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:29:09,294 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-10-02 10:29:09,295 INFO L567 ElimStorePlain]: treesize reduction 36, result has 72.5 percent of original size [2019-10-02 10:29:09,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:29:09,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:29:09,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 80 [2019-10-02 10:29:09,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:09,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:09,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:09,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:09,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:09,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:29:09,337 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:29:09,461 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-10-02 10:29:09,462 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.9 percent of original size [2019-10-02 10:29:09,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-10-02 10:29:09,463 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:386, output treesize:56 [2019-10-02 10:29:10,131 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-10-02 10:29:10,347 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-02 10:29:10,589 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-02 10:29:10,883 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-10-02 10:29:11,269 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-02 10:29:11,575 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-02 10:29:11,858 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-02 10:29:12,113 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-02 10:29:12,372 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-10-02 10:29:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 27 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:29:12,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:29:12,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 34] total 60 [2019-10-02 10:29:12,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-02 10:29:12,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-02 10:29:12,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3282, Unknown=28, NotChecked=0, Total=3540 [2019-10-02 10:29:12,440 INFO L87 Difference]: Start difference. First operand 198 states and 229 transitions. Second operand 60 states.