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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:01:46,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:01:46,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:01:46,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:01:46,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:01:46,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:01:46,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:01:46,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:01:46,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:01:46,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:01:46,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:01:46,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:01:46,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:01:46,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:01:46,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:01:46,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:01:46,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:01:46,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:01:46,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:01:46,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:01:46,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:01:46,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:01:46,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:01:46,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:01:46,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:01:46,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:01:46,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:01:46,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:01:46,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:01:46,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:01:46,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:01:46,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:01:46,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:01:46,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:01:46,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:01:46,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:01:46,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:01:46,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:01:46,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:01:46,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:01:46,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:01:46,334 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-15 01:01:46,353 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:01:46,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:01:46,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:01:46,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:01:46,358 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:01:46,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:01:46,358 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:01:46,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:01:46,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:01:46,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:01:46,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:01:46,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:01:46,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:01:46,361 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:01:46,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:01:46,361 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:01:46,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:01:46,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:01:46,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:01:46,362 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:01:46,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:01:46,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:01:46,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:01:46,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:01:46,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:01:46,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:01:46,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:01:46,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:01:46,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:01:46,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:01:46,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:01:46,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:01:46,750 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:01:46,750 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:01:46,751 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex.i [2019-10-15 01:01:46,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f1cad34/fd88e0c8bb1e47e582d8d24e0af51671/FLAG7354c6948 [2019-10-15 01:01:47,384 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:01:47,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex.i [2019-10-15 01:01:47,403 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f1cad34/fd88e0c8bb1e47e582d8d24e0af51671/FLAG7354c6948 [2019-10-15 01:01:47,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f1cad34/fd88e0c8bb1e47e582d8d24e0af51671 [2019-10-15 01:01:47,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:01:47,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:01:47,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:01:47,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:01:47,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:01:47,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:01:47" (1/1) ... [2019-10-15 01:01:47,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d13a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:47, skipping insertion in model container [2019-10-15 01:01:47,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:01:47" (1/1) ... [2019-10-15 01:01:47,722 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:01:47,782 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:01:48,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:01:48,298 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:01:48,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:01:48,441 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:01:48,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:48 WrapperNode [2019-10-15 01:01:48,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:01:48,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:01:48,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:01:48,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:01:48,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:48" (1/1) ... [2019-10-15 01:01:48,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:48" (1/1) ... [2019-10-15 01:01:48,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:48" (1/1) ... [2019-10-15 01:01:48,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:48" (1/1) ... [2019-10-15 01:01:48,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:48" (1/1) ... [2019-10-15 01:01:48,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:48" (1/1) ... [2019-10-15 01:01:48,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:48" (1/1) ... [2019-10-15 01:01:48,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:01:48,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:01:48,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:01:48,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:01:48,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:48" (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-15 01:01:48,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:01:48,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:01:48,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-15 01:01:48,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-15 01:01:48,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-15 01:01:48,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2019-10-15 01:01:48,570 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-10-15 01:01:48,570 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-10-15 01:01:48,570 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-10-15 01:01:48,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-10-15 01:01:48,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-10-15 01:01:48,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-10-15 01:01:48,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2019-10-15 01:01:48,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_set [2019-10-15 01:01:48,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-10-15 01:01:48,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2019-10-15 01:01:48,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2019-10-15 01:01:48,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2019-10-15 01:01:48,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-15 01:01:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-15 01:01:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-15 01:01:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-15 01:01:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-10-15 01:01:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:01:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-15 01:01:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-15 01:01:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 01:01:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 01:01:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 01:01:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 01:01:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 01:01:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 01:01:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 01:01:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 01:01:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 01:01:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 01:01:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 01:01:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 01:01:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 01:01:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 01:01:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 01:01:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 01:01:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 01:01:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 01:01:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 01:01:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 01:01:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 01:01:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 01:01:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 01:01:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 01:01:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 01:01:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 01:01:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 01:01:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 01:01:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 01:01:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 01:01:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 01:01:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 01:01:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 01:01:48,584 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 01:01:48,584 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 01:01:48,584 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 01:01:48,584 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 01:01:48,584 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 01:01:48,584 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 01:01:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 01:01:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 01:01:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 01:01:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 01:01:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 01:01:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 01:01:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 01:01:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 01:01:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 01:01:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 01:01:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 01:01:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:01:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 01:01:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 01:01:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:01:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 01:01:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 01:01:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 01:01:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 01:01:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 01:01:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 01:01:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 01:01:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:01:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 01:01:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 01:01:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 01:01:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 01:01:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 01:01:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 01:01:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 01:01:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 01:01:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 01:01:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 01:01:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 01:01:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 01:01:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 01:01:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 01:01:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 01:01:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 01:01:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 01:01:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 01:01:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 01:01:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 01:01:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 01:01:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 01:01:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 01:01:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 01:01:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 01:01:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 01:01:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 01:01:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 01:01:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 01:01:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 01:01:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 01:01:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 01:01:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 01:01:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 01:01:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 01:01:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 01:01:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 01:01:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 01:01:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:01:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:01:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:01:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:01:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-15 01:01:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:01:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2019-10-15 01:01:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-10-15 01:01:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:01:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-10-15 01:01:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-10-15 01:01:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-10-15 01:01:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:01:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-10-15 01:01:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-10-15 01:01:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2019-10-15 01:01:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_set [2019-10-15 01:01:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-10-15 01:01:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2019-10-15 01:01:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2019-10-15 01:01:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2019-10-15 01:01:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:01:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-15 01:01:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-15 01:01:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-15 01:01:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-15 01:01:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-10-15 01:01:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:01:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:01:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:01:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-15 01:01:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:01:49,295 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:01:49,295 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 01:01:49,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:01:49 BoogieIcfgContainer [2019-10-15 01:01:49,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:01:49,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:01:49,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:01:49,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:01:49,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:01:47" (1/3) ... [2019-10-15 01:01:49,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dd7976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:01:49, skipping insertion in model container [2019-10-15 01:01:49,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:48" (2/3) ... [2019-10-15 01:01:49,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dd7976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:01:49, skipping insertion in model container [2019-10-15 01:01:49,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:01:49" (3/3) ... [2019-10-15 01:01:49,306 INFO L109 eAbstractionObserver]: Analyzing ICFG test_mutex.i [2019-10-15 01:01:49,316 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:01:49,325 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-15 01:01:49,337 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-15 01:01:49,365 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:01:49,365 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:01:49,365 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:01:49,365 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:01:49,365 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:01:49,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:01:49,366 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:01:49,366 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:01:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2019-10-15 01:01:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:01:49,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:49,398 INFO L380 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-15 01:01:49,400 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:49,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1643511096, now seen corresponding path program 1 times [2019-10-15 01:01:49,418 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:49,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386996276] [2019-10-15 01:01:49,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:49,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:49,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:49,683 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-15 01:01:49,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386996276] [2019-10-15 01:01:49,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:01:49,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:01:49,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917348686] [2019-10-15 01:01:49,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:01:49,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:01:49,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:01:49,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:01:49,711 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 2 states. [2019-10-15 01:01:49,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:01:49,747 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2019-10-15 01:01:49,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:01:49,748 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2019-10-15 01:01:49,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:01:49,760 INFO L225 Difference]: With dead ends: 188 [2019-10-15 01:01:49,760 INFO L226 Difference]: Without dead ends: 92 [2019-10-15 01:01:49,770 INFO L600 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-15 01:01:49,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-15 01:01:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-15 01:01:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-15 01:01:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-10-15 01:01:49,834 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 30 [2019-10-15 01:01:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:01:49,836 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-10-15 01:01:49,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:01:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-10-15 01:01:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:01:49,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:49,838 INFO L380 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-15 01:01:49,839 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:49,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1928613314, now seen corresponding path program 1 times [2019-10-15 01:01:49,840 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:49,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056037055] [2019-10-15 01:01:49,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:49,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:49,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:50,013 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-15 01:01:50,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056037055] [2019-10-15 01:01:50,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:01:50,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:01:50,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484312709] [2019-10-15 01:01:50,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:01:50,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:01:50,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:01:50,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:01:50,017 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 4 states. [2019-10-15 01:01:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:01:50,048 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2019-10-15 01:01:50,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:01:50,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-15 01:01:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:01:50,052 INFO L225 Difference]: With dead ends: 98 [2019-10-15 01:01:50,053 INFO L226 Difference]: Without dead ends: 96 [2019-10-15 01:01:50,054 INFO L600 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-15 01:01:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-15 01:01:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-10-15 01:01:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-15 01:01:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-10-15 01:01:50,070 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2019-10-15 01:01:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:01:50,071 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-10-15 01:01:50,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:01:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-10-15 01:01:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:01:50,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:50,072 INFO L380 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-15 01:01:50,073 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:50,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:50,073 INFO L82 PathProgramCache]: Analyzing trace with hash -354010009, now seen corresponding path program 1 times [2019-10-15 01:01:50,075 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:50,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815332120] [2019-10-15 01:01:50,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:50,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:50,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:50,280 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-15 01:01:50,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815332120] [2019-10-15 01:01:50,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:01:50,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:01:50,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986194401] [2019-10-15 01:01:50,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:01:50,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:01:50,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:01:50,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:01:50,283 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 5 states. [2019-10-15 01:01:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:01:50,829 INFO L93 Difference]: Finished difference Result 257 states and 311 transitions. [2019-10-15 01:01:50,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:01:50,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-15 01:01:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:01:50,834 INFO L225 Difference]: With dead ends: 257 [2019-10-15 01:01:50,835 INFO L226 Difference]: Without dead ends: 175 [2019-10-15 01:01:50,836 INFO L600 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-15 01:01:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-15 01:01:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 140. [2019-10-15 01:01:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-15 01:01:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2019-10-15 01:01:50,870 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 30 [2019-10-15 01:01:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:01:50,871 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2019-10-15 01:01:50,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:01:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2019-10-15 01:01:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 01:01:50,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:50,876 INFO L380 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-15 01:01:50,876 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:50,877 INFO L82 PathProgramCache]: Analyzing trace with hash 857482600, now seen corresponding path program 1 times [2019-10-15 01:01:50,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:50,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974910053] [2019-10-15 01:01:50,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:50,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:50,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:50,984 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-15 01:01:50,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974910053] [2019-10-15 01:01:50,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224356789] [2019-10-15 01:01:50,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:01:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:51,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:01:51,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:01:51,248 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-15 01:01:51,249 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:01:51,396 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-15 01:01:51,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:01:51,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 4 [2019-10-15 01:01:51,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738706032] [2019-10-15 01:01:51,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:01:51,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:01:51,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:01:51,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:01:51,400 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand 4 states. [2019-10-15 01:01:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:01:51,434 INFO L93 Difference]: Finished difference Result 254 states and 306 transitions. [2019-10-15 01:01:51,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:01:51,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-15 01:01:51,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:01:51,440 INFO L225 Difference]: With dead ends: 254 [2019-10-15 01:01:51,440 INFO L226 Difference]: Without dead ends: 146 [2019-10-15 01:01:51,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 157 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-15 01:01:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-15 01:01:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-10-15 01:01:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-15 01:01:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2019-10-15 01:01:51,474 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 78 [2019-10-15 01:01:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:01:51,474 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2019-10-15 01:01:51,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:01:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2019-10-15 01:01:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 01:01:51,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:51,477 INFO L380 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-15 01:01:51,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:01:51,682 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:51,683 INFO L82 PathProgramCache]: Analyzing trace with hash -676604102, now seen corresponding path program 1 times [2019-10-15 01:01:51,683 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:51,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605906903] [2019-10-15 01:01:51,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:51,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:51,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:51,978 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-15 01:01:51,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605906903] [2019-10-15 01:01:51,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487334293] [2019-10-15 01:01:51,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:01:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:52,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-15 01:01:52,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:01:52,254 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-15 01:01:52,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:52,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:52,268 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-15 01:01:52,269 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:52,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:52,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:01:52,276 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-10-15 01:01:52,327 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-15 01:01:52,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:52,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:52,344 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-15 01:01:52,345 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:52,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:52,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:01:52,351 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-10-15 01:01:52,553 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-15 01:01:52,553 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:01:53,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:01:53,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-10-15 01:01:53,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:53,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:53,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-10-15 01:01:53,050 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:53,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:53,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:01:53,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2019-10-15 01:01:53,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:01:53,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-10-15 01:01:53,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:53,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:53,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-10-15 01:01:53,249 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:53,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:53,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:01:53,258 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-10-15 01:01:53,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:01:53,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:01:53,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2019-10-15 01:01:53,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:53,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2019-10-15 01:01:53,473 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:53,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:53,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-10-15 01:01:53,504 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:53,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-10-15 01:01:53,510 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:53,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:53,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-15 01:01:53,527 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:49 [2019-10-15 01:01:53,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:01:53,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:01:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-15 01:01:53,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:01:53,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14, 10] total 28 [2019-10-15 01:01:53,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167393976] [2019-10-15 01:01:53,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:01:53,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:01:53,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:01:53,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2019-10-15 01:01:53,639 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand 10 states. [2019-10-15 01:01:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:01:55,205 INFO L93 Difference]: Finished difference Result 326 states and 390 transitions. [2019-10-15 01:01:55,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-15 01:01:55,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-15 01:01:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:01:55,210 INFO L225 Difference]: With dead ends: 326 [2019-10-15 01:01:55,210 INFO L226 Difference]: Without dead ends: 206 [2019-10-15 01:01:55,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=365, Invalid=1357, Unknown=0, NotChecked=0, Total=1722 [2019-10-15 01:01:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-15 01:01:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 149. [2019-10-15 01:01:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-15 01:01:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-10-15 01:01:55,263 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 78 [2019-10-15 01:01:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:01:55,265 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-10-15 01:01:55,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:01:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-10-15 01:01:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-15 01:01:55,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:55,268 INFO L380 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-15 01:01:55,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:01:55,478 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:55,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:55,479 INFO L82 PathProgramCache]: Analyzing trace with hash 541030350, now seen corresponding path program 1 times [2019-10-15 01:01:55,479 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:55,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982607190] [2019-10-15 01:01:55,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:55,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:55,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:56,300 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-10-15 01:01:57,219 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-15 01:01:57,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982607190] [2019-10-15 01:01:57,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059877223] [2019-10-15 01:01:57,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:01:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:57,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 132 conjunts are in the unsatisfiable core [2019-10-15 01:01:57,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:01:57,501 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-15 01:01:57,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:57,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:57,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:01:57,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2019-10-15 01:01:57,807 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:57,808 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-15 01:01:57,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:57,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:57,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:01:57,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-10-15 01:01:57,940 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-15 01:01:57,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:57,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:01:57,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:01:57,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-10-15 01:01:58,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:01:58,635 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-10-15 01:01:58,636 INFO L341 Elim1Store]: treesize reduction 100, result has 50.2 percent of original size [2019-10-15 01:01:58,636 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-15 01:01:58,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:01:58,809 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-10-15 01:01:58,809 INFO L567 ElimStorePlain]: treesize reduction 36, result has 81.2 percent of original size [2019-10-15 01:01:58,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:01:58,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:01:58,812 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-15 01:01:58,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:161, output treesize:155 [2019-10-15 01:01:58,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:01:58,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:01:59,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:01:59,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:01:59,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:01:59,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:02:01,845 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-10-15 01:02:01,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:02:16,677 WARN L191 SmtUtils]: Spent 7.45 s on a formula simplification that was a NOOP. DAG size: 155 [2019-10-15 01:02:29,430 WARN L191 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 153 DAG size of output: 104 [2019-10-15 01:02:29,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:02:29,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:29,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:29,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:29,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:29,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:29,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:29,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:29,609 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 01:02:29,724 INFO L341 Elim1Store]: treesize reduction 70, result has 38.6 percent of original size [2019-10-15 01:02:29,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 332 treesize of output 137 [2019-10-15 01:02:29,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:02:29,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:29,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:29,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:29,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:29,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:30,059 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-10-15 01:02:30,060 INFO L341 Elim1Store]: treesize reduction 148, result has 55.2 percent of original size [2019-10-15 01:02:30,060 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-15 01:02:30,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:02:30,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:30,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:30,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:30,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:30,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:30,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:30,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:02:30,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 01:02:30,172 INFO L341 Elim1Store]: treesize reduction 17, result has 85.1 percent of original size [2019-10-15 01:02:30,173 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-15 01:02:30,174 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 01:02:30,279 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 40 [2019-10-15 01:02:30,279 INFO L567 ElimStorePlain]: treesize reduction 501, result has 17.7 percent of original size [2019-10-15 01:02:30,280 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-15 01:02:30,281 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:1464, output treesize:130 [2019-10-15 01:02:31,974 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-15 01:02:31,975 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:02:33,528 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-15 01:02:33,925 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-15 01:02:34,045 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-10-15 01:02:34,183 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-15 01:02:34,317 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-10-15 01:02:34,444 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-15 01:02:34,631 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-15 01:02:34,736 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 59