java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:11:52,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:11:52,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:11:52,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:11:52,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:11:52,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:11:52,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:11:52,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:11:52,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:11:53,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:11:53,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:11:53,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:11:53,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:11:53,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:11:53,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:11:53,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:11:53,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:11:53,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:11:53,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:11:53,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:11:53,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:11:53,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:11:53,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:11:53,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:11:53,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:11:53,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:11:53,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:11:53,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:11:53,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:11:53,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:11:53,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:11:53,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:11:53,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:11:53,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:11:53,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:11:53,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:11:53,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:11:53,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:11:53,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:11:53,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:11:53,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:11:53,027 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:11:53,041 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:11:53,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:11:53,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:11:53,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:11:53,043 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:11:53,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:11:53,043 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:11:53,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:11:53,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:11:53,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:11:53,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:11:53,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:11:53,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:11:53,046 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:11:53,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:11:53,046 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:11:53,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:11:53,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:11:53,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:11:53,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:11:53,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:11:53,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:11:53,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:11:53,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:11:53,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:11:53,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:11:53,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:11:53,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:11:53,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:11:53,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:11:53,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:11:53,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:11:53,382 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:11:53,383 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:11:53,383 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i [2019-10-13 19:11:53,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c19634d/cfc046adba8f43e9b7199d564f78c88d/FLAG8967a96a9 [2019-10-13 19:11:53,909 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:11:53,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i [2019-10-13 19:11:53,927 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c19634d/cfc046adba8f43e9b7199d564f78c88d/FLAG8967a96a9 [2019-10-13 19:11:54,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c19634d/cfc046adba8f43e9b7199d564f78c88d [2019-10-13 19:11:54,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:11:54,279 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:11:54,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:11:54,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:11:54,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:11:54,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:11:54" (1/1) ... [2019-10-13 19:11:54,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e270d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:54, skipping insertion in model container [2019-10-13 19:11:54,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:11:54" (1/1) ... [2019-10-13 19:11:54,299 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:11:54,350 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:11:54,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:11:54,826 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:11:54,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:11:54,949 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:11:54,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:54 WrapperNode [2019-10-13 19:11:54,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:11:54,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:11:54,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:11:54,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:11:54,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:54" (1/1) ... [2019-10-13 19:11:54,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:54" (1/1) ... [2019-10-13 19:11:54,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:54" (1/1) ... [2019-10-13 19:11:54,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:54" (1/1) ... [2019-10-13 19:11:55,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:54" (1/1) ... [2019-10-13 19:11:55,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:54" (1/1) ... [2019-10-13 19:11:55,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:54" (1/1) ... [2019-10-13 19:11:55,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:11:55,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:11:55,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:11:55,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:11:55,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:11:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:11:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:11:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 19:11:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 19:11:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-13 19:11:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-10-13 19:11:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:11:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:11:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 19:11:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 19:11:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 19:11:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 19:11:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 19:11:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 19:11:55,103 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 19:11:55,103 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 19:11:55,103 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 19:11:55,103 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 19:11:55,103 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 19:11:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 19:11:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 19:11:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 19:11:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 19:11:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 19:11:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 19:11:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 19:11:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 19:11:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 19:11:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 19:11:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 19:11:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 19:11:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 19:11:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 19:11:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 19:11:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 19:11:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 19:11:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 19:11:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 19:11:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 19:11:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 19:11:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 19:11:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 19:11:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 19:11:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 19:11:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 19:11:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 19:11:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 19:11:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 19:11:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 19:11:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 19:11:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 19:11:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 19:11:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 19:11:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 19:11:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 19:11:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 19:11:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 19:11:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 19:11:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 19:11:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 19:11:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 19:11:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 19:11:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 19:11:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 19:11:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 19:11:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 19:11:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 19:11:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 19:11:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 19:11:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 19:11:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 19:11:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 19:11:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 19:11:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 19:11:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 19:11:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 19:11:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 19:11:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 19:11:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 19:11:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 19:11:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 19:11:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 19:11:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 19:11:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 19:11:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 19:11:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 19:11:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 19:11:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 19:11:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 19:11:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 19:11:55,114 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 19:11:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 19:11:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 19:11:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 19:11:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 19:11:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 19:11:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 19:11:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 19:11:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 19:11:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 19:11:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 19:11:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 19:11:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 19:11:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 19:11:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 19:11:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 19:11:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 19:11:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 19:11:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 19:11:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 19:11:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 19:11:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 19:11:55,118 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 19:11:55,118 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-13 19:11:55,118 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-10-13 19:11:55,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 19:11:55,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 19:11:55,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 19:11:55,118 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:11:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 19:11:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 19:11:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 19:11:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:11:55,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:11:55,478 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-13 19:11:55,663 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:11:55,664 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 19:11:55,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:11:55 BoogieIcfgContainer [2019-10-13 19:11:55,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:11:55,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:11:55,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:11:55,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:11:55,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:11:54" (1/3) ... [2019-10-13 19:11:55,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a3898d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:11:55, skipping insertion in model container [2019-10-13 19:11:55,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:54" (2/3) ... [2019-10-13 19:11:55,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a3898d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:11:55, skipping insertion in model container [2019-10-13 19:11:55,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:11:55" (3/3) ... [2019-10-13 19:11:55,674 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2019-10-13 19:11:55,684 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:11:55,692 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:11:55,704 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:11:55,728 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:11:55,729 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:11:55,729 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:11:55,730 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:11:55,730 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:11:55,730 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:11:55,730 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:11:55,730 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:11:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-13 19:11:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:11:55,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:55,753 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:55,755 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:55,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1586150655, now seen corresponding path program 1 times [2019-10-13 19:11:55,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:55,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206766607] [2019-10-13 19:11:55,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:55,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:55,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:56,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206766607] [2019-10-13 19:11:56,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:11:56,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:11:56,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962191530] [2019-10-13 19:11:56,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:11:56,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:56,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:11:56,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:11:56,050 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 6 states. [2019-10-13 19:11:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:56,462 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2019-10-13 19:11:56,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:11:56,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-13 19:11:56,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:56,476 INFO L225 Difference]: With dead ends: 89 [2019-10-13 19:11:56,476 INFO L226 Difference]: Without dead ends: 56 [2019-10-13 19:11:56,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:11:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-13 19:11:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 33. [2019-10-13 19:11:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 19:11:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-10-13 19:11:56,532 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 20 [2019-10-13 19:11:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:56,532 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-10-13 19:11:56,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:11:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-10-13 19:11:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:11:56,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:56,534 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:56,534 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1586148733, now seen corresponding path program 1 times [2019-10-13 19:11:56,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:56,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512261983] [2019-10-13 19:11:56,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:56,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:56,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:56,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512261983] [2019-10-13 19:11:56,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:11:56,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:11:56,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459269573] [2019-10-13 19:11:56,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:11:56,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:56,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:11:56,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:11:56,712 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 7 states. [2019-10-13 19:11:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:56,937 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2019-10-13 19:11:56,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:11:56,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-13 19:11:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:56,938 INFO L225 Difference]: With dead ends: 58 [2019-10-13 19:11:56,939 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 19:11:56,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:11:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 19:11:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-10-13 19:11:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 19:11:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-10-13 19:11:56,956 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 20 [2019-10-13 19:11:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:56,957 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-10-13 19:11:56,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:11:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-10-13 19:11:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:11:56,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:56,960 INFO L380 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] [2019-10-13 19:11:56,960 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:56,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:56,960 INFO L82 PathProgramCache]: Analyzing trace with hash -796981742, now seen corresponding path program 1 times [2019-10-13 19:11:56,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:56,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109452807] [2019-10-13 19:11:56,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:56,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:56,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:57,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109452807] [2019-10-13 19:11:57,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:11:57,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:11:57,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162288223] [2019-10-13 19:11:57,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:11:57,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:57,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:11:57,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:11:57,157 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 5 states. [2019-10-13 19:11:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:57,322 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2019-10-13 19:11:57,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:11:57,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-13 19:11:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:57,323 INFO L225 Difference]: With dead ends: 63 [2019-10-13 19:11:57,324 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 19:11:57,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-10-13 19:11:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 19:11:57,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-13 19:11:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 19:11:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-10-13 19:11:57,332 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 25 [2019-10-13 19:11:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:57,332 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-10-13 19:11:57,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:11:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-10-13 19:11:57,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:11:57,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:57,334 INFO L380 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] [2019-10-13 19:11:57,334 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:57,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1808098992, now seen corresponding path program 1 times [2019-10-13 19:11:57,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:57,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052821219] [2019-10-13 19:11:57,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:57,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:57,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:57,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052821219] [2019-10-13 19:11:57,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:11:57,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:11:57,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081122553] [2019-10-13 19:11:57,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:11:57,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:57,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:11:57,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:11:57,559 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 10 states. [2019-10-13 19:11:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:57,991 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2019-10-13 19:11:57,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 19:11:57,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-10-13 19:11:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:57,994 INFO L225 Difference]: With dead ends: 64 [2019-10-13 19:11:57,994 INFO L226 Difference]: Without dead ends: 59 [2019-10-13 19:11:57,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:11:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-13 19:11:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2019-10-13 19:11:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 19:11:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-10-13 19:11:58,006 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 25 [2019-10-13 19:11:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:58,007 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-10-13 19:11:58,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:11:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-10-13 19:11:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:11:58,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:58,012 INFO L380 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] [2019-10-13 19:11:58,012 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:58,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1806250028, now seen corresponding path program 1 times [2019-10-13 19:11:58,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:58,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107474671] [2019-10-13 19:11:58,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:58,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:58,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:58,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107474671] [2019-10-13 19:11:58,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776562290] [2019-10-13 19:11:58,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:58,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:11:58,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:58,327 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:58,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-10-13 19:11:58,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117764345] [2019-10-13 19:11:58,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:11:58,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:58,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:11:58,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:11:58,330 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 9 states. [2019-10-13 19:11:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:58,546 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2019-10-13 19:11:58,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:11:58,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-13 19:11:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:58,549 INFO L225 Difference]: With dead ends: 76 [2019-10-13 19:11:58,549 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 19:11:58,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:11:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 19:11:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-10-13 19:11:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-13 19:11:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2019-10-13 19:11:58,558 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 25 [2019-10-13 19:11:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:58,558 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2019-10-13 19:11:58,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:11:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2019-10-13 19:11:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:11:58,559 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:58,560 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:58,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:58,770 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:58,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:58,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1806463457, now seen corresponding path program 1 times [2019-10-13 19:11:58,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:58,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660853404] [2019-10-13 19:11:58,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:58,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:58,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:58,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660853404] [2019-10-13 19:11:58,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385190316] [2019-10-13 19:11:58,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:59,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 19:11:59,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:59,090 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:59,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-10-13 19:11:59,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245928245] [2019-10-13 19:11:59,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:11:59,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:59,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:11:59,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:11:59,092 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 10 states. [2019-10-13 19:11:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:59,285 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2019-10-13 19:11:59,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 19:11:59,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-10-13 19:11:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:59,287 INFO L225 Difference]: With dead ends: 87 [2019-10-13 19:11:59,288 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 19:11:59,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:11:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 19:11:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-10-13 19:11:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-13 19:11:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-10-13 19:11:59,296 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 30 [2019-10-13 19:11:59,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:59,296 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-10-13 19:11:59,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:11:59,296 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-10-13 19:11:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 19:11:59,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:59,298 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:59,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:59,502 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:59,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:59,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1561443664, now seen corresponding path program 2 times [2019-10-13 19:11:59,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:59,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843748537] [2019-10-13 19:11:59,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:59,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:59,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:59,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843748537] [2019-10-13 19:11:59,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676371357] [2019-10-13 19:11:59,638 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:59,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:11:59,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:11:59,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 19:11:59,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:59,783 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:59,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-10-13 19:11:59,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461927613] [2019-10-13 19:11:59,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 19:11:59,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 19:11:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:11:59,785 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 11 states. [2019-10-13 19:11:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:59,995 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2019-10-13 19:11:59,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:11:59,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-10-13 19:11:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:59,997 INFO L225 Difference]: With dead ends: 92 [2019-10-13 19:11:59,997 INFO L226 Difference]: Without dead ends: 65 [2019-10-13 19:11:59,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:11:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-13 19:12:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2019-10-13 19:12:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 19:12:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2019-10-13 19:12:00,006 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 35 [2019-10-13 19:12:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:00,006 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2019-10-13 19:12:00,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 19:12:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2019-10-13 19:12:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 19:12:00,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:00,008 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:00,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:00,222 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:00,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:00,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1001209665, now seen corresponding path program 3 times [2019-10-13 19:12:00,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:00,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880365245] [2019-10-13 19:12:00,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:00,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:00,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:00,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880365245] [2019-10-13 19:12:00,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730927513] [2019-10-13 19:12:00,392 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:01,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 19:12:01,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:01,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-13 19:12:01,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:01,940 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_21|], 2=[|v_#memory_int_20|]} [2019-10-13 19:12:01,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:01,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:01,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:01,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:01,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:01,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:01,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-13 19:12:01,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:02,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:02,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:02,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:02,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:02,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:02,022 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:02,024 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,033 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:32 [2019-10-13 19:12:02,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:02,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:02,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:02,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:02,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:02,108 INFO L341 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2019-10-13 19:12:02,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 47 [2019-10-13 19:12:02,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:35 [2019-10-13 19:12:02,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:02,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:12:02,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 21 [2019-10-13 19:12:02,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407587889] [2019-10-13 19:12:02,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 19:12:02,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:02,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 19:12:02,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:12:02,287 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 12 states. [2019-10-13 19:12:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:02,684 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2019-10-13 19:12:02,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:12:02,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-10-13 19:12:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:02,685 INFO L225 Difference]: With dead ends: 77 [2019-10-13 19:12:02,686 INFO L226 Difference]: Without dead ends: 72 [2019-10-13 19:12:02,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-10-13 19:12:02,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-13 19:12:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2019-10-13 19:12:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 19:12:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2019-10-13 19:12:02,694 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 40 [2019-10-13 19:12:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:02,694 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-10-13 19:12:02,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 19:12:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2019-10-13 19:12:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 19:12:02,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:02,696 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:02,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:02,909 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:02,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:02,909 INFO L82 PathProgramCache]: Analyzing trace with hash -999360701, now seen corresponding path program 1 times [2019-10-13 19:12:02,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:02,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940011190] [2019-10-13 19:12:02,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:02,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:02,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:03,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940011190] [2019-10-13 19:12:03,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792044013] [2019-10-13 19:12:03,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:03,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 19:12:03,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:03,252 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:03,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-10-13 19:12:03,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549451369] [2019-10-13 19:12:03,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 19:12:03,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:03,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 19:12:03,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:12:03,254 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 12 states. [2019-10-13 19:12:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:03,516 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2019-10-13 19:12:03,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:12:03,516 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-10-13 19:12:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:03,518 INFO L225 Difference]: With dead ends: 84 [2019-10-13 19:12:03,518 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 19:12:03,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-10-13 19:12:03,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 19:12:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-10-13 19:12:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-13 19:12:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-10-13 19:12:03,540 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 40 [2019-10-13 19:12:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:03,541 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-10-13 19:12:03,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 19:12:03,541 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-10-13 19:12:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 19:12:03,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:03,542 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:03,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:03,747 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:03,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash -37623148, now seen corresponding path program 2 times [2019-10-13 19:12:03,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:03,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800219789] [2019-10-13 19:12:03,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:03,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:03,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:04,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800219789] [2019-10-13 19:12:04,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307747113] [2019-10-13 19:12:04,158 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:04,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:12:04,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:04,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-13 19:12:04,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:04,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:12:04,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:12:04,325 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:12:04,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-10-13 19:12:04,345 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_24|], 2=[|v_#memory_int_23|]} [2019-10-13 19:12:04,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:04,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:04,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:04,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:04,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:04,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:04,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-13 19:12:04,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,444 INFO L341 Elim1Store]: treesize reduction 122, result has 17.6 percent of original size [2019-10-13 19:12:04,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:04,446 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,454 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:30 [2019-10-13 19:12:04,494 INFO L341 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2019-10-13 19:12:04,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:04,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:26 [2019-10-13 19:12:04,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:04,748 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:04,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2019-10-13 19:12:04,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660621728] [2019-10-13 19:12:04,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 19:12:04,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:04,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 19:12:04,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:12:04,750 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 21 states. [2019-10-13 19:12:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:05,969 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-10-13 19:12:05,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:12:05,970 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2019-10-13 19:12:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:05,971 INFO L225 Difference]: With dead ends: 71 [2019-10-13 19:12:05,971 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 19:12:05,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 19:12:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 19:12:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-10-13 19:12:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 19:12:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2019-10-13 19:12:05,986 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 45 [2019-10-13 19:12:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:05,986 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2019-10-13 19:12:05,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 19:12:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2019-10-13 19:12:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 19:12:05,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:05,989 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:06,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:06,193 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:06,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:06,193 INFO L82 PathProgramCache]: Analyzing trace with hash -37625070, now seen corresponding path program 1 times [2019-10-13 19:12:06,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:06,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392713120] [2019-10-13 19:12:06,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:06,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:06,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:06,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392713120] [2019-10-13 19:12:06,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514664617] [2019-10-13 19:12:06,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:06,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-13 19:12:06,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:06,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:12:06,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:06,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:12:06,762 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:06,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:12:06,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:06,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-13 19:12:06,771 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_27|], 2=[|v_#memory_int_26|]} [2019-10-13 19:12:06,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-13 19:12:06,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:06,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:06,818 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:06,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,835 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:33 [2019-10-13 19:12:06,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:06,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:06,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:29 [2019-10-13 19:12:07,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:07,042 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:07,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2019-10-13 19:12:07,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014892069] [2019-10-13 19:12:07,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 19:12:07,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 19:12:07,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:12:07,044 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 21 states. [2019-10-13 19:12:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:07,848 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2019-10-13 19:12:07,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:12:07,848 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2019-10-13 19:12:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:07,849 INFO L225 Difference]: With dead ends: 70 [2019-10-13 19:12:07,849 INFO L226 Difference]: Without dead ends: 67 [2019-10-13 19:12:07,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2019-10-13 19:12:07,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-13 19:12:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2019-10-13 19:12:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 19:12:07,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2019-10-13 19:12:07,856 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 45 [2019-10-13 19:12:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:07,856 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2019-10-13 19:12:07,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 19:12:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2019-10-13 19:12:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 19:12:07,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:07,858 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:08,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:08,070 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:08,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:08,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2064566938, now seen corresponding path program 1 times [2019-10-13 19:12:08,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:08,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938245140] [2019-10-13 19:12:08,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:08,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:08,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:08,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938245140] [2019-10-13 19:12:08,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282226303] [2019-10-13 19:12:08,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:08,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-13 19:12:08,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:08,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:12:08,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:12:08,485 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:12:08,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-10-13 19:12:08,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:08,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 19:12:08,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-10-13 19:12:08,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:08,574 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:08,585 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 58 [2019-10-13 19:12:08,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,621 INFO L567 ElimStorePlain]: treesize reduction 40, result has 47.4 percent of original size [2019-10-13 19:12:08,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:36 [2019-10-13 19:12:08,778 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 25 [2019-10-13 19:12:08,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,789 INFO L567 ElimStorePlain]: treesize reduction 4, result has 69.2 percent of original size [2019-10-13 19:12:08,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:4 [2019-10-13 19:12:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:08,814 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:08,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-10-13 19:12:08,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443619373] [2019-10-13 19:12:08,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 19:12:08,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:08,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 19:12:08,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2019-10-13 19:12:08,816 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 24 states. [2019-10-13 19:12:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:10,168 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2019-10-13 19:12:10,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 19:12:10,168 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-10-13 19:12:10,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:10,170 INFO L225 Difference]: With dead ends: 98 [2019-10-13 19:12:10,170 INFO L226 Difference]: Without dead ends: 91 [2019-10-13 19:12:10,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2019-10-13 19:12:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-13 19:12:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2019-10-13 19:12:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-13 19:12:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2019-10-13 19:12:10,178 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 46 [2019-10-13 19:12:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:10,179 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2019-10-13 19:12:10,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 19:12:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2019-10-13 19:12:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 19:12:10,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:10,180 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:10,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:10,393 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:10,393 INFO L82 PathProgramCache]: Analyzing trace with hash 786550302, now seen corresponding path program 1 times [2019-10-13 19:12:10,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:10,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735119371] [2019-10-13 19:12:10,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:10,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:10,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:10,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735119371] [2019-10-13 19:12:10,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363028967] [2019-10-13 19:12:10,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 19:12:10,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:12:10,643 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:10,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-10-13 19:12:10,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515542856] [2019-10-13 19:12:10,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:12:10,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:10,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:12:10,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:12:10,645 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 6 states. [2019-10-13 19:12:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:10,917 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2019-10-13 19:12:10,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:12:10,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-13 19:12:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:10,918 INFO L225 Difference]: With dead ends: 113 [2019-10-13 19:12:10,919 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 19:12:10,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:12:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 19:12:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-13 19:12:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 19:12:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2019-10-13 19:12:10,926 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 46 [2019-10-13 19:12:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:10,926 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2019-10-13 19:12:10,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:12:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2019-10-13 19:12:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 19:12:10,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:10,928 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:11,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:11,142 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:11,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash 502857859, now seen corresponding path program 1 times [2019-10-13 19:12:11,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:11,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084191651] [2019-10-13 19:12:11,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:11,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:11,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:11,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084191651] [2019-10-13 19:12:11,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801237519] [2019-10-13 19:12:11,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-13 19:12:11,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:11,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:12:11,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:11,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:11,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:11,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:12:11,977 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:11,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 19:12:11,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:11,996 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-10-13 19:12:11,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:11,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-10-13 19:12:12,040 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 2=[|v_#memory_int_29|]} [2019-10-13 19:12:12,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-13 19:12:12,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:12,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,115 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:43 [2019-10-13 19:12:12,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:12,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:12,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:43 [2019-10-13 19:12:12,294 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 19:12:12,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-10-13 19:12:12,356 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_21|], 2=[|v_#memory_int_30|], 30=[|v_#memory_int_33|]} [2019-10-13 19:12:12,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 19:12:12,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 19:12:12,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,503 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:12,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 69 [2019-10-13 19:12:12,564 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,598 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:120, output treesize:94 [2019-10-13 19:12:12,690 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.offset_20|], 30=[|v_#memory_int_34|]} [2019-10-13 19:12:12,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 143 [2019-10-13 19:12:12,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:12,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:12,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-10-13 19:12:12,871 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-10-13 19:12:12,871 INFO L567 ElimStorePlain]: treesize reduction 1089, result has 13.6 percent of original size [2019-10-13 19:12:12,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 142 [2019-10-13 19:12:12,879 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2019-10-13 19:12:12,934 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,967 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:181, output treesize:128 [2019-10-13 19:12:13,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:13,466 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:13,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 73 [2019-10-13 19:12:13,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:13,517 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.2 percent of original size [2019-10-13 19:12:13,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:13,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-10-13 19:12:13,532 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:13,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:13,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:13,549 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:146, output treesize:54 [2019-10-13 19:12:13,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:13,647 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:13,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 33 [2019-10-13 19:12:13,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423631035] [2019-10-13 19:12:13,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-13 19:12:13,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:13,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-13 19:12:13,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 19:12:13,649 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 33 states. [2019-10-13 19:12:15,001 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-10-13 19:12:15,278 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2019-10-13 19:12:15,837 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-10-13 19:12:16,066 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2019-10-13 19:12:16,538 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 135 [2019-10-13 19:12:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:17,370 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2019-10-13 19:12:17,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 19:12:17,371 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 51 [2019-10-13 19:12:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:17,372 INFO L225 Difference]: With dead ends: 79 [2019-10-13 19:12:17,372 INFO L226 Difference]: Without dead ends: 74 [2019-10-13 19:12:17,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=289, Invalid=2063, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 19:12:17,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-13 19:12:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2019-10-13 19:12:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-13 19:12:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-10-13 19:12:17,379 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 51 [2019-10-13 19:12:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:17,380 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-10-13 19:12:17,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-13 19:12:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-10-13 19:12:17,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 19:12:17,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:17,381 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:17,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:17,589 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:17,589 INFO L82 PathProgramCache]: Analyzing trace with hash 504706823, now seen corresponding path program 1 times [2019-10-13 19:12:17,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:17,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971548018] [2019-10-13 19:12:17,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:17,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:17,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:18,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971548018] [2019-10-13 19:12:18,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098720801] [2019-10-13 19:12:18,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:18,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-13 19:12:18,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:18,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:12:18,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:12:18,439 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 19:12:18,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,467 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-10-13 19:12:18,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-10-13 19:12:18,501 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 2=[|v_#memory_int_35|]} [2019-10-13 19:12:18,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-13 19:12:18,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:18,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:43 [2019-10-13 19:12:18,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:18,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:18,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:43 [2019-10-13 19:12:18,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 19:12:18,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-10-13 19:12:18,804 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_21|], 2=[|v_#memory_int_36|], 30=[|v_#memory_int_39|]} [2019-10-13 19:12:18,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 19:12:18,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 19:12:18,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:18,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,915 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:18,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:18,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:18,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 69 [2019-10-13 19:12:18,987 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,024 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:123, output treesize:97 [2019-10-13 19:12:19,109 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_22|], 30=[|v_#memory_int_40|]} [2019-10-13 19:12:19,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,120 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:19,129 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 101 [2019-10-13 19:12:19,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,216 INFO L567 ElimStorePlain]: treesize reduction 30, result has 85.3 percent of original size [2019-10-13 19:12:19,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-10-13 19:12:19,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2019-10-13 19:12:19,275 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,308 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:184, output treesize:131 [2019-10-13 19:12:19,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 53 [2019-10-13 19:12:19,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,811 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.4 percent of original size [2019-10-13 19:12:19,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-13 19:12:19,817 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:19,833 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:50 [2019-10-13 19:12:19,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:19,926 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:19,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2019-10-13 19:12:19,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788158380] [2019-10-13 19:12:19,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 19:12:19,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:19,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 19:12:19,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2019-10-13 19:12:19,927 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 32 states. [2019-10-13 19:12:20,825 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-10-13 19:12:20,972 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-13 19:12:21,223 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-10-13 19:12:21,821 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-10-13 19:12:22,275 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 133 [2019-10-13 19:12:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:22,701 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-10-13 19:12:22,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 19:12:22,701 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2019-10-13 19:12:22,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:22,703 INFO L225 Difference]: With dead ends: 76 [2019-10-13 19:12:22,703 INFO L226 Difference]: Without dead ends: 74 [2019-10-13 19:12:22,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1790, Unknown=0, NotChecked=0, Total=2070 [2019-10-13 19:12:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-13 19:12:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2019-10-13 19:12:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 19:12:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2019-10-13 19:12:22,710 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 51 [2019-10-13 19:12:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:22,710 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2019-10-13 19:12:22,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 19:12:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2019-10-13 19:12:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 19:12:22,711 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:22,711 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:22,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:22,915 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:22,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:22,916 INFO L82 PathProgramCache]: Analyzing trace with hash 504704901, now seen corresponding path program 1 times [2019-10-13 19:12:22,916 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:22,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714461321] [2019-10-13 19:12:22,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:22,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:22,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:23,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714461321] [2019-10-13 19:12:23,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805108181] [2019-10-13 19:12:23,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:23,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-13 19:12:23,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:23,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:12:23,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:23,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:12:23,696 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:23,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 19:12:23,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,717 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-10-13 19:12:23,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-10-13 19:12:23,763 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_int_41|]} [2019-10-13 19:12:23,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-13 19:12:23,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:23,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:23,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:23,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,835 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:43 [2019-10-13 19:12:23,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:23,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:23,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:23,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:23,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:23,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:43 [2019-10-13 19:12:24,014 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:24,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 19:12:24,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:24,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:24,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:24,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-10-13 19:12:24,078 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_23|], 2=[|v_#memory_int_42|], 30=[|v_#memory_int_45|]} [2019-10-13 19:12:24,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 19:12:24,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:24,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:24,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 19:12:24,140 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:24,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:24,182 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:24,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:24,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 69 [2019-10-13 19:12:24,258 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:24,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:24,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:24,295 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:123, output treesize:97 [2019-10-13 19:12:24,371 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_24|], 30=[|v_#memory_int_46|]} [2019-10-13 19:12:24,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,380 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:24,403 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:24,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 101 [2019-10-13 19:12:24,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:24,494 INFO L567 ElimStorePlain]: treesize reduction 30, result has 85.3 percent of original size [2019-10-13 19:12:24,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-10-13 19:12:24,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:24,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:24,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:24,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2019-10-13 19:12:24,550 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:24,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:24,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:24,581 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:184, output treesize:131 [2019-10-13 19:12:25,005 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:25,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 53 [2019-10-13 19:12:25,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:25,058 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.4 percent of original size [2019-10-13 19:12:25,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-13 19:12:25,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:25,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:25,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:25,080 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:50 [2019-10-13 19:12:25,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:25,147 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:25,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 33 [2019-10-13 19:12:25,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966688288] [2019-10-13 19:12:25,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-13 19:12:25,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:25,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-13 19:12:25,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 19:12:25,149 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 33 states. [2019-10-13 19:12:26,237 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-13 19:12:26,496 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2019-10-13 19:12:26,956 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-10-13 19:12:27,128 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-10-13 19:12:27,569 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 136 [2019-10-13 19:12:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:28,129 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-10-13 19:12:28,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 19:12:28,130 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 51 [2019-10-13 19:12:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:28,131 INFO L225 Difference]: With dead ends: 76 [2019-10-13 19:12:28,131 INFO L226 Difference]: Without dead ends: 73 [2019-10-13 19:12:28,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=300, Invalid=2052, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 19:12:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-13 19:12:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2019-10-13 19:12:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 19:12:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2019-10-13 19:12:28,138 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 51 [2019-10-13 19:12:28,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:28,139 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2019-10-13 19:12:28,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-13 19:12:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2019-10-13 19:12:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 19:12:28,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:28,140 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:28,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:28,344 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:28,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1696926855, now seen corresponding path program 1 times [2019-10-13 19:12:28,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:28,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605223740] [2019-10-13 19:12:28,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:28,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:28,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:28,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605223740] [2019-10-13 19:12:28,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247722741] [2019-10-13 19:12:28,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:29,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 68 conjunts are in the unsatisfiable core [2019-10-13 19:12:29,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:29,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:12:29,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:12:29,234 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 19:12:29,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,258 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-10-13 19:12:29,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-10-13 19:12:29,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 19:12:29,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:39 [2019-10-13 19:12:29,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,364 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:29,374 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 63 [2019-10-13 19:12:29,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,422 INFO L567 ElimStorePlain]: treesize reduction 40, result has 56.5 percent of original size [2019-10-13 19:12:29,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:52 [2019-10-13 19:12:29,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,517 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-10-13 19:12:29,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2019-10-13 19:12:29,579 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_25|], 2=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.base_29|], 4=[|v_#memory_$Pointer$.base_30|], 12=[|v_#memory_$Pointer$.base_32|]} [2019-10-13 19:12:29,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 19:12:29,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,652 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:29,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,705 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:29,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,754 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:29,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,805 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:29,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:29,824 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 16 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 110 [2019-10-13 19:12:29,825 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,902 INFO L567 ElimStorePlain]: treesize reduction 58, result has 65.5 percent of original size [2019-10-13 19:12:29,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,903 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:142, output treesize:85 [2019-10-13 19:12:29,970 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_26|], 21=[|v_#memory_$Pointer$.base_33|]} [2019-10-13 19:12:29,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:29,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-10-13 19:12:29,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:30,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:30,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:30,014 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:30,014 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:30,057 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:30,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 110 treesize of output 136 [2019-10-13 19:12:30,059 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,130 INFO L567 ElimStorePlain]: treesize reduction 172, result has 38.6 percent of original size [2019-10-13 19:12:30,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,131 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:141, output treesize:108 [2019-10-13 19:12:30,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:30,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-10-13 19:12:30,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:30,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:30,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:72 [2019-10-13 19:12:30,546 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:30,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 59 [2019-10-13 19:12:30,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:30,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:30,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:30,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:30,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:30,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:30,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:30,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,566 INFO L567 ElimStorePlain]: treesize reduction 56, result has 13.8 percent of original size [2019-10-13 19:12:30,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:4 [2019-10-13 19:12:30,613 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:30,613 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:30,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2019-10-13 19:12:30,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360793071] [2019-10-13 19:12:30,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-13 19:12:30,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:30,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-13 19:12:30,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2019-10-13 19:12:30,615 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 36 states. [2019-10-13 19:12:31,900 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-13 19:12:32,119 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-10-13 19:12:32,373 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-10-13 19:12:33,064 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 118 [2019-10-13 19:12:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:33,737 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-10-13 19:12:33,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 19:12:33,738 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2019-10-13 19:12:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:33,739 INFO L225 Difference]: With dead ends: 73 [2019-10-13 19:12:33,739 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 19:12:33,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=308, Invalid=2448, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 19:12:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 19:12:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-13 19:12:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 19:12:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2019-10-13 19:12:33,746 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 52 [2019-10-13 19:12:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:33,746 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2019-10-13 19:12:33,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-13 19:12:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2019-10-13 19:12:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 19:12:33,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:33,747 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:33,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:33,948 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:33,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:33,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1861227850, now seen corresponding path program 2 times [2019-10-13 19:12:33,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:33,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384857499] [2019-10-13 19:12:33,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:33,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:33,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:12:35,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384857499] [2019-10-13 19:12:35,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97477260] [2019-10-13 19:12:35,087 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:35,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:12:35,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:35,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-13 19:12:35,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:35,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:12:35,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:35,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:35,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:35,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:12:35,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:35,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 19:12:35,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:35,288 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-10-13 19:12:35,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:35,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-10-13 19:12:35,347 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_50|], 2=[|v_#memory_int_47|]} [2019-10-13 19:12:35,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-13 19:12:35,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:35,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:35,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:35,401 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:35,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:35,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:35,417 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:43 [2019-10-13 19:12:35,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-13 19:12:35,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:35,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:35,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:35,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:43 [2019-10-13 19:12:35,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:35,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-10-13 19:12:35,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:35,744 INFO L567 ElimStorePlain]: treesize reduction 28, result has 67.8 percent of original size [2019-10-13 19:12:35,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:35,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:59 [2019-10-13 19:12:35,866 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_27|], 2=[|v_#memory_int_48|], 30=[|v_#memory_int_52|]} [2019-10-13 19:12:35,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:35,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 19:12:35,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.