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/heap-data/min_max.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:59:12,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:59:12,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:59:12,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:59:12,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:59:12,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:59:12,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:59:12,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:59:12,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:59:12,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:59:12,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:59:12,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:59:12,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:59:12,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:59:12,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:59:12,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:59:12,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:59:12,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:59:12,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:59:12,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:59:12,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:59:12,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:59:12,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:59:12,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:59:12,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:59:12,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:59:12,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:59:12,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:59:12,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:59:12,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:59:12,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:59:12,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:59:12,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:59:12,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:59:12,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:59:12,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:59:12,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:59:12,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:59:12,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:59:12,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:59:12,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:59:12,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 01:59:12,375 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:59:12,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:59:12,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:59:12,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:59:12,377 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:59:12,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:59:12,378 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:59:12,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:59:12,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:59:12,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:59:12,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:59:12,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:59:12,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:59:12,379 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:59:12,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:59:12,380 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:59:12,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:59:12,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:59:12,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:59:12,381 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:59:12,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:59:12,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:59:12,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:59:12,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:59:12,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:59:12,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:59:12,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:59:12,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:59:12,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:59:12,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:59:12,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:59:12,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:59:12,427 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:59:12,427 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:59:12,428 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/min_max.i [2019-10-02 01:59:12,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662720933/d20daff4f8c044f8ae2387ffdc7593c5/FLAG166fa174b [2019-10-02 01:59:13,033 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:59:13,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/min_max.i [2019-10-02 01:59:13,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662720933/d20daff4f8c044f8ae2387ffdc7593c5/FLAG166fa174b [2019-10-02 01:59:13,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662720933/d20daff4f8c044f8ae2387ffdc7593c5 [2019-10-02 01:59:13,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:59:13,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:59:13,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:59:13,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:59:13,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:59:13,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:59:13" (1/1) ... [2019-10-02 01:59:13,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6157593b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:59:13, skipping insertion in model container [2019-10-02 01:59:13,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:59:13" (1/1) ... [2019-10-02 01:59:13,357 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:59:13,409 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:59:13,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:59:13,861 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:59:13,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:59:13,968 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:59:13,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:59:13 WrapperNode [2019-10-02 01:59:13,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:59:13,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:59:13,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:59:13,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:59:13,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:59:13" (1/1) ... [2019-10-02 01:59:13,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:59:13" (1/1) ... [2019-10-02 01:59:13,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:59:13" (1/1) ... [2019-10-02 01:59:13,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:59:13" (1/1) ... [2019-10-02 01:59:14,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:59:13" (1/1) ... [2019-10-02 01:59:14,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:59:13" (1/1) ... [2019-10-02 01:59:14,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:59:13" (1/1) ... [2019-10-02 01:59:14,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:59:14,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:59:14,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:59:14,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:59:14,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:59:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:59:14,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:59:14,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:59:14,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 01:59:14,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 01:59:14,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:59:14,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:59:14,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:59:14,084 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 01:59:14,084 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 01:59:14,084 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 01:59:14,084 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 01:59:14,084 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 01:59:14,084 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 01:59:14,085 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 01:59:14,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 01:59:14,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 01:59:14,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 01:59:14,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 01:59:14,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 01:59:14,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 01:59:14,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 01:59:14,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 01:59:14,086 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 01:59:14,086 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 01:59:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 01:59:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 01:59:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 01:59:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 01:59:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 01:59:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 01:59:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 01:59:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 01:59:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 01:59:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 01:59:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 01:59:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 01:59:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 01:59:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 01:59:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 01:59:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 01:59:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 01:59:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 01:59:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 01:59:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 01:59:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 01:59:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 01:59:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 01:59:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 01:59:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 01:59:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 01:59:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 01:59:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 01:59:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 01:59:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 01:59:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 01:59:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 01:59:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 01:59:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 01:59:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 01:59:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 01:59:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 01:59:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 01:59:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 01:59:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 01:59:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 01:59:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 01:59:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 01:59:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 01:59:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 01:59:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 01:59:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 01:59:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 01:59:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:59:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 01:59:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 01:59:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 01:59:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 01:59:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 01:59:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 01:59:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 01:59:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 01:59:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 01:59:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 01:59:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 01:59:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 01:59:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 01:59:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 01:59:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 01:59:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 01:59:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 01:59:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 01:59:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 01:59:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 01:59:14,098 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 01:59:14,098 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 01:59:14,098 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 01:59:14,098 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 01:59:14,098 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 01:59:14,098 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 01:59:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 01:59:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 01:59:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 01:59:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 01:59:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 01:59:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 01:59:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 01:59:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 01:59:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 01:59:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 01:59:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 01:59:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 01:59:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 01:59:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:59:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 01:59:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 01:59:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 01:59:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 01:59:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 01:59:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:59:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:59:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 01:59:14,581 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:59:14,581 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 01:59:14,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:59:14 BoogieIcfgContainer [2019-10-02 01:59:14,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:59:14,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:59:14,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:59:14,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:59:14,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:59:13" (1/3) ... [2019-10-02 01:59:14,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281f2b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:59:14, skipping insertion in model container [2019-10-02 01:59:14,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:59:13" (2/3) ... [2019-10-02 01:59:14,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281f2b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:59:14, skipping insertion in model container [2019-10-02 01:59:14,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:59:14" (3/3) ... [2019-10-02 01:59:14,591 INFO L109 eAbstractionObserver]: Analyzing ICFG min_max.i [2019-10-02 01:59:14,601 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:59:14,609 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-02 01:59:14,626 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-02 01:59:14,652 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:59:14,652 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:59:14,653 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:59:14,653 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:59:14,654 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:59:14,654 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:59:14,655 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:59:14,655 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:59:14,655 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:59:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-02 01:59:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-02 01:59:14,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:14,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:14,682 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:14,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1192142104, now seen corresponding path program 1 times [2019-10-02 01:59:14,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:14,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:14,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:14,822 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-02 01:59:14,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:59:14,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 01:59:14,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 01:59:14,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 01:59:14,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 01:59:14,841 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-10-02 01:59:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:14,862 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-10-02 01:59:14,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 01:59:14,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-10-02 01:59:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:14,873 INFO L225 Difference]: With dead ends: 39 [2019-10-02 01:59:14,873 INFO L226 Difference]: Without dead ends: 21 [2019-10-02 01:59:14,877 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 01:59:14,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-02 01:59:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-02 01:59:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-02 01:59:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-10-02 01:59:14,909 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2019-10-02 01:59:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:14,910 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-10-02 01:59:14,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 01:59:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-10-02 01:59:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-02 01:59:14,911 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:14,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:14,912 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:14,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:14,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1107899532, now seen corresponding path program 1 times [2019-10-02 01:59:14,912 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:14,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:14,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:14,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:14,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:15,011 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-02 01:59:15,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:59:15,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:59:15,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:59:15,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:59:15,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:59:15,015 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 4 states. [2019-10-02 01:59:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:15,069 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-10-02 01:59:15,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:59:15,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-02 01:59:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:15,071 INFO L225 Difference]: With dead ends: 34 [2019-10-02 01:59:15,071 INFO L226 Difference]: Without dead ends: 23 [2019-10-02 01:59:15,073 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:59:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-02 01:59:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-02 01:59:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-02 01:59:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-10-02 01:59:15,082 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 12 [2019-10-02 01:59:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:15,082 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-02 01:59:15,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:59:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-10-02 01:59:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 01:59:15,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:15,084 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:15,084 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:15,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:15,085 INFO L82 PathProgramCache]: Analyzing trace with hash 897845277, now seen corresponding path program 1 times [2019-10-02 01:59:15,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:15,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:15,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:15,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:15,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:15,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:59:15,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 01:59:15,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:59:15,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:59:15,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:59:15,419 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 7 states. [2019-10-02 01:59:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:15,590 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-10-02 01:59:15,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 01:59:15,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-10-02 01:59:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:15,592 INFO L225 Difference]: With dead ends: 32 [2019-10-02 01:59:15,593 INFO L226 Difference]: Without dead ends: 30 [2019-10-02 01:59:15,593 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:59:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-02 01:59:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-10-02 01:59:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-02 01:59:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-02 01:59:15,602 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2019-10-02 01:59:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:15,604 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-02 01:59:15,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:59:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-02 01:59:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 01:59:15,606 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:15,606 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:15,607 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:15,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:15,608 INFO L82 PathProgramCache]: Analyzing trace with hash -458989665, now seen corresponding path program 1 times [2019-10-02 01:59:15,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:15,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:15,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:15,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:15,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:59:15,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 01:59:15,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 01:59:15,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 01:59:15,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:59:15,812 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 8 states. [2019-10-02 01:59:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:16,036 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-10-02 01:59:16,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:59:16,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-10-02 01:59:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:16,038 INFO L225 Difference]: With dead ends: 44 [2019-10-02 01:59:16,038 INFO L226 Difference]: Without dead ends: 42 [2019-10-02 01:59:16,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-02 01:59:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-02 01:59:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-10-02 01:59:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-02 01:59:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-02 01:59:16,046 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-10-02 01:59:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:16,046 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-02 01:59:16,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 01:59:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-02 01:59:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 01:59:16,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:16,048 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:16,048 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:16,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:16,048 INFO L82 PathProgramCache]: Analyzing trace with hash 221068705, now seen corresponding path program 1 times [2019-10-02 01:59:16,049 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:16,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:16,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:16,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:59:16,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 01:59:16,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:59:16,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:59:16,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:59:16,252 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2019-10-02 01:59:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:16,441 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-02 01:59:16,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 01:59:16,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-10-02 01:59:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:16,443 INFO L225 Difference]: With dead ends: 37 [2019-10-02 01:59:16,443 INFO L226 Difference]: Without dead ends: 35 [2019-10-02 01:59:16,444 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:59:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-02 01:59:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-10-02 01:59:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 01:59:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-02 01:59:16,449 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2019-10-02 01:59:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:16,450 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-02 01:59:16,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:59:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-02 01:59:16,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 01:59:16,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:16,451 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:16,451 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:16,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:16,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1418643305, now seen corresponding path program 1 times [2019-10-02 01:59:16,452 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:16,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:16,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:16,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:16,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:16,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:16,578 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:16,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:16,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 01:59:16,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:16,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:16,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:16,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:16,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:16,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:16,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:16,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:16,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-10-02 01:59:16,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 01:59:16,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:16,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:16,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 01:59:16,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:16,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:16,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:16,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-10-02 01:59:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:59:16,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:16,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-10-02 01:59:16,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:59:16,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:59:16,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:59:16,895 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 7 states. [2019-10-02 01:59:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:17,041 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-10-02 01:59:17,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 01:59:17,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-10-02 01:59:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:17,042 INFO L225 Difference]: With dead ends: 48 [2019-10-02 01:59:17,043 INFO L226 Difference]: Without dead ends: 32 [2019-10-02 01:59:17,043 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:59:17,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-02 01:59:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-02 01:59:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-02 01:59:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-10-02 01:59:17,052 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2019-10-02 01:59:17,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:17,053 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-10-02 01:59:17,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:59:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-10-02 01:59:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 01:59:17,055 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:17,055 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:17,056 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:17,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1939400262, now seen corresponding path program 2 times [2019-10-02 01:59:17,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:17,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:17,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:17,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:17,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 01:59:17,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:17,197 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:17,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 01:59:17,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 01:59:17,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 01:59:17,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:59:17,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:17,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 01:59:17,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:17,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:17,319 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-02 01:59:17,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-02 01:59:17,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-10-02 01:59:17,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:17,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:17,342 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-02 01:59:17,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-10-02 01:59:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 01:59:17,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:17,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-10-02 01:59:17,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:59:17,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:59:17,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:59:17,351 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 9 states. [2019-10-02 01:59:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:17,565 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-10-02 01:59:17,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:59:17,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-10-02 01:59:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:17,566 INFO L225 Difference]: With dead ends: 90 [2019-10-02 01:59:17,566 INFO L226 Difference]: Without dead ends: 71 [2019-10-02 01:59:17,567 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-02 01:59:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-02 01:59:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-10-02 01:59:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-02 01:59:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-10-02 01:59:17,575 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2019-10-02 01:59:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:17,575 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-10-02 01:59:17,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:59:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-10-02 01:59:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 01:59:17,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:17,576 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:17,577 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:17,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:17,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1681234824, now seen corresponding path program 1 times [2019-10-02 01:59:17,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:17,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:17,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:17,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 01:59:17,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:17,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:17,852 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:17,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:17,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 01:59:17,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:17,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 01:59:17,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:17,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:17,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:17,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 01:59:18,047 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:18,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 01:59:18,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:18,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:18,076 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_9|, |v_#memory_$Pointer$.base_9|], 4=[|v_#memory_int_11|]} [2019-10-02 01:59:18,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:18,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:18,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:18,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:18,109 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:18,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:18,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:18,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-02 01:59:18,165 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:18,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:18,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:18,182 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:75, output treesize:42 [2019-10-02 01:59:18,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-10-02 01:59:18,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:18,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:18,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 01:59:18,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:18,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:18,321 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-02 01:59:18,321 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:32 [2019-10-02 01:59:18,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2019-10-02 01:59:18,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:18,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:18,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:18,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-10-02 01:59:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:18,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:18,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-10-02 01:59:18,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 01:59:18,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 01:59:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:59:18,389 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 16 states. [2019-10-02 01:59:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:19,061 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-10-02 01:59:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 01:59:19,062 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-10-02 01:59:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:19,063 INFO L225 Difference]: With dead ends: 71 [2019-10-02 01:59:19,063 INFO L226 Difference]: Without dead ends: 69 [2019-10-02 01:59:19,064 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-10-02 01:59:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-02 01:59:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2019-10-02 01:59:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 01:59:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-10-02 01:59:19,072 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 27 [2019-10-02 01:59:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:19,072 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-10-02 01:59:19,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 01:59:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-10-02 01:59:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 01:59:19,074 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:19,074 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:19,074 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:19,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:19,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1344449784, now seen corresponding path program 1 times [2019-10-02 01:59:19,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:19,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:19,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:19,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:19,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:19,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:19,243 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:19,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:19,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 01:59:19,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:19,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 01:59:19,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:19,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:19,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:19,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 01:59:19,426 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:19,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 01:59:19,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:19,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:19,451 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_10|, |v_#memory_$Pointer$.base_10|], 4=[|v_#memory_int_12|]} [2019-10-02 01:59:19,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:19,462 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:19,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:19,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:19,485 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:19,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:19,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:19,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-02 01:59:19,505 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:19,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:19,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:19,516 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-10-02 01:59:19,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-02 01:59:19,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:19,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:19,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 01:59:19,579 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:19,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:19,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:19,585 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-10-02 01:59:19,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 01:59:19,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:19,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:19,610 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-02 01:59:19,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 01:59:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:19,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:19,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-10-02 01:59:19,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:59:19,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:59:19,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:59:19,626 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 14 states. [2019-10-02 01:59:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:20,230 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-10-02 01:59:20,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 01:59:20,231 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-10-02 01:59:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:20,233 INFO L225 Difference]: With dead ends: 65 [2019-10-02 01:59:20,233 INFO L226 Difference]: Without dead ends: 63 [2019-10-02 01:59:20,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-10-02 01:59:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-02 01:59:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-10-02 01:59:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-02 01:59:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-10-02 01:59:20,242 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2019-10-02 01:59:20,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:20,243 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-10-02 01:59:20,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:59:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-10-02 01:59:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 01:59:20,244 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:20,244 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:20,244 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash -758836934, now seen corresponding path program 1 times [2019-10-02 01:59:20,245 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:20,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:20,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:20,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:20,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:20,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:20,465 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:20,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:20,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 01:59:20,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:20,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 01:59:20,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:20,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:20,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:20,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 01:59:20,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:20,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 01:59:20,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:20,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:20,626 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_11|, |v_#memory_$Pointer$.base_11|], 4=[|v_#memory_int_13|]} [2019-10-02 01:59:20,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:20,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:20,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:20,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:20,652 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:20,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:20,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:20,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-02 01:59:20,671 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:20,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:20,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:20,686 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-10-02 01:59:20,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-02 01:59:20,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:20,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:20,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 01:59:20,747 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:20,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:20,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:20,755 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-10-02 01:59:20,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 01:59:20,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:20,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:20,781 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-02 01:59:20,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 01:59:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:20,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:20,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-10-02 01:59:20,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:59:20,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:59:20,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:59:20,797 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2019-10-02 01:59:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:21,523 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2019-10-02 01:59:21,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 01:59:21,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-10-02 01:59:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:21,524 INFO L225 Difference]: With dead ends: 92 [2019-10-02 01:59:21,524 INFO L226 Difference]: Without dead ends: 90 [2019-10-02 01:59:21,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-10-02 01:59:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-02 01:59:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2019-10-02 01:59:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-02 01:59:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-10-02 01:59:21,534 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 29 [2019-10-02 01:59:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:21,534 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-10-02 01:59:21,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:59:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-10-02 01:59:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 01:59:21,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:21,536 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:21,536 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:21,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:21,536 INFO L82 PathProgramCache]: Analyzing trace with hash -768788038, now seen corresponding path program 1 times [2019-10-02 01:59:21,536 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:21,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:21,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:21,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:21,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:21,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:21,798 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:21,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:21,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 01:59:21,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:21,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 01:59:21,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:21,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:21,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:21,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 01:59:21,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:21,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 01:59:21,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:21,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:21,964 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_12|, |v_#memory_$Pointer$.offset_12|], 4=[|v_#memory_int_14|]} [2019-10-02 01:59:21,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:21,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:21,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:21,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:21,996 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:22,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:22,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:22,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-02 01:59:22,025 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:22,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:22,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:22,042 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:33 [2019-10-02 01:59:22,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-10-02 01:59:22,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:22,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:22,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 01:59:22,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:22,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:22,220 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-02 01:59:22,221 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:32 [2019-10-02 01:59:22,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2019-10-02 01:59:22,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:22,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:22,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:22,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-10-02 01:59:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:22,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:22,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2019-10-02 01:59:22,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 01:59:22,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 01:59:22,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:59:22,273 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 18 states. [2019-10-02 01:59:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:23,214 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2019-10-02 01:59:23,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 01:59:23,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-02 01:59:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:23,216 INFO L225 Difference]: With dead ends: 113 [2019-10-02 01:59:23,216 INFO L226 Difference]: Without dead ends: 111 [2019-10-02 01:59:23,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2019-10-02 01:59:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-02 01:59:23,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2019-10-02 01:59:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-02 01:59:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-10-02 01:59:23,230 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 29 [2019-10-02 01:59:23,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:23,231 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-10-02 01:59:23,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 01:59:23,231 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-10-02 01:59:23,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 01:59:23,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:23,232 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:23,232 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:23,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:23,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1436663426, now seen corresponding path program 2 times [2019-10-02 01:59:23,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:23,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:23,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:23,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:23,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:59:23,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:23,313 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:23,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 01:59:23,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 01:59:23,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 01:59:23,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:59:23,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:23,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 01:59:23,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:23,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:23,441 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-02 01:59:23,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-02 01:59:23,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-10-02 01:59:23,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:23,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:23,474 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-02 01:59:23,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-10-02 01:59:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:59:23,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:23,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-10-02 01:59:23,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 01:59:23,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 01:59:23,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 01:59:23,485 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 10 states. [2019-10-02 01:59:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:23,697 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2019-10-02 01:59:23,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 01:59:23,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-10-02 01:59:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:23,700 INFO L225 Difference]: With dead ends: 145 [2019-10-02 01:59:23,700 INFO L226 Difference]: Without dead ends: 100 [2019-10-02 01:59:23,701 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:59:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-02 01:59:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 60. [2019-10-02 01:59:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-02 01:59:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-10-02 01:59:23,721 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 29 [2019-10-02 01:59:23,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:23,721 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-10-02 01:59:23,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 01:59:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-10-02 01:59:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 01:59:23,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:23,724 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:23,725 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:23,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:23,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1847186620, now seen corresponding path program 1 times [2019-10-02 01:59:23,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:23,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:23,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:23,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 01:59:23,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:23,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:23,959 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:24,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:24,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 01:59:24,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:24,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 01:59:24,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:24,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:24,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:24,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 01:59:24,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:24,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 01:59:24,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:24,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:24,112 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_13|, |v_#memory_$Pointer$.offset_13|], 4=[|v_#memory_int_15|]} [2019-10-02 01:59:24,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:24,117 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:24,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:24,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:24,138 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:24,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:24,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:24,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-02 01:59:24,157 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:24,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:24,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:24,172 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-10-02 01:59:24,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-02 01:59:24,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:24,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:24,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 01:59:24,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:24,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:24,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:24,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-10-02 01:59:24,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 01:59:24,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:24,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:24,273 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-02 01:59:24,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 01:59:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:24,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:24,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2019-10-02 01:59:24,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:59:24,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:59:24,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:59:24,282 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 15 states. [2019-10-02 01:59:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:25,456 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2019-10-02 01:59:25,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 01:59:25,456 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-10-02 01:59:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:25,457 INFO L225 Difference]: With dead ends: 92 [2019-10-02 01:59:25,457 INFO L226 Difference]: Without dead ends: 90 [2019-10-02 01:59:25,458 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-10-02 01:59:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-02 01:59:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2019-10-02 01:59:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-02 01:59:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2019-10-02 01:59:25,466 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 29 [2019-10-02 01:59:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:25,466 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2019-10-02 01:59:25,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:59:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2019-10-02 01:59:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 01:59:25,468 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:25,468 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:25,468 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:25,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1837235516, now seen corresponding path program 1 times [2019-10-02 01:59:25,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:25,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:25,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:25,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:25,786 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:25,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:25,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 01:59:25,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:25,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 01:59:25,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:25,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:25,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:25,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 01:59:25,969 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:25,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 01:59:25,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:25,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:25,995 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_14|, |v_#memory_$Pointer$.offset_14|], 4=[|v_#memory_int_16|]} [2019-10-02 01:59:25,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:25,999 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:26,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:26,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:26,028 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:26,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:26,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:26,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-02 01:59:26,060 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:26,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:26,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:26,076 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:75, output treesize:42 [2019-10-02 01:59:26,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2019-10-02 01:59:26,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:26,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:26,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 01:59:26,251 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:26,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:26,262 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-02 01:59:26,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:30 [2019-10-02 01:59:26,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-10-02 01:59:26,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:26,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:26,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:26,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-10-02 01:59:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:26,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:26,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-10-02 01:59:26,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 01:59:26,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 01:59:26,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-10-02 01:59:26,358 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 21 states. [2019-10-02 01:59:28,370 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-10-02 01:59:28,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:28,939 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2019-10-02 01:59:28,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 01:59:28,940 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-10-02 01:59:28,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:28,942 INFO L225 Difference]: With dead ends: 135 [2019-10-02 01:59:28,942 INFO L226 Difference]: Without dead ends: 133 [2019-10-02 01:59:28,944 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=327, Invalid=1835, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 01:59:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-02 01:59:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 39. [2019-10-02 01:59:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 01:59:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-10-02 01:59:28,950 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 29 [2019-10-02 01:59:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:28,950 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-10-02 01:59:28,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 01:59:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-10-02 01:59:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 01:59:28,951 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:28,952 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:28,952 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2094339090, now seen corresponding path program 2 times [2019-10-02 01:59:28,952 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:28,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:28,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:28,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:28,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:29,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:29,098 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:29,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 01:59:29,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 01:59:29,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 01:59:29,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 01:59:29,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:29,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 01:59:29,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:29,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:29,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:29,256 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:29,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:29,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:29,272 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:29,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:29,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:29,281 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2019-10-02 01:59:29,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:29,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 01:59:29,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:29,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:29,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 01:59:29,354 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:29,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:29,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 01:59:29,387 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:29,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:29,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 01:59:29,420 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:29,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:29,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 01:59:29,441 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:29,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:29,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:29,452 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:85, output treesize:39 [2019-10-02 01:59:29,572 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:29,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-10-02 01:59:29,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:29,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:29,578 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 01:59:29,601 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-10-02 01:59:29,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-10-02 01:59:29,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:29,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:29,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:29,616 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-10-02 01:59:29,626 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:29,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:29,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-10-02 01:59:29,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 01:59:29,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 01:59:29,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:59:29,641 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 13 states. [2019-10-02 01:59:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:30,009 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-10-02 01:59:30,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:59:30,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-10-02 01:59:30,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:30,010 INFO L225 Difference]: With dead ends: 67 [2019-10-02 01:59:30,010 INFO L226 Difference]: Without dead ends: 46 [2019-10-02 01:59:30,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:59:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-02 01:59:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-02 01:59:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-02 01:59:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-10-02 01:59:30,016 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 32 [2019-10-02 01:59:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:30,016 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-10-02 01:59:30,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 01:59:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-10-02 01:59:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 01:59:30,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:30,018 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:30,018 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:30,018 INFO L82 PathProgramCache]: Analyzing trace with hash 934068797, now seen corresponding path program 3 times [2019-10-02 01:59:30,018 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:30,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:30,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:30,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 01:59:30,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:30,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:30,408 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:30,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 01:59:30,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 01:59:30,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 01:59:30,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-02 01:59:30,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:30,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 01:59:30,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:30,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:30,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:30,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 01:59:30,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:30,641 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-02 01:59:30,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:30,714 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.7 percent of original size [2019-10-02 01:59:30,715 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_18|], 4=[|v_#memory_int_17|]} [2019-10-02 01:59:30,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:30,722 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:30,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:30,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:30,745 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:30,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:30,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:30,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-02 01:59:30,769 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:30,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:30,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:30,788 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:44 [2019-10-02 01:59:30,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:30,858 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 20 treesize of output 30 [2019-10-02 01:59:30,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:30,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:30,911 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_19|, |v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_20|], 4=[|v_#memory_int_18|]} [2019-10-02 01:59:30,917 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 01:59:30,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:30,966 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-02 01:59:30,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:31,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:31,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-10-02 01:59:31,007 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:31,086 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-10-02 01:59:31,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:31,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:31,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-10-02 01:59:31,096 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:31,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:31,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:31,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-10-02 01:59:31,136 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:31,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:31,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:31,165 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:135, output treesize:71 [2019-10-02 01:59:31,536 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-02 01:59:31,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 55 [2019-10-02 01:59:31,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:31,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:31,540 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 01:59:31,577 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.3 percent of original size [2019-10-02 01:59:31,587 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:31,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-10-02 01:59:31,588 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:31,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:31,606 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-02 01:59:31,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:26 [2019-10-02 01:59:31,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-02 01:59:31,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:31,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:31,658 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-02 01:59:31,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-02 01:59:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:59:31,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:31,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-10-02 01:59:31,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 01:59:31,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 01:59:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2019-10-02 01:59:31,716 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 26 states. [2019-10-02 01:59:33,372 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-10-02 01:59:34,147 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-10-02 01:59:34,362 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-10-02 01:59:34,590 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-10-02 01:59:34,957 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-10-02 01:59:35,149 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-10-02 01:59:35,361 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-10-02 01:59:35,805 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-10-02 01:59:36,546 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-10-02 01:59:36,835 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-10-02 01:59:37,106 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-10-02 01:59:37,255 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-10-02 01:59:37,423 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-10-02 01:59:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:37,838 INFO L93 Difference]: Finished difference Result 279 states and 305 transitions. [2019-10-02 01:59:37,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 01:59:37,839 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2019-10-02 01:59:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:37,841 INFO L225 Difference]: With dead ends: 279 [2019-10-02 01:59:37,841 INFO L226 Difference]: Without dead ends: 277 [2019-10-02 01:59:37,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=566, Invalid=3340, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 01:59:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-02 01:59:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 93. [2019-10-02 01:59:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-02 01:59:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2019-10-02 01:59:37,856 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 37 [2019-10-02 01:59:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:37,857 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2019-10-02 01:59:37,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 01:59:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2019-10-02 01:59:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 01:59:37,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:37,858 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:37,858 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:37,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash 833472957, now seen corresponding path program 1 times [2019-10-02 01:59:37,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:37,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:37,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:37,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 01:59:37,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:38,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:38,195 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:38,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:38,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-02 01:59:38,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:38,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 01:59:38,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:38,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:38,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:38,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 01:59:38,398 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:38,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-02 01:59:38,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:38,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:38,445 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|], 4=[|v_#memory_int_19|]} [2019-10-02 01:59:38,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:38,451 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:38,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:38,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:38,485 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:38,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:38,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:38,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-10-02 01:59:38,525 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:38,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:38,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:38,549 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:85, output treesize:56 [2019-10-02 01:59:38,653 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.offset_23|, |v_#memory_$Pointer$.base_22|], 9=[|v_#memory_int_20|]} [2019-10-02 01:59:38,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:38,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2019-10-02 01:59:38,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:38,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:38,714 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 01:59:38,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:38,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:38,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:38,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 43 [2019-10-02 01:59:38,765 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:38,837 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.1 percent of original size [2019-10-02 01:59:38,852 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:38,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 51 [2019-10-02 01:59:38,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:38,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:38,856 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 01:59:38,928 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.1 percent of original size [2019-10-02 01:59:38,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:38,936 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 01:59:38,964 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:38,965 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 75 [2019-10-02 01:59:38,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:38,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:38,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:38,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:38,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:38,969 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:39,094 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-10-02 01:59:39,095 INFO L567 ElimStorePlain]: treesize reduction 34, result has 79.6 percent of original size [2019-10-02 01:59:39,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 01:59:39,099 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:132, output treesize:143 [2019-10-02 01:59:39,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,454 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-10-02 01:59:39,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:59:39,631 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-10-02 01:59:39,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:59:39,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:59:39,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:39,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 62 [2019-10-02 01:59:39,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:39,944 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 01:59:39,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:39,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 63 [2019-10-02 01:59:39,950 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 01:59:39,979 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-02 01:59:39,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 76 [2019-10-02 01:59:39,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:39,982 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-02 01:59:40,071 INFO L567 ElimStorePlain]: treesize reduction 12, result has 92.7 percent of original size [2019-10-02 01:59:40,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:40,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:40,088 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 1 case distinctions, treesize of input 59 treesize of output 54 [2019-10-02 01:59:40,088 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:40,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:40,103 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:40,103 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 1 case distinctions, treesize of input 49 treesize of output 44 [2019-10-02 01:59:40,104 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:40,111 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:40,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2019-10-02 01:59:40,112 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:40,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:40,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-10-02 01:59:40,143 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:270, output treesize:88 [2019-10-02 01:59:40,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:59:40,233 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_4, |#memory_int|], 3=[v_prenex_6]} [2019-10-02 01:59:40,259 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:40,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 20 [2019-10-02 01:59:40,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:40,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:40,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:40,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:40,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 22 [2019-10-02 01:59:40,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:40,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:40,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:40,329 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:40,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 41 [2019-10-02 01:59:40,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:40,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:40,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:40,334 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:40,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:40,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 01:59:40,358 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:100, output treesize:11 [2019-10-02 01:59:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:40,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:40,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-10-02 01:59:40,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 01:59:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 01:59:40,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2019-10-02 01:59:40,408 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand 25 states. [2019-10-02 01:59:41,731 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2019-10-02 01:59:41,954 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-10-02 01:59:42,224 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-10-02 01:59:42,682 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2019-10-02 01:59:43,085 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2019-10-02 01:59:44,161 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 125 [2019-10-02 01:59:44,757 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-10-02 01:59:45,118 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 153 [2019-10-02 01:59:46,143 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-10-02 01:59:46,519 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 155 [2019-10-02 01:59:47,232 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-10-02 01:59:47,526 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 99 [2019-10-02 01:59:47,767 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-10-02 01:59:48,374 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-10-02 01:59:48,655 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 101 [2019-10-02 01:59:49,519 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-10-02 01:59:49,722 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-10-02 01:59:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:50,084 INFO L93 Difference]: Finished difference Result 453 states and 500 transitions. [2019-10-02 01:59:50,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-02 01:59:50,085 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-10-02 01:59:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:50,087 INFO L225 Difference]: With dead ends: 453 [2019-10-02 01:59:50,087 INFO L226 Difference]: Without dead ends: 451 [2019-10-02 01:59:50,090 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1963 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1163, Invalid=6147, Unknown=0, NotChecked=0, Total=7310 [2019-10-02 01:59:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-10-02 01:59:50,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 120. [2019-10-02 01:59:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-02 01:59:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2019-10-02 01:59:50,106 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 37 [2019-10-02 01:59:50,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:50,106 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2019-10-02 01:59:50,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 01:59:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2019-10-02 01:59:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 01:59:50,108 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:50,108 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:50,109 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:50,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:50,109 INFO L82 PathProgramCache]: Analyzing trace with hash 581200573, now seen corresponding path program 2 times [2019-10-02 01:59:50,109 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:50,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:50,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:50,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:59:50,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:50,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:50,437 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:50,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 01:59:50,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 01:59:50,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 01:59:50,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-02 01:59:50,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:50,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 01:59:50,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:50,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:50,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:50,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 01:59:50,758 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:50,759 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-02 01:59:50,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:50,828 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-10-02 01:59:50,832 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|], 4=[|v_#memory_int_21|]} [2019-10-02 01:59:50,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:50,837 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:50,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:50,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:50,863 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:50,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:50,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:50,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-02 01:59:50,887 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:50,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:50,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:50,902 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:41 [2019-10-02 01:59:50,969 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:50,969 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 20 treesize of output 30 [2019-10-02 01:59:50,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:51,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:51,028 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.offset_25|], 4=[|v_#memory_int_22|]} [2019-10-02 01:59:51,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2019-10-02 01:59:51,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:51,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:51,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-10-02 01:59:51,089 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:51,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:51,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 01:59:51,159 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:51,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:51,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 01:59:51,211 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:51,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:51,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:51,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-10-02 01:59:51,250 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:51,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:51,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:51,293 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:144, output treesize:97 [2019-10-02 01:59:51,648 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:51,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 66 [2019-10-02 01:59:51,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:51,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:51,652 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 01:59:51,697 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.1 percent of original size [2019-10-02 01:59:51,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-10-02 01:59:51,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:51,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:51,720 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-02 01:59:51,720 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:24 [2019-10-02 01:59:51,784 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:51,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 20 [2019-10-02 01:59:51,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:51,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:51,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:51,795 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-02 01:59:51,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-10-02 01:59:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:51,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:51,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2019-10-02 01:59:51,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 01:59:51,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 01:59:51,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-10-02 01:59:51,868 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand 22 states. [2019-10-02 01:59:52,697 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-10-02 01:59:52,859 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2019-10-02 01:59:53,334 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-10-02 01:59:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:59:53,398 INFO L93 Difference]: Finished difference Result 164 states and 197 transitions. [2019-10-02 01:59:53,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 01:59:53,399 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-10-02 01:59:53,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:59:53,400 INFO L225 Difference]: With dead ends: 164 [2019-10-02 01:59:53,400 INFO L226 Difference]: Without dead ends: 162 [2019-10-02 01:59:53,402 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2019-10-02 01:59:53,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-02 01:59:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 114. [2019-10-02 01:59:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-02 01:59:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 145 transitions. [2019-10-02 01:59:53,418 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 145 transitions. Word has length 37 [2019-10-02 01:59:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:59:53,418 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 145 transitions. [2019-10-02 01:59:53,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 01:59:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2019-10-02 01:59:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 01:59:53,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:59:53,419 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:59:53,419 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:59:53,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:59:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash 480604733, now seen corresponding path program 2 times [2019-10-02 01:59:53,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:59:53,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:59:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:53,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 01:59:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:59:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:59:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:53,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:59:53,652 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:59:53,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 01:59:53,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 01:59:53,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 01:59:53,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-02 01:59:53,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:59:53,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 01:59:53,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:53,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:53,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:53,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 01:59:53,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:53,925 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-02 01:59:53,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:54,004 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.6 percent of original size [2019-10-02 01:59:54,006 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|], 4=[|v_#memory_int_23|]} [2019-10-02 01:59:54,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:54,013 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:54,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:54,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 01:59:54,050 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:54,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:54,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:54,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-10-02 01:59:54,083 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:54,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:54,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:54,105 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:79, output treesize:58 [2019-10-02 01:59:54,283 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:54,283 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 20 treesize of output 30 [2019-10-02 01:59:54,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:54,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:54,358 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_29|], 10=[|v_#memory_int_24|]} [2019-10-02 01:59:54,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 01:59:54,367 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:54,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:54,425 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-02 01:59:54,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:54,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 01:59:54,479 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:54,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:54,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:54,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2019-10-02 01:59:54,533 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:54,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:54,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 01:59:54,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2019-10-02 01:59:54,582 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:54,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:54,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:54,619 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:163, output treesize:140 [2019-10-02 01:59:54,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:54,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 98 [2019-10-02 01:59:54,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:54,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:54,956 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 01:59:54,994 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.6 percent of original size [2019-10-02 01:59:54,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2019-10-02 01:59:54,999 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 01:59:55,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:55,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 01:59:55,013 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:151, output treesize:49 [2019-10-02 01:59:55,084 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:55,085 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 1 case distinctions, treesize of input 45 treesize of output 25 [2019-10-02 01:59:55,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:59:55,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 01:59:55,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 01:59:55,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 01:59:55,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:3 [2019-10-02 01:59:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:59:55,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:59:55,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2019-10-02 01:59:55,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 01:59:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 01:59:55,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-10-02 01:59:55,126 INFO L87 Difference]: Start difference. First operand 114 states and 145 transitions. Second operand 24 states. [2019-10-02 01:59:57,221 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2019-10-02 01:59:57,359 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-10-02 01:59:57,659 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 49 [2019-10-02 01:59:58,061 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-10-02 01:59:58,263 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-10-02 01:59:58,414 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-10-02 01:59:58,602 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-10-02 01:59:58,841 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 75 [2019-10-02 01:59:59,052 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-10-02 01:59:59,337 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-10-02 01:59:59,551 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-10-02 01:59:59,761 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-10-02 01:59:59,920 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-10-02 02:00:00,122 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-10-02 02:00:00,384 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 77 [2019-10-02 02:00:00,561 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-10-02 02:00:00,738 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-10-02 02:00:00,913 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-10-02 02:00:01,324 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-10-02 02:00:01,597 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-10-02 02:00:01,935 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-10-02 02:00:02,159 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 82 [2019-10-02 02:00:02,343 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-10-02 02:00:02,761 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-10-02 02:00:02,945 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-10-02 02:00:03,245 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-10-02 02:00:03,466 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 84 [2019-10-02 02:00:03,634 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-10-02 02:00:04,503 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-10-02 02:00:04,684 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73 [2019-10-02 02:00:05,466 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-02 02:00:05,640 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-02 02:00:05,850 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2019-10-02 02:00:05,985 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-02 02:00:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:00:06,535 INFO L93 Difference]: Finished difference Result 397 states and 441 transitions. [2019-10-02 02:00:06,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-02 02:00:06,535 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2019-10-02 02:00:06,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:00:06,537 INFO L225 Difference]: With dead ends: 397 [2019-10-02 02:00:06,537 INFO L226 Difference]: Without dead ends: 395 [2019-10-02 02:00:06,540 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2852 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1960, Invalid=7352, Unknown=0, NotChecked=0, Total=9312 [2019-10-02 02:00:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-02 02:00:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 49. [2019-10-02 02:00:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 02:00:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-10-02 02:00:06,551 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 37 [2019-10-02 02:00:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:00:06,552 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-10-02 02:00:06,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 02:00:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-10-02 02:00:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 02:00:06,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:00:06,552 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:00:06,553 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:00:06,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:00:06,553 INFO L82 PathProgramCache]: Analyzing trace with hash -7925313, now seen corresponding path program 3 times [2019-10-02 02:00:06,553 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:00:06,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:00:06,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:06,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:00:06,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:00:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:00:06,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:00:06,857 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:00:06,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 02:00:06,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 02:00:06,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:00:06,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-02 02:00:06,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:00:07,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:00:07,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:00:07,043 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,043 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-02 02:00:07,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,097 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.7 percent of original size [2019-10-02 02:00:07,098 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|], 4=[|v_#memory_int_25|]} [2019-10-02 02:00:07,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 02:00:07,104 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 02:00:07,131 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:07,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-02 02:00:07,157 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,174 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:44 [2019-10-02 02:00:07,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,231 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 20 treesize of output 30 [2019-10-02 02:00:07,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,295 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_31|, |v_#memory_$Pointer$.base_32|], 4=[|v_#memory_int_26|]} [2019-10-02 02:00:07,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 02:00:07,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,344 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-02 02:00:07,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 02:00:07,381 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:07,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-10-02 02:00:07,417 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,467 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.3 percent of original size [2019-10-02 02:00:07,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:07,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-10-02 02:00:07,473 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,495 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:129, output treesize:65 [2019-10-02 02:00:07,649 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-02 02:00:07,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 51 [2019-10-02 02:00:07,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:00:07,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:00:07,652 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:00:07,687 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.8 percent of original size [2019-10-02 02:00:07,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-10-02 02:00:07,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,709 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:11 [2019-10-02 02:00:07,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 02:00:07,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:07,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:07,725 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-02 02:00:07,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 02:00:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:00:07,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:00:07,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2019-10-02 02:00:07,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 02:00:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 02:00:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 02:00:07,737 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 18 states. [2019-10-02 02:00:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:00:09,590 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2019-10-02 02:00:09,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 02:00:09,590 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2019-10-02 02:00:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:00:09,592 INFO L225 Difference]: With dead ends: 147 [2019-10-02 02:00:09,592 INFO L226 Difference]: Without dead ends: 145 [2019-10-02 02:00:09,593 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 02:00:09,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-02 02:00:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 91. [2019-10-02 02:00:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-02 02:00:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2019-10-02 02:00:09,609 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 39 [2019-10-02 02:00:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:00:09,610 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2019-10-02 02:00:09,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 02:00:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2019-10-02 02:00:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 02:00:09,611 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:00:09,611 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:00:09,611 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:00:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:00:09,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2103720255, now seen corresponding path program 2 times [2019-10-02 02:00:09,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:00:09,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:00:09,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:09,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:00:09,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:00:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:00:09,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:00:09,953 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:00:10,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 02:00:10,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 02:00:10,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:00:10,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-02 02:00:10,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:00:10,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:00:10,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:00:10,134 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,135 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-02 02:00:10,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,182 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-10-02 02:00:10,183 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|], 4=[|v_#memory_int_27|]} [2019-10-02 02:00:10,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 02:00:10,189 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 02:00:10,211 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:10,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-02 02:00:10,234 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,250 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:41 [2019-10-02 02:00:10,305 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,305 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 20 treesize of output 30 [2019-10-02 02:00:10,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,357 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.offset_34|], 4=[|v_#memory_int_28|]} [2019-10-02 02:00:10,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2019-10-02 02:00:10,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-10-02 02:00:10,405 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 02:00:10,447 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 02:00:10,493 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:10,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-10-02 02:00:10,532 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,555 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:132, output treesize:85 [2019-10-02 02:00:10,823 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 72 [2019-10-02 02:00:10,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:00:10,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:00:10,825 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:00:10,867 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.7 percent of original size [2019-10-02 02:00:10,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-10-02 02:00:10,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,883 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-02 02:00:10,883 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:126, output treesize:32 [2019-10-02 02:00:10,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2019-10-02 02:00:10,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:10,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:00:10,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-10-02 02:00:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:00:10,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:00:10,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 23 [2019-10-02 02:00:10,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 02:00:10,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 02:00:10,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2019-10-02 02:00:10,958 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 23 states. [2019-10-02 02:00:11,860 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-10-02 02:00:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:00:12,673 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2019-10-02 02:00:12,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 02:00:12,674 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-10-02 02:00:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:00:12,676 INFO L225 Difference]: With dead ends: 173 [2019-10-02 02:00:12,676 INFO L226 Difference]: Without dead ends: 171 [2019-10-02 02:00:12,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 02:00:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-02 02:00:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 93. [2019-10-02 02:00:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-02 02:00:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2019-10-02 02:00:12,696 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 39 [2019-10-02 02:00:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:00:12,696 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2019-10-02 02:00:12,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 02:00:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2019-10-02 02:00:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 02:00:12,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:00:12,697 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:00:12,698 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:00:12,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:00:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash 188127807, now seen corresponding path program 3 times [2019-10-02 02:00:12,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:00:12,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:00:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:12,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:00:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:00:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 02:00:13,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:00:13,100 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:00:13,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 02:00:13,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 02:00:13,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:00:13,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-02 02:00:13,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:00:13,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 02:00:13,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:13,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:13,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:00:13,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 02:00:13,339 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:13,340 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-02 02:00:13,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:13,423 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.4 percent of original size [2019-10-02 02:00:13,425 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|], 4=[|v_#memory_int_29|]} [2019-10-02 02:00:13,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 02:00:13,430 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:13,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:13,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-02 02:00:13,464 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:13,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:13,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:13,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-02 02:00:13,518 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:13,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:13,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:00:13,542 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:84, output treesize:59 [2019-10-02 02:00:13,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:13,710 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 20 treesize of output 30 [2019-10-02 02:00:13,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:13,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:13,777 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|], 9=[|v_#memory_int_30|]} [2019-10-02 02:00:13,781 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:00:13,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:13,831 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-02 02:00:13,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:13,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:13,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2019-10-02 02:00:13,872 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:13,934 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.2 percent of original size [2019-10-02 02:00:13,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:13,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:13,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-10-02 02:00:13,943 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:13,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:13,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:13,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:00:13,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2019-10-02 02:00:13,985 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:14,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:14,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:00:14,014 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:140, output treesize:84 [2019-10-02 02:00:14,180 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-02 02:00:14,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 62 [2019-10-02 02:00:14,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:00:14,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:00:14,182 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:00:14,219 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.3 percent of original size [2019-10-02 02:00:14,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:14,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-10-02 02:00:14,240 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:14,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:14,251 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-02 02:00:14,252 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:26 [2019-10-02 02:00:14,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-02 02:00:14,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:14,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:14,296 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-02 02:00:14,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-02 02:00:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 02:00:14,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:00:14,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2019-10-02 02:00:14,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 02:00:14,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 02:00:14,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2019-10-02 02:00:14,341 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand 25 states. [2019-10-02 02:00:17,241 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-10-02 02:00:17,478 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2019-10-02 02:00:17,667 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-10-02 02:00:17,840 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-10-02 02:00:17,993 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-10-02 02:00:18,655 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-10-02 02:00:18,865 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 87 [2019-10-02 02:00:19,013 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-10-02 02:00:19,649 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 89 [2019-10-02 02:00:20,008 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2019-10-02 02:00:20,215 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 90 [2019-10-02 02:00:20,373 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-10-02 02:00:21,000 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-10-02 02:00:21,196 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-10-02 02:00:21,778 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-02 02:00:21,976 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-10-02 02:00:22,126 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-10-02 02:00:22,312 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-02 02:00:22,523 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-02 02:00:22,718 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-10-02 02:00:22,872 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-10-02 02:00:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:00:23,605 INFO L93 Difference]: Finished difference Result 500 states and 547 transitions. [2019-10-02 02:00:23,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-02 02:00:23,608 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2019-10-02 02:00:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:00:23,610 INFO L225 Difference]: With dead ends: 500 [2019-10-02 02:00:23,610 INFO L226 Difference]: Without dead ends: 498 [2019-10-02 02:00:23,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=934, Invalid=6206, Unknown=0, NotChecked=0, Total=7140 [2019-10-02 02:00:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-02 02:00:23,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 131. [2019-10-02 02:00:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-02 02:00:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2019-10-02 02:00:23,645 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 39 [2019-10-02 02:00:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:00:23,645 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2019-10-02 02:00:23,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 02:00:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2019-10-02 02:00:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 02:00:23,646 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:00:23,646 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 02:00:23,646 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:00:23,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:00:23,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1378278081, now seen corresponding path program 2 times [2019-10-02 02:00:23,647 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:00:23,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:00:23,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:23,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 02:00:23,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:00:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:00:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 02:00:23,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:00:23,743 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:00:23,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 02:00:23,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 02:00:23,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 02:00:23,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 02:00:23,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:00:23,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 02:00:23,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:00:23,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:23,905 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-02 02:00:23,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:9 [2019-10-02 02:00:23,970 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_int|], 4=[|v_#memory_int_31|]} [2019-10-02 02:00:23,972 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 02:00:23,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:23,992 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:00:23,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 40 [2019-10-02 02:00:23,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:00:23,999 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_192], 2=[v_arrayElimCell_191]} [2019-10-02 02:00:24,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:00:24,209 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:465) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 02:00:24,213 INFO L168 Benchmark]: Toolchain (without parser) took 70870.90 ms. Allocated memory was 141.0 MB in the beginning and 570.4 MB in the end (delta: 429.4 MB). Free memory was 86.2 MB in the beginning and 312.6 MB in the end (delta: -226.4 MB). Peak memory consumption was 203.0 MB. Max. memory is 7.1 GB. [2019-10-02 02:00:24,213 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 105.8 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 02:00:24,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.24 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 86.0 MB in the beginning and 167.2 MB in the end (delta: -81.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-10-02 02:00:24,214 INFO L168 Benchmark]: Boogie Preprocessor took 56.99 ms. Allocated memory is still 201.3 MB. Free memory was 167.2 MB in the beginning and 164.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-02 02:00:24,214 INFO L168 Benchmark]: RCFGBuilder took 555.47 ms. Allocated memory is still 201.3 MB. Free memory was 164.9 MB in the beginning and 124.8 MB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. [2019-10-02 02:00:24,214 INFO L168 Benchmark]: TraceAbstraction took 69627.43 ms. Allocated memory was 201.3 MB in the beginning and 570.4 MB in the end (delta: 369.1 MB). Free memory was 124.2 MB in the beginning and 312.6 MB in the end (delta: -188.5 MB). Peak memory consumption was 180.6 MB. Max. memory is 7.1 GB. [2019-10-02 02:00:24,216 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 105.8 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 626.24 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 86.0 MB in the beginning and 167.2 MB in the end (delta: -81.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.99 ms. Allocated memory is still 201.3 MB. Free memory was 167.2 MB in the beginning and 164.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 555.47 ms. Allocated memory is still 201.3 MB. Free memory was 164.9 MB in the beginning and 124.8 MB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 69627.43 ms. Allocated memory was 201.3 MB in the beginning and 570.4 MB in the end (delta: 369.1 MB). Free memory was 124.2 MB in the beginning and 312.6 MB in the end (delta: -188.5 MB). Peak memory consumption was 180.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...