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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:28:50,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:28:50,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:28:50,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:28:50,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:28:50,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:28:50,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:28:50,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:28:50,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:28:50,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:28:50,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:28:50,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:28:50,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:28:50,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:28:50,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:28:50,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:28:50,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:28:50,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:28:50,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:28:50,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:28:50,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:28:50,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:28:50,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:28:50,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:28:50,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:28:50,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:28:50,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:28:50,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:28:50,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:28:50,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:28:50,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:28:50,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:28:50,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:28:50,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:28:50,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:28:50,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:28:50,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:28:50,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:28:50,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:28:50,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:28:50,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:28:50,087 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:28:50,109 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:28:50,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:28:50,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:28:50,111 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:28:50,112 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:28:50,112 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:28:50,112 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:28:50,113 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:28:50,113 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:28:50,113 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:28:50,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:28:50,115 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:28:50,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:28:50,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:28:50,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:28:50,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:28:50,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:28:50,116 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:28:50,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:28:50,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:28:50,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:28:50,117 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:28:50,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:28:50,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:28:50,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:28:50,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:28:50,119 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:28:50,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:28:50,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:28:50,119 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:28:50,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:28:50,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:28:50,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:28:50,182 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:28:50,182 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:28:50,183 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-09-20 13:28:50,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df609a18f/26f57fba572c4809a17af757aef9162b/FLAG900fc8c19 [2019-09-20 13:28:50,791 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:28:50,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-09-20 13:28:50,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df609a18f/26f57fba572c4809a17af757aef9162b/FLAG900fc8c19 [2019-09-20 13:28:51,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df609a18f/26f57fba572c4809a17af757aef9162b [2019-09-20 13:28:51,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:28:51,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:28:51,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:51,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:28:51,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:28:51,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:28:51" (1/1) ... [2019-09-20 13:28:51,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ac9f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:51, skipping insertion in model container [2019-09-20 13:28:51,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:28:51" (1/1) ... [2019-09-20 13:28:51,116 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:28:51,160 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:28:51,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:51,661 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:28:51,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:51,788 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:28:51,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:51 WrapperNode [2019-09-20 13:28:51,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:51,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:28:51,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:28:51,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:28:51,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:51" (1/1) ... [2019-09-20 13:28:51,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:51" (1/1) ... [2019-09-20 13:28:51,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:51" (1/1) ... [2019-09-20 13:28:51,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:51" (1/1) ... [2019-09-20 13:28:51,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:51" (1/1) ... [2019-09-20 13:28:51,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:51" (1/1) ... [2019-09-20 13:28:51,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:51" (1/1) ... [2019-09-20 13:28:51,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:28:51,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:28:51,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:28:51,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:28:51,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:51" (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-09-20 13:28:51,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:28:51,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:28:51,946 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:28:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:28:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:28:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:28:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:28:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:28:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:28:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:28:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:28:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:28:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:28:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:28:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:28:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:28:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:28:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:28:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:28:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:28:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:28:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:28:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:28:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:28:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:28:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:28:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:28:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:28:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:28:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:28:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:28:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:28:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:28:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:28:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:28:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:28:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:28:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:28:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:28:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:28:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:28:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:28:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:28:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:28:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:28:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:28:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:28:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:28:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:28:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:28:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:28:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:28:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:28:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:28:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:28:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:28:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:28:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:28:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:28:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:28:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:28:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:28:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:28:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:28:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:28:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:28:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:28:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:28:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:28:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:28:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:28:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:28:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:28:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:28:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:28:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:28:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:28:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:28:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:28:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:28:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:28:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:28:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:28:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:28:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:28:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:28:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:28:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:28:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:28:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:28:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:28:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:28:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:28:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:28:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:28:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:28:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:28:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:28:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:28:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:28:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:28:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:28:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:28:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:28:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:28:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:28:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:28:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:28:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:28:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:28:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:28:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:28:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:28:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:28:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:28:52,727 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:28:52,728 INFO L283 CfgBuilder]: Removed 30 assume(true) statements. [2019-09-20 13:28:52,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:28:52 BoogieIcfgContainer [2019-09-20 13:28:52,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:28:52,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:28:52,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:28:52,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:28:52,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:28:51" (1/3) ... [2019-09-20 13:28:52,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1571491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:28:52, skipping insertion in model container [2019-09-20 13:28:52,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:51" (2/3) ... [2019-09-20 13:28:52,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1571491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:28:52, skipping insertion in model container [2019-09-20 13:28:52,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:28:52" (3/3) ... [2019-09-20 13:28:52,740 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2019-09-20 13:28:52,751 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:28:52,759 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-09-20 13:28:52,772 INFO L252 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-09-20 13:28:52,796 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:28:52,796 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:28:52,797 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:28:52,797 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:28:52,797 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:28:52,797 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:28:52,798 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:28:52,798 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:28:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-09-20 13:28:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-09-20 13:28:52,835 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:52,837 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:52,849 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:52,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:52,855 INFO L82 PathProgramCache]: Analyzing trace with hash -22945038, now seen corresponding path program 1 times [2019-09-20 13:28:52,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:52,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:52,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:52,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:52,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:53,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:53,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:53,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:53,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:53,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:53,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:53,134 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-09-20 13:28:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:53,218 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2019-09-20 13:28:53,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:53,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-09-20 13:28:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:53,237 INFO L225 Difference]: With dead ends: 90 [2019-09-20 13:28:53,237 INFO L226 Difference]: Without dead ends: 85 [2019-09-20 13:28:53,241 INFO L636 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-09-20 13:28:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-20 13:28:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2019-09-20 13:28:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-20 13:28:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2019-09-20 13:28:53,298 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 8 [2019-09-20 13:28:53,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:53,299 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2019-09-20 13:28:53,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2019-09-20 13:28:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-20 13:28:53,300 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:53,300 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:53,301 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:53,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash 902725328, now seen corresponding path program 1 times [2019-09-20 13:28:53,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:53,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:53,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:53,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:53,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:53,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:53,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:53,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:53,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:53,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:53,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:53,429 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 4 states. [2019-09-20 13:28:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:53,598 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2019-09-20 13:28:53,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:53,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-20 13:28:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:53,601 INFO L225 Difference]: With dead ends: 117 [2019-09-20 13:28:53,602 INFO L226 Difference]: Without dead ends: 117 [2019-09-20 13:28:53,602 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-20 13:28:53,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 72. [2019-09-20 13:28:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-20 13:28:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-09-20 13:28:53,613 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 13 [2019-09-20 13:28:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:53,613 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-09-20 13:28:53,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-09-20 13:28:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-20 13:28:53,614 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:53,615 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:53,615 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:53,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash 902727250, now seen corresponding path program 1 times [2019-09-20 13:28:53,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:53,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:53,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:53,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:53,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:53,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:53,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:53,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:53,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:53,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:53,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:53,683 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 4 states. [2019-09-20 13:28:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:53,810 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2019-09-20 13:28:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:28:53,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-20 13:28:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:53,812 INFO L225 Difference]: With dead ends: 116 [2019-09-20 13:28:53,812 INFO L226 Difference]: Without dead ends: 116 [2019-09-20 13:28:53,812 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-20 13:28:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2019-09-20 13:28:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-20 13:28:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-09-20 13:28:53,819 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 13 [2019-09-20 13:28:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:53,820 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-09-20 13:28:53,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-09-20 13:28:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-20 13:28:53,821 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:53,821 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:53,821 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash 904574292, now seen corresponding path program 1 times [2019-09-20 13:28:53,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:53,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:53,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:53,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:53,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:53,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:53,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:53,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:53,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:53,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:53,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:53,905 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 4 states. [2019-09-20 13:28:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:53,985 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2019-09-20 13:28:53,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:53,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-20 13:28:53,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:53,987 INFO L225 Difference]: With dead ends: 71 [2019-09-20 13:28:53,987 INFO L226 Difference]: Without dead ends: 71 [2019-09-20 13:28:53,987 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-20 13:28:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-20 13:28:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-20 13:28:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2019-09-20 13:28:54,000 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 13 [2019-09-20 13:28:54,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:54,000 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2019-09-20 13:28:54,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2019-09-20 13:28:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:28:54,003 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:54,003 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:54,003 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:54,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:54,004 INFO L82 PathProgramCache]: Analyzing trace with hash 443005780, now seen corresponding path program 1 times [2019-09-20 13:28:54,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:54,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:54,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:54,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:54,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:54,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:54,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:54,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:54,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:54,073 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 3 states. [2019-09-20 13:28:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:54,117 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2019-09-20 13:28:54,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:54,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:28:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:54,119 INFO L225 Difference]: With dead ends: 68 [2019-09-20 13:28:54,119 INFO L226 Difference]: Without dead ends: 68 [2019-09-20 13:28:54,120 INFO L636 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-09-20 13:28:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-20 13:28:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-09-20 13:28:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-20 13:28:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-09-20 13:28:54,128 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 17 [2019-09-20 13:28:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:54,129 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-09-20 13:28:54,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-09-20 13:28:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:28:54,130 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:54,130 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:54,131 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:54,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash 848281492, now seen corresponding path program 1 times [2019-09-20 13:28:54,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:54,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:54,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:54,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:54,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:54,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:54,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:28:54,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:54,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:28:54,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:28:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:54,200 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 5 states. [2019-09-20 13:28:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:54,298 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-09-20 13:28:54,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:54,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-20 13:28:54,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:54,300 INFO L225 Difference]: With dead ends: 97 [2019-09-20 13:28:54,300 INFO L226 Difference]: Without dead ends: 97 [2019-09-20 13:28:54,300 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:28:54,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-20 13:28:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 64. [2019-09-20 13:28:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-20 13:28:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2019-09-20 13:28:54,314 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 18 [2019-09-20 13:28:54,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:54,314 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2019-09-20 13:28:54,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:28:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2019-09-20 13:28:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:28:54,315 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:54,316 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:54,316 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:54,317 INFO L82 PathProgramCache]: Analyzing trace with hash -423078347, now seen corresponding path program 1 times [2019-09-20 13:28:54,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:54,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:54,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:54,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:54,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:54,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:54,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:54,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:54,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:54,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:54,385 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 3 states. [2019-09-20 13:28:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:54,398 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2019-09-20 13:28:54,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:54,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:28:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:54,399 INFO L225 Difference]: With dead ends: 84 [2019-09-20 13:28:54,399 INFO L226 Difference]: Without dead ends: 84 [2019-09-20 13:28:54,400 INFO L636 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-09-20 13:28:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-20 13:28:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-09-20 13:28:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-20 13:28:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-09-20 13:28:54,406 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 21 [2019-09-20 13:28:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:54,407 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-09-20 13:28:54,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-09-20 13:28:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:28:54,408 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:54,408 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:54,411 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:54,411 INFO L82 PathProgramCache]: Analyzing trace with hash -230531371, now seen corresponding path program 1 times [2019-09-20 13:28:54,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:54,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:54,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:54,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:54,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:54,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:54,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:54,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:54,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:54,493 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 3 states. [2019-09-20 13:28:54,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:54,508 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-09-20 13:28:54,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:54,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:28:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:54,510 INFO L225 Difference]: With dead ends: 65 [2019-09-20 13:28:54,510 INFO L226 Difference]: Without dead ends: 65 [2019-09-20 13:28:54,510 INFO L636 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-09-20 13:28:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-20 13:28:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-20 13:28:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-20 13:28:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-09-20 13:28:54,516 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 22 [2019-09-20 13:28:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:54,517 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-09-20 13:28:54,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-09-20 13:28:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:28:54,518 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:54,518 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:54,521 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:54,522 INFO L82 PathProgramCache]: Analyzing trace with hash -740876651, now seen corresponding path program 1 times [2019-09-20 13:28:54,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:54,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:54,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:54,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:54,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:54,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:54,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:54,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:54,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:54,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:54,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:54,592 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 4 states. [2019-09-20 13:28:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:54,671 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-09-20 13:28:54,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:54,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-09-20 13:28:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:54,673 INFO L225 Difference]: With dead ends: 64 [2019-09-20 13:28:54,673 INFO L226 Difference]: Without dead ends: 64 [2019-09-20 13:28:54,673 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-20 13:28:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-20 13:28:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-20 13:28:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-09-20 13:28:54,678 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 23 [2019-09-20 13:28:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:54,679 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-09-20 13:28:54,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-09-20 13:28:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:28:54,682 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:54,682 INFO L407 BasicCegarLoop]: trace histogram [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-09-20 13:28:54,683 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:54,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:54,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1797790752, now seen corresponding path program 1 times [2019-09-20 13:28:54,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:54,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:54,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:54,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:54,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:54,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:28:54,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:54,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:28:54,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:28:54,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:54,759 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 5 states. [2019-09-20 13:28:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:54,999 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2019-09-20 13:28:55,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:28:55,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-09-20 13:28:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:55,001 INFO L225 Difference]: With dead ends: 114 [2019-09-20 13:28:55,001 INFO L226 Difference]: Without dead ends: 114 [2019-09-20 13:28:55,001 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:28:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-20 13:28:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 71. [2019-09-20 13:28:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-20 13:28:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-09-20 13:28:55,005 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 24 [2019-09-20 13:28:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:55,006 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-09-20 13:28:55,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:28:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-09-20 13:28:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:28:55,007 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:55,007 INFO L407 BasicCegarLoop]: trace histogram [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-09-20 13:28:55,008 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:55,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1787839648, now seen corresponding path program 1 times [2019-09-20 13:28:55,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:55,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:55,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:55,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:55,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:55,249 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-09-20 13:28:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:55,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:55,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:28:55,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:55,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:28:55,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:28:55,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:28:55,455 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 10 states. [2019-09-20 13:28:56,307 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-20 13:28:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:56,678 INFO L93 Difference]: Finished difference Result 226 states and 256 transitions. [2019-09-20 13:28:56,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:28:56,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-20 13:28:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:56,680 INFO L225 Difference]: With dead ends: 226 [2019-09-20 13:28:56,680 INFO L226 Difference]: Without dead ends: 226 [2019-09-20 13:28:56,681 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:28:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-20 13:28:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 83. [2019-09-20 13:28:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-20 13:28:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-09-20 13:28:56,686 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 24 [2019-09-20 13:28:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:56,686 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-09-20 13:28:56,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:28:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-09-20 13:28:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:28:56,687 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:56,687 INFO L407 BasicCegarLoop]: trace histogram [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-09-20 13:28:56,688 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash 776722398, now seen corresponding path program 1 times [2019-09-20 13:28:56,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:56,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:56,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:56,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:56,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:28:56,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:56,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:28:56,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:28:56,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:56,737 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 5 states. [2019-09-20 13:28:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:56,887 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2019-09-20 13:28:56,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:28:56,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-09-20 13:28:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:56,894 INFO L225 Difference]: With dead ends: 135 [2019-09-20 13:28:56,895 INFO L226 Difference]: Without dead ends: 135 [2019-09-20 13:28:56,895 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:28:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-20 13:28:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 80. [2019-09-20 13:28:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-20 13:28:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2019-09-20 13:28:56,899 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 24 [2019-09-20 13:28:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:56,899 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2019-09-20 13:28:56,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:28:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2019-09-20 13:28:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:28:56,900 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:56,900 INFO L407 BasicCegarLoop]: trace histogram [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-09-20 13:28:56,901 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:56,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:56,901 INFO L82 PathProgramCache]: Analyzing trace with hash -766212324, now seen corresponding path program 1 times [2019-09-20 13:28:56,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:56,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:56,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:56,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:56,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:56,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:56,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:56,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:56,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:56,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:56,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:56,951 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 4 states. [2019-09-20 13:28:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:57,045 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2019-09-20 13:28:57,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:28:57,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-09-20 13:28:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:57,047 INFO L225 Difference]: With dead ends: 104 [2019-09-20 13:28:57,047 INFO L226 Difference]: Without dead ends: 104 [2019-09-20 13:28:57,047 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:57,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-20 13:28:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2019-09-20 13:28:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-20 13:28:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2019-09-20 13:28:57,051 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 26 [2019-09-20 13:28:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:57,052 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2019-09-20 13:28:57,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2019-09-20 13:28:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:28:57,053 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:57,053 INFO L407 BasicCegarLoop]: trace histogram [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-09-20 13:28:57,053 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:57,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:57,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1739288676, now seen corresponding path program 1 times [2019-09-20 13:28:57,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:57,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:57,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:57,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:57,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:57,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:57,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:57,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:57,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:57,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:57,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:57,085 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 3 states. [2019-09-20 13:28:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:57,115 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2019-09-20 13:28:57,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:57,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:28:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:57,116 INFO L225 Difference]: With dead ends: 94 [2019-09-20 13:28:57,116 INFO L226 Difference]: Without dead ends: 94 [2019-09-20 13:28:57,117 INFO L636 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-09-20 13:28:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-20 13:28:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-09-20 13:28:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-20 13:28:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-09-20 13:28:57,120 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 26 [2019-09-20 13:28:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:57,120 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-09-20 13:28:57,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-09-20 13:28:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:28:57,121 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:57,121 INFO L407 BasicCegarLoop]: trace histogram [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-09-20 13:28:57,122 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:57,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash 127122795, now seen corresponding path program 1 times [2019-09-20 13:28:57,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:57,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:57,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:57,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:57,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:57,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:57,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:28:57,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:57,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:28:57,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:28:57,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:28:57,310 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 9 states. [2019-09-20 13:28:57,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:57,905 INFO L93 Difference]: Finished difference Result 162 states and 189 transitions. [2019-09-20 13:28:57,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:28:57,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-09-20 13:28:57,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:57,907 INFO L225 Difference]: With dead ends: 162 [2019-09-20 13:28:57,907 INFO L226 Difference]: Without dead ends: 162 [2019-09-20 13:28:57,908 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:28:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-20 13:28:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 96. [2019-09-20 13:28:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-20 13:28:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2019-09-20 13:28:57,912 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 26 [2019-09-20 13:28:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:57,912 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2019-09-20 13:28:57,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:28:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2019-09-20 13:28:57,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:28:57,913 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:57,913 INFO L407 BasicCegarLoop]: trace histogram [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-09-20 13:28:57,914 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:57,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:57,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1457864297, now seen corresponding path program 1 times [2019-09-20 13:28:57,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:57,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:57,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:57,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:57,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:58,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:58,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:28:58,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:58,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:28:58,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:28:58,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:58,005 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 5 states. [2019-09-20 13:28:58,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:58,183 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2019-09-20 13:28:58,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:28:58,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-20 13:28:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:58,184 INFO L225 Difference]: With dead ends: 117 [2019-09-20 13:28:58,185 INFO L226 Difference]: Without dead ends: 117 [2019-09-20 13:28:58,185 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:28:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-20 13:28:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2019-09-20 13:28:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-20 13:28:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2019-09-20 13:28:58,188 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 28 [2019-09-20 13:28:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:58,189 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2019-09-20 13:28:58,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:28:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2019-09-20 13:28:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:28:58,190 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:58,190 INFO L407 BasicCegarLoop]: trace histogram [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-09-20 13:28:58,190 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:58,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:58,191 INFO L82 PathProgramCache]: Analyzing trace with hash -713997721, now seen corresponding path program 1 times [2019-09-20 13:28:58,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:58,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:58,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:58,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:58,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:58,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:58,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:28:58,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:58,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:28:58,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:28:58,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:28:58,397 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 8 states. [2019-09-20 13:28:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:58,684 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2019-09-20 13:28:58,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:28:58,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-09-20 13:28:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:58,686 INFO L225 Difference]: With dead ends: 133 [2019-09-20 13:28:58,686 INFO L226 Difference]: Without dead ends: 133 [2019-09-20 13:28:58,687 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:28:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-20 13:28:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2019-09-20 13:28:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-20 13:28:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2019-09-20 13:28:58,691 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2019-09-20 13:28:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:58,691 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2019-09-20 13:28:58,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:28:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2019-09-20 13:28:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:28:58,692 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:58,692 INFO L407 BasicCegarLoop]: trace histogram [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-09-20 13:28:58,693 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:58,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1038087272, now seen corresponding path program 1 times [2019-09-20 13:28:58,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:58,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:58,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:58,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:58,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:58,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:58,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:58,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:58,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:58,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:58,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:58,720 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 3 states. [2019-09-20 13:28:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:58,739 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2019-09-20 13:28:58,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:58,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:28:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:58,740 INFO L225 Difference]: With dead ends: 135 [2019-09-20 13:28:58,741 INFO L226 Difference]: Without dead ends: 135 [2019-09-20 13:28:58,741 INFO L636 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-09-20 13:28:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-20 13:28:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 113. [2019-09-20 13:28:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-20 13:28:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2019-09-20 13:28:58,745 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 29 [2019-09-20 13:28:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:58,747 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2019-09-20 13:28:58,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2019-09-20 13:28:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:28:58,748 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:58,748 INFO L407 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] [2019-09-20 13:28:58,748 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:58,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:58,749 INFO L82 PathProgramCache]: Analyzing trace with hash 584602460, now seen corresponding path program 1 times [2019-09-20 13:28:58,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:58,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:58,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:58,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:58,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:58,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:28:58,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:28:58,868 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-09-20 13:28:58,870 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [24], [30], [35], [43], [57], [60], [132], [142], [156], [165], [239], [259], [262], [272], [283], [286], [287], [319], [321], [327], [328], [351], [364], [368], [369], [370] [2019-09-20 13:28:58,917 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:28:58,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:28:59,011 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:28:59,012 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 17 root evaluator evaluations with a maximum evaluation depth of 0. Performed 17 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 40 variables. [2019-09-20 13:28:59,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:59,016 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:28:59,054 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-20 13:28:59,054 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:28:59,056 INFO L420 sIntCurrentIteration]: We unified 30 AI predicates to 30 [2019-09-20 13:28:59,056 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:28:59,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:28:59,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-20 13:28:59,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:59,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:28:59,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:28:59,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:28:59,058 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 2 states. [2019-09-20 13:28:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:59,059 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-20 13:28:59,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:28:59,059 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2019-09-20 13:28:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:59,060 INFO L225 Difference]: With dead ends: 6 [2019-09-20 13:28:59,060 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:28:59,060 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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-09-20 13:28:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:28:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:28:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:28:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:28:59,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-09-20 13:28:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:59,062 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:28:59,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:28:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:28:59,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:28:59,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:28:59 BoogieIcfgContainer [2019-09-20 13:28:59,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:28:59,070 INFO L168 Benchmark]: Toolchain (without parser) took 7968.54 ms. Allocated memory was 134.7 MB in the beginning and 318.8 MB in the end (delta: 184.0 MB). Free memory was 84.8 MB in the beginning and 82.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 186.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:59,071 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:28:59,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 689.46 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 84.6 MB in the beginning and 163.8 MB in the end (delta: -79.2 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:59,072 INFO L168 Benchmark]: Boogie Preprocessor took 95.32 ms. Allocated memory is still 199.2 MB. Free memory was 163.8 MB in the beginning and 160.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:59,073 INFO L168 Benchmark]: RCFGBuilder took 842.44 ms. Allocated memory is still 199.2 MB. Free memory was 160.5 MB in the beginning and 103.4 MB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:59,074 INFO L168 Benchmark]: TraceAbstraction took 6336.90 ms. Allocated memory was 199.2 MB in the beginning and 318.8 MB in the end (delta: 119.5 MB). Free memory was 102.8 MB in the beginning and 82.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 140.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:28:59,078 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 689.46 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 84.6 MB in the beginning and 163.8 MB in the end (delta: -79.2 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.32 ms. Allocated memory is still 199.2 MB. Free memory was 163.8 MB in the beginning and 160.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.44 ms. Allocated memory is still 199.2 MB. Free memory was 160.5 MB in the beginning and 103.4 MB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6336.90 ms. Allocated memory was 199.2 MB in the beginning and 318.8 MB in the end (delta: 119.5 MB). Free memory was 102.8 MB in the beginning and 82.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 140.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1005]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1025]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1041]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1005]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1004]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1029]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 993]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1042]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 993]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1026]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1024]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1043]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 88 locations, 13 error locations. SAFE Result, 6.2s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1158 SDtfs, 1656 SDslu, 1728 SDs, 0 SdLazy, 1146 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9666666666666667 AbsIntWeakeningRatio, 1.3333333333333333 AbsIntAvgWeakeningVarsNumRemoved, 0.2 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 551 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 68532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 3/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...