java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:59:58,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:59:58,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:59:58,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:59:58,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:59:58,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:59:58,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:59:58,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:59:58,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:59:58,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:59:58,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:59:58,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:59:58,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:59:58,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:59:58,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:59:58,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:59:58,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:59:58,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:59:58,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:59:58,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:59:58,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:59:58,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:59:58,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:59:58,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:59:58,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:59:58,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:59:58,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:59:58,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:59:58,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:59:58,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:59:58,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:59:58,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:59:58,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:59:58,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:59:58,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:59:58,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:59:58,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:59:58,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:59:58,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:59:58,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:59:58,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:59:58,095 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:59:58,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:59:58,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:59:58,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:59:58,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:59:58,110 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:59:58,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:59:58,111 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:59:58,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:59:58,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:59:58,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:59:58,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:59:58,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:59:58,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:59:58,112 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:59:58,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:59:58,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:59:58,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:59:58,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:59:58,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:59:58,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:59:58,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:59:58,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:59:58,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:59:58,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:59:58,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:59:58,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:59:58,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:59:58,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:59:58,115 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 01:59:58,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:59:58,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:59:58,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:59:58,413 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:59:58,413 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:59:58,414 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2019-10-15 01:59:58,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35529af7b/546558fa4aa04a278b3b399d225c4499/FLAGb7fd1654d [2019-10-15 01:59:59,034 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:59:59,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2019-10-15 01:59:59,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35529af7b/546558fa4aa04a278b3b399d225c4499/FLAGb7fd1654d [2019-10-15 01:59:59,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35529af7b/546558fa4aa04a278b3b399d225c4499 [2019-10-15 01:59:59,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:59:59,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:59:59,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:59:59,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:59:59,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:59:59,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:59:59" (1/1) ... [2019-10-15 01:59:59,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48406581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:59:59, skipping insertion in model container [2019-10-15 01:59:59,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:59:59" (1/1) ... [2019-10-15 01:59:59,342 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:59:59,397 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:59:59,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:59:59,890 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:59:59,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:00:00,014 INFO L192 MainTranslator]: Completed translation [2019-10-15 02:00:00,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:00:00 WrapperNode [2019-10-15 02:00:00,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 02:00:00,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 02:00:00,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 02:00:00,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 02:00:00,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:00:00" (1/1) ... [2019-10-15 02:00:00,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:00:00" (1/1) ... [2019-10-15 02:00:00,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:00:00" (1/1) ... [2019-10-15 02:00:00,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:00:00" (1/1) ... [2019-10-15 02:00:00,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:00:00" (1/1) ... [2019-10-15 02:00:00,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:00:00" (1/1) ... [2019-10-15 02:00:00,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:00:00" (1/1) ... [2019-10-15 02:00:00,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 02:00:00,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 02:00:00,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 02:00:00,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 02:00:00,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:00:00" (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 02:00:00,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 02:00:00,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 02:00:00,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-15 02:00:00,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-15 02:00:00,168 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-10-15 02:00:00,169 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-10-15 02:00:00,170 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-10-15 02:00:00,171 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-10-15 02:00:00,172 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-10-15 02:00:00,172 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-10-15 02:00:00,172 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 02:00:00,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 02:00:00,173 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-15 02:00:00,173 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-15 02:00:00,174 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 02:00:00,174 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 02:00:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 02:00:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 02:00:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 02:00:00,177 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 02:00:00,177 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 02:00:00,177 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 02:00:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 02:00:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 02:00:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 02:00:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 02:00:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 02:00:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 02:00:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 02:00:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 02:00:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 02:00:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 02:00:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 02:00:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 02:00:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 02:00:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 02:00:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 02:00:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 02:00:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 02:00:00,183 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 02:00:00,183 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 02:00:00,183 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 02:00:00,183 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 02:00:00,184 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 02:00:00,184 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 02:00:00,184 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 02:00:00,184 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 02:00:00,184 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 02:00:00,184 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 02:00:00,184 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 02:00:00,185 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 02:00:00,185 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 02:00:00,185 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 02:00:00,185 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 02:00:00,185 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 02:00:00,185 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 02:00:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 02:00:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 02:00:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 02:00:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 02:00:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 02:00:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 02:00:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 02:00:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 02:00:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 02:00:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 02:00:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 02:00:00,188 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 02:00:00,188 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 02:00:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 02:00:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 02:00:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 02:00:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 02:00:00,190 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 02:00:00,190 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 02:00:00,190 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 02:00:00,191 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 02:00:00,191 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 02:00:00,191 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 02:00:00,191 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 02:00:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 02:00:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 02:00:00,193 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 02:00:00,193 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 02:00:00,193 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 02:00:00,193 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 02:00:00,193 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 02:00:00,194 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 02:00:00,194 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 02:00:00,194 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 02:00:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 02:00:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 02:00:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 02:00:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 02:00:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 02:00:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 02:00:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 02:00:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 02:00:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 02:00:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 02:00:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 02:00:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 02:00:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 02:00:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 02:00:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 02:00:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 02:00:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 02:00:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 02:00:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 02:00:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 02:00:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 02:00:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 02:00:00,198 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 02:00:00,198 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 02:00:00,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 02:00:00,198 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-10-15 02:00:00,199 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-10-15 02:00:00,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 02:00:00,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 02:00:00,199 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-10-15 02:00:00,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 02:00:00,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 02:00:00,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 02:00:00,200 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-10-15 02:00:00,200 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-10-15 02:00:00,200 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-10-15 02:00:00,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 02:00:00,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 02:00:00,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 02:00:00,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 02:00:00,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 02:00:01,248 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 02:00:01,249 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-10-15 02:00:01,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:00:01 BoogieIcfgContainer [2019-10-15 02:00:01,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 02:00:01,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 02:00:01,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 02:00:01,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 02:00:01,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:59:59" (1/3) ... [2019-10-15 02:00:01,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6379f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:00:01, skipping insertion in model container [2019-10-15 02:00:01,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:00:00" (2/3) ... [2019-10-15 02:00:01,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6379f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:00:01, skipping insertion in model container [2019-10-15 02:00:01,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:00:01" (3/3) ... [2019-10-15 02:00:01,261 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2019-10-15 02:00:01,271 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 02:00:01,280 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 02:00:01,292 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 02:00:01,316 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 02:00:01,317 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 02:00:01,317 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 02:00:01,317 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 02:00:01,317 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 02:00:01,317 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 02:00:01,318 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 02:00:01,318 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 02:00:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2019-10-15 02:00:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 02:00:01,344 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:01,345 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:01,347 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:01,353 INFO L82 PathProgramCache]: Analyzing trace with hash 191183800, now seen corresponding path program 1 times [2019-10-15 02:00:01,362 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:01,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321102428] [2019-10-15 02:00:01,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:01,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:01,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:01,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321102428] [2019-10-15 02:00:01,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:01,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 02:00:01,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341025744] [2019-10-15 02:00:01,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 02:00:01,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:01,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 02:00:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 02:00:01,520 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 2 states. [2019-10-15 02:00:01,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:01,559 INFO L93 Difference]: Finished difference Result 192 states and 327 transitions. [2019-10-15 02:00:01,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 02:00:01,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-15 02:00:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:01,573 INFO L225 Difference]: With dead ends: 192 [2019-10-15 02:00:01,573 INFO L226 Difference]: Without dead ends: 90 [2019-10-15 02:00:01,578 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 02:00:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-15 02:00:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-10-15 02:00:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-15 02:00:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-10-15 02:00:01,627 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 12 [2019-10-15 02:00:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:01,628 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-10-15 02:00:01,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 02:00:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-10-15 02:00:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 02:00:01,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:01,629 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:01,630 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:01,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:01,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1730894082, now seen corresponding path program 1 times [2019-10-15 02:00:01,630 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:01,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470829673] [2019-10-15 02:00:01,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:01,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:01,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:01,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470829673] [2019-10-15 02:00:01,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:01,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:00:01,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394639500] [2019-10-15 02:00:01,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:00:01,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:01,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:00:01,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:00:01,702 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 3 states. [2019-10-15 02:00:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:01,742 INFO L93 Difference]: Finished difference Result 175 states and 215 transitions. [2019-10-15 02:00:01,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:00:01,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-15 02:00:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:01,744 INFO L225 Difference]: With dead ends: 175 [2019-10-15 02:00:01,744 INFO L226 Difference]: Without dead ends: 92 [2019-10-15 02:00:01,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:00:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-15 02:00:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-15 02:00:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-15 02:00:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-10-15 02:00:01,759 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 13 [2019-10-15 02:00:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:01,760 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-10-15 02:00:01,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:00:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2019-10-15 02:00:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 02:00:01,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:01,761 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:01,761 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:01,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:01,762 INFO L82 PathProgramCache]: Analyzing trace with hash -677984875, now seen corresponding path program 1 times [2019-10-15 02:00:01,762 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:01,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427103112] [2019-10-15 02:00:01,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:01,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:01,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:01,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427103112] [2019-10-15 02:00:01,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:01,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 02:00:01,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642802834] [2019-10-15 02:00:01,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 02:00:01,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:01,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 02:00:01,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:00:01,877 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand 5 states. [2019-10-15 02:00:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:02,034 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2019-10-15 02:00:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 02:00:02,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-15 02:00:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:02,037 INFO L225 Difference]: With dead ends: 134 [2019-10-15 02:00:02,037 INFO L226 Difference]: Without dead ends: 129 [2019-10-15 02:00:02,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:00:02,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-15 02:00:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2019-10-15 02:00:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-15 02:00:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-10-15 02:00:02,058 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 15 [2019-10-15 02:00:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:02,058 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-10-15 02:00:02,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 02:00:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-10-15 02:00:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 02:00:02,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:02,060 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:02,060 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:02,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1566408483, now seen corresponding path program 1 times [2019-10-15 02:00:02,061 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:02,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029976889] [2019-10-15 02:00:02,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:02,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:02,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 02:00:02,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029976889] [2019-10-15 02:00:02,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:02,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 02:00:02,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419306174] [2019-10-15 02:00:02,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 02:00:02,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:02,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 02:00:02,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:00:02,169 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 5 states. [2019-10-15 02:00:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:02,374 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2019-10-15 02:00:02,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 02:00:02,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-15 02:00:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:02,376 INFO L225 Difference]: With dead ends: 97 [2019-10-15 02:00:02,377 INFO L226 Difference]: Without dead ends: 94 [2019-10-15 02:00:02,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:00:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-15 02:00:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-10-15 02:00:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-15 02:00:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-10-15 02:00:02,389 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 22 [2019-10-15 02:00:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:02,389 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-10-15 02:00:02,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 02:00:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-10-15 02:00:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 02:00:02,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:02,391 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:02,391 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1891824473, now seen corresponding path program 1 times [2019-10-15 02:00:02,392 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:02,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004356267] [2019-10-15 02:00:02,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:02,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:02,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 02:00:02,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004356267] [2019-10-15 02:00:02,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:02,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 02:00:02,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918593935] [2019-10-15 02:00:02,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 02:00:02,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:02,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 02:00:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:00:02,523 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 5 states. [2019-10-15 02:00:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:02,692 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2019-10-15 02:00:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 02:00:02,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-15 02:00:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:02,694 INFO L225 Difference]: With dead ends: 96 [2019-10-15 02:00:02,694 INFO L226 Difference]: Without dead ends: 93 [2019-10-15 02:00:02,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:00:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-15 02:00:02,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-10-15 02:00:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-15 02:00:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2019-10-15 02:00:02,706 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 22 [2019-10-15 02:00:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:02,707 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2019-10-15 02:00:02,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 02:00:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2019-10-15 02:00:02,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 02:00:02,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:02,736 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:02,736 INFO L410 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:02,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:02,737 INFO L82 PathProgramCache]: Analyzing trace with hash -231635343, now seen corresponding path program 1 times [2019-10-15 02:00:02,737 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:02,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992178603] [2019-10-15 02:00:02,738 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:02,738 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:02,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:02,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992178603] [2019-10-15 02:00:02,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:02,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 02:00:02,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331844941] [2019-10-15 02:00:02,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 02:00:02,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:02,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 02:00:02,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:00:02,829 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 6 states. [2019-10-15 02:00:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:03,069 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2019-10-15 02:00:03,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 02:00:03,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-15 02:00:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:03,074 INFO L225 Difference]: With dead ends: 126 [2019-10-15 02:00:03,074 INFO L226 Difference]: Without dead ends: 123 [2019-10-15 02:00:03,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:00:03,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-15 02:00:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 99. [2019-10-15 02:00:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-15 02:00:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-10-15 02:00:03,083 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 25 [2019-10-15 02:00:03,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:03,084 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-10-15 02:00:03,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 02:00:03,084 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-10-15 02:00:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 02:00:03,085 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:03,085 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:03,085 INFO L410 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:03,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:03,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1018571824, now seen corresponding path program 1 times [2019-10-15 02:00:03,086 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:03,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846424482] [2019-10-15 02:00:03,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:03,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:03,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:03,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846424482] [2019-10-15 02:00:03,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:03,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 02:00:03,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942681350] [2019-10-15 02:00:03,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 02:00:03,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:03,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 02:00:03,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:00:03,140 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 6 states. [2019-10-15 02:00:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:03,347 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2019-10-15 02:00:03,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 02:00:03,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-15 02:00:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:03,348 INFO L225 Difference]: With dead ends: 125 [2019-10-15 02:00:03,349 INFO L226 Difference]: Without dead ends: 122 [2019-10-15 02:00:03,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:00:03,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-15 02:00:03,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2019-10-15 02:00:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-15 02:00:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2019-10-15 02:00:03,357 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 25 [2019-10-15 02:00:03,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:03,357 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2019-10-15 02:00:03,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 02:00:03,357 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2019-10-15 02:00:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 02:00:03,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:03,358 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:03,359 INFO L410 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:03,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:03,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1202127690, now seen corresponding path program 1 times [2019-10-15 02:00:03,359 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:03,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360869797] [2019-10-15 02:00:03,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:03,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:03,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:03,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360869797] [2019-10-15 02:00:03,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:03,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 02:00:03,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033164492] [2019-10-15 02:00:03,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 02:00:03,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:03,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 02:00:03,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:00:03,445 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand 6 states. [2019-10-15 02:00:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:03,707 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2019-10-15 02:00:03,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 02:00:03,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-15 02:00:03,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:03,709 INFO L225 Difference]: With dead ends: 124 [2019-10-15 02:00:03,709 INFO L226 Difference]: Without dead ends: 121 [2019-10-15 02:00:03,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:00:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-15 02:00:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 108. [2019-10-15 02:00:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-15 02:00:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2019-10-15 02:00:03,718 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 28 [2019-10-15 02:00:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:03,719 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2019-10-15 02:00:03,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 02:00:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2019-10-15 02:00:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 02:00:03,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:03,720 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:03,720 INFO L410 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash -551441676, now seen corresponding path program 1 times [2019-10-15 02:00:03,721 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:03,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570905812] [2019-10-15 02:00:03,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:03,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:03,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:03,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570905812] [2019-10-15 02:00:03,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:03,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 02:00:03,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332882112] [2019-10-15 02:00:03,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 02:00:03,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:03,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 02:00:03,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:00:03,856 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 6 states. [2019-10-15 02:00:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:04,129 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2019-10-15 02:00:04,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 02:00:04,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-15 02:00:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:04,132 INFO L225 Difference]: With dead ends: 123 [2019-10-15 02:00:04,132 INFO L226 Difference]: Without dead ends: 120 [2019-10-15 02:00:04,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:00:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-15 02:00:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2019-10-15 02:00:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-15 02:00:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2019-10-15 02:00:04,139 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 28 [2019-10-15 02:00:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:04,140 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2019-10-15 02:00:04,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 02:00:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2019-10-15 02:00:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 02:00:04,141 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:04,141 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, 1, 1, 1] [2019-10-15 02:00:04,142 INFO L410 AbstractCegarLoop]: === Iteration 10 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:04,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:04,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1639587553, now seen corresponding path program 1 times [2019-10-15 02:00:04,142 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:04,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223816723] [2019-10-15 02:00:04,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:04,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:04,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 02:00:04,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223816723] [2019-10-15 02:00:04,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918669753] [2019-10-15 02:00:04,198 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 02:00:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:04,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-15 02:00:04,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:00:04,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:00:04,379 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 29 treesize of output 17 [2019-10-15 02:00:04,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:04,386 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 29 treesize of output 23 [2019-10-15 02:00:04,387 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:04,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:04,410 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 14 treesize of output 8 [2019-10-15 02:00:04,410 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:04,413 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 20 treesize of output 8 [2019-10-15 02:00:04,413 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 02:00:04,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 02:00:04,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-15 02:00:04,420 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:9 [2019-10-15 02:00:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 02:00:04,428 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 02:00:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 02:00:04,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2108888978] [2019-10-15 02:00:04,510 INFO L162 IcfgInterpreter]: Started Sifa with 30 locations of interest [2019-10-15 02:00:04,510 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 02:00:04,516 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 02:00:04,524 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 02:00:04,525 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 02:00:04,638 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 02:00:16,189 INFO L199 IcfgInterpreter]: Interpreting procedure inspect_before with input of size 8 for LOIs [2019-10-15 02:00:16,443 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 02:00:16,457 INFO L199 IcfgInterpreter]: Interpreting procedure fail with input of size 84 for LOIs [2019-10-15 02:00:16,469 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 02:00:16,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 02:00:16,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 5, 5] total 15 [2019-10-15 02:00:16,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563833453] [2019-10-15 02:00:16,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 02:00:16,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:16,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 02:00:16,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-15 02:00:16,763 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand 12 states. [2019-10-15 02:00:17,279 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-10-15 02:00:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:18,114 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2019-10-15 02:00:18,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 02:00:18,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-10-15 02:00:18,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:18,117 INFO L225 Difference]: With dead ends: 130 [2019-10-15 02:00:18,117 INFO L226 Difference]: Without dead ends: 127 [2019-10-15 02:00:18,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2019-10-15 02:00:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-15 02:00:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2019-10-15 02:00:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-15 02:00:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2019-10-15 02:00:18,130 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 33 [2019-10-15 02:00:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:18,130 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2019-10-15 02:00:18,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 02:00:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2019-10-15 02:00:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 02:00:18,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:18,132 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 02:00:18,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:00:18,338 INFO L410 AbstractCegarLoop]: === Iteration 11 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:18,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:18,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1639596450, now seen corresponding path program 1 times [2019-10-15 02:00:18,339 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:18,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662425804] [2019-10-15 02:00:18,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:18,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:18,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 02:00:18,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662425804] [2019-10-15 02:00:18,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54499206] [2019-10-15 02:00:18,433 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 02:00:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:18,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-15 02:00:18,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:00:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 02:00:18,596 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 02:00:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 02:00:18,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [231051445] [2019-10-15 02:00:18,628 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-15 02:00:18,628 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 02:00:18,629 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 02:00:18,629 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 02:00:18,630 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 02:00:18,654 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 02:00:25,551 INFO L199 IcfgInterpreter]: Interpreting procedure inspect_before with input of size 8 for LOIs [2019-10-15 02:00:25,699 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 02:00:25,702 INFO L199 IcfgInterpreter]: Interpreting procedure fail with input of size 1 for LOIs [2019-10-15 02:00:25,705 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 02:00:26,017 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 02:00:26,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 12] total 16 [2019-10-15 02:00:26,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264696032] [2019-10-15 02:00:26,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-15 02:00:26,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:26,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-15 02:00:26,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 02:00:26,020 INFO L87 Difference]: Start difference. First operand 110 states and 127 transitions. Second operand 16 states. [2019-10-15 02:00:26,829 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-10-15 02:00:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:27,900 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2019-10-15 02:00:27,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 02:00:27,901 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-10-15 02:00:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:27,902 INFO L225 Difference]: With dead ends: 129 [2019-10-15 02:00:27,902 INFO L226 Difference]: Without dead ends: 126 [2019-10-15 02:00:27,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-10-15 02:00:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-15 02:00:27,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2019-10-15 02:00:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-15 02:00:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2019-10-15 02:00:27,913 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 33 [2019-10-15 02:00:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:27,914 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2019-10-15 02:00:27,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-15 02:00:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2019-10-15 02:00:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 02:00:27,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:27,915 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:28,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:00:28,121 INFO L410 AbstractCegarLoop]: === Iteration 12 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:28,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:28,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2140628394, now seen corresponding path program 1 times [2019-10-15 02:00:28,122 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:28,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573000645] [2019-10-15 02:00:28,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:28,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:28,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:28,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573000645] [2019-10-15 02:00:28,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:00:28,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 02:00:28,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633366072] [2019-10-15 02:00:28,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 02:00:28,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:28,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 02:00:28,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:00:28,165 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand 5 states. [2019-10-15 02:00:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:28,222 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2019-10-15 02:00:28,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 02:00:28,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-10-15 02:00:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:28,224 INFO L225 Difference]: With dead ends: 134 [2019-10-15 02:00:28,224 INFO L226 Difference]: Without dead ends: 131 [2019-10-15 02:00:28,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:00:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-15 02:00:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2019-10-15 02:00:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-15 02:00:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2019-10-15 02:00:28,233 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 36 [2019-10-15 02:00:28,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:28,234 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2019-10-15 02:00:28,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 02:00:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2019-10-15 02:00:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 02:00:28,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:28,235 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:28,235 INFO L410 AbstractCegarLoop]: === Iteration 13 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:28,236 INFO L82 PathProgramCache]: Analyzing trace with hash 82771553, now seen corresponding path program 1 times [2019-10-15 02:00:28,236 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:28,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293052857] [2019-10-15 02:00:28,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:28,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:28,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:28,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293052857] [2019-10-15 02:00:28,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395542458] [2019-10-15 02:00:28,426 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 02:00:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:28,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-15 02:00:28,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:00:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:28,651 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 02:00:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 02:00:28,742 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 02:00:28,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [7] total 13 [2019-10-15 02:00:28,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978381347] [2019-10-15 02:00:28,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 02:00:28,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:00:28,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 02:00:28,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-10-15 02:00:28,744 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 12 states. [2019-10-15 02:00:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:00:29,302 INFO L93 Difference]: Finished difference Result 132 states and 152 transitions. [2019-10-15 02:00:29,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 02:00:29,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-10-15 02:00:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:00:29,304 INFO L225 Difference]: With dead ends: 132 [2019-10-15 02:00:29,305 INFO L226 Difference]: Without dead ends: 129 [2019-10-15 02:00:29,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-15 02:00:29,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-15 02:00:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2019-10-15 02:00:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-15 02:00:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2019-10-15 02:00:29,314 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 39 [2019-10-15 02:00:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:00:29,314 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2019-10-15 02:00:29,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 02:00:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2019-10-15 02:00:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 02:00:29,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:00:29,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:00:29,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:00:29,520 INFO L410 AbstractCegarLoop]: === Iteration 14 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:00:29,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:00:29,520 INFO L82 PathProgramCache]: Analyzing trace with hash -14144212, now seen corresponding path program 1 times [2019-10-15 02:00:29,520 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:00:29,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306265488] [2019-10-15 02:00:29,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:29,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:00:29,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:00:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:29,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306265488] [2019-10-15 02:00:29,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80097462] [2019-10-15 02:00:29,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:00:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:00:29,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-15 02:00:29,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:00:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:29,968 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 02:00:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:00:30,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2067976300] [2019-10-15 02:00:30,043 INFO L162 IcfgInterpreter]: Started Sifa with 36 locations of interest [2019-10-15 02:00:30,043 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 02:00:30,044 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 02:00:30,044 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 02:00:30,044 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 02:00:30,073 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs