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-efa34d5 [2019-09-16 16:31:35,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:31:35,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:31:35,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:31:35,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:31:35,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:31:35,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:31:35,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:31:35,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:31:35,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:31:35,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:31:35,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:31:35,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:31:35,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:31:35,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:31:35,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:31:35,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:31:35,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:31:35,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:31:35,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:31:35,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:31:35,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:31:35,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:31:35,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:31:35,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:31:35,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:31:35,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:31:35,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:31:35,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:31:35,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:31:35,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:31:35,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:31:35,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:31:35,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:31:35,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:31:35,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:31:35,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:31:35,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:31:35,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:31:35,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:31:35,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:31:35,620 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-09-16 16:31:35,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:31:35,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:31:35,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:31:35,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:31:35,648 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:31:35,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:31:35,648 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:31:35,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:31:35,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:31:35,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:31:35,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:31:35,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:31:35,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:31:35,649 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:31:35,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:31:35,650 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:31:35,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:31:35,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:31:35,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:31:35,652 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:31:35,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:31:35,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:31:35,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:31:35,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:31:35,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:31:35,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:31:35,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:31:35,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:31:35,654 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:31:35,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:31:35,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:31:35,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:31:35,733 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:31:35,733 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:31:35,734 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-09-16 16:31:35,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b22fb62e5/55889906899647ef878815a711bd3600/FLAG728d4fbf7 [2019-09-16 16:31:36,365 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:31:36,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/min_max.i [2019-09-16 16:31:36,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b22fb62e5/55889906899647ef878815a711bd3600/FLAG728d4fbf7 [2019-09-16 16:31:36,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b22fb62e5/55889906899647ef878815a711bd3600 [2019-09-16 16:31:36,646 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:31:36,648 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:31:36,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:31:36,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:31:36,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:31:36,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:31:36" (1/1) ... [2019-09-16 16:31:36,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f462b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:31:36, skipping insertion in model container [2019-09-16 16:31:36,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:31:36" (1/1) ... [2019-09-16 16:31:36,665 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:31:36,715 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:31:37,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:31:37,142 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:31:37,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:31:37,257 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:31:37,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:31:37 WrapperNode [2019-09-16 16:31:37,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:31:37,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:31:37,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:31:37,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:31:37,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:31:37" (1/1) ... [2019-09-16 16:31:37,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:31:37" (1/1) ... [2019-09-16 16:31:37,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:31:37" (1/1) ... [2019-09-16 16:31:37,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:31:37" (1/1) ... [2019-09-16 16:31:37,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:31:37" (1/1) ... [2019-09-16 16:31:37,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:31:37" (1/1) ... [2019-09-16 16:31:37,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:31:37" (1/1) ... [2019-09-16 16:31:37,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:31:37,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:31:37,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:31:37,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:31:37,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:31:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:31:37,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:31:37,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:31:37,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-16 16:31:37,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-16 16:31:37,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:31:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:31:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:31:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-16 16:31:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-16 16:31:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-16 16:31:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-16 16:31:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-16 16:31:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-16 16:31:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-16 16:31:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-16 16:31:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-16 16:31:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-16 16:31:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-16 16:31:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-16 16:31:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-16 16:31:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-16 16:31:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-16 16:31:37,395 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-16 16:31:37,395 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-16 16:31:37,395 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-16 16:31:37,395 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-16 16:31:37,395 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-16 16:31:37,395 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-16 16:31:37,396 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-16 16:31:37,396 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-16 16:31:37,396 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-16 16:31:37,396 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-16 16:31:37,396 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-16 16:31:37,396 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-16 16:31:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-16 16:31:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-16 16:31:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-16 16:31:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-16 16:31:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-16 16:31:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-16 16:31:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-16 16:31:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-16 16:31:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-16 16:31:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-16 16:31:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-16 16:31:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-16 16:31:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-16 16:31:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-16 16:31:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-16 16:31:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-16 16:31:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-16 16:31:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-16 16:31:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-16 16:31:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-16 16:31:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-16 16:31:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-16 16:31:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-16 16:31:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-16 16:31:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-16 16:31:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 16:31:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 16:31:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-16 16:31:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-16 16:31:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-16 16:31:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-16 16:31:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-16 16:31:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-16 16:31:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-16 16:31:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-16 16:31:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-16 16:31:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-16 16:31:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-16 16:31:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-16 16:31:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-16 16:31:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-16 16:31:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-16 16:31:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-16 16:31:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-16 16:31:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-16 16:31:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-16 16:31:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-16 16:31:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-16 16:31:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-16 16:31:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-16 16:31:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-16 16:31:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-16 16:31:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-16 16:31:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-16 16:31:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-16 16:31:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-16 16:31:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-16 16:31:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-16 16:31:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-16 16:31:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-16 16:31:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-16 16:31:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-16 16:31:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-16 16:31:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-16 16:31:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-16 16:31:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-16 16:31:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-16 16:31:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-16 16:31:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-16 16:31:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-16 16:31:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-16 16:31:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-16 16:31:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-16 16:31:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-16 16:31:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-16 16:31:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-16 16:31:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-16 16:31:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-16 16:31:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:31:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 16:31:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 16:31:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 16:31:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 16:31:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 16:31:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:31:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:31:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:31:37,872 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:31:37,872 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-16 16:31:37,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:31:37 BoogieIcfgContainer [2019-09-16 16:31:37,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:31:37,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:31:37,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:31:37,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:31:37,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:31:36" (1/3) ... [2019-09-16 16:31:37,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d82ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:31:37, skipping insertion in model container [2019-09-16 16:31:37,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:31:37" (2/3) ... [2019-09-16 16:31:37,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d82ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:31:37, skipping insertion in model container [2019-09-16 16:31:37,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:31:37" (3/3) ... [2019-09-16 16:31:37,882 INFO L109 eAbstractionObserver]: Analyzing ICFG min_max.i [2019-09-16 16:31:37,893 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:31:37,901 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-16 16:31:37,918 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-16 16:31:37,944 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:31:37,945 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:31:37,945 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:31:37,945 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:31:37,947 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:31:37,947 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:31:37,948 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:31:37,956 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:31:37,956 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:31:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-16 16:31:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-16 16:31:37,987 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:37,988 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:31:37,992 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:37,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:37,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1192142104, now seen corresponding path program 1 times [2019-09-16 16:31:37,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:37,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:38,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:38,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:38,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:38,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:31:38,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-16 16:31:38,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 16:31:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 16:31:38,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:31:38,165 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-16 16:31:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:38,187 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-09-16 16:31:38,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 16:31:38,188 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-09-16 16:31:38,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:38,198 INFO L225 Difference]: With dead ends: 39 [2019-09-16 16:31:38,198 INFO L226 Difference]: Without dead ends: 21 [2019-09-16 16:31:38,202 INFO L636 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-09-16 16:31:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-16 16:31:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-16 16:31:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-16 16:31:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-09-16 16:31:38,242 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2019-09-16 16:31:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:38,243 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-09-16 16:31:38,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 16:31:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-09-16 16:31:38,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-16 16:31:38,244 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:38,244 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:31:38,244 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:38,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:38,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1107899532, now seen corresponding path program 1 times [2019-09-16 16:31:38,245 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:38,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:38,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:38,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:38,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:38,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:31:38,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:31:38,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:31:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:31:38,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:31:38,379 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 4 states. [2019-09-16 16:31:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:38,423 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-16 16:31:38,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:31:38,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-16 16:31:38,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:38,425 INFO L225 Difference]: With dead ends: 34 [2019-09-16 16:31:38,425 INFO L226 Difference]: Without dead ends: 23 [2019-09-16 16:31:38,426 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:31:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-16 16:31:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-16 16:31:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-16 16:31:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-16 16:31:38,432 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 12 [2019-09-16 16:31:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:38,432 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-16 16:31:38,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:31:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-16 16:31:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 16:31:38,433 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:38,434 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:31:38,434 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:38,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:38,434 INFO L82 PathProgramCache]: Analyzing trace with hash 897845277, now seen corresponding path program 1 times [2019-09-16 16:31:38,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:38,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:38,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:38,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:38,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:38,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:31:38,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-16 16:31:38,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:31:38,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:31:38,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:31:38,648 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 7 states. [2019-09-16 16:31:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:38,835 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-09-16 16:31:38,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:31:38,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-09-16 16:31:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:38,838 INFO L225 Difference]: With dead ends: 32 [2019-09-16 16:31:38,838 INFO L226 Difference]: Without dead ends: 30 [2019-09-16 16:31:38,838 INFO L636 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-09-16 16:31:38,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-16 16:31:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-09-16 16:31:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-16 16:31:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-16 16:31:38,844 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2019-09-16 16:31:38,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:38,845 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-16 16:31:38,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:31:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-16 16:31:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 16:31:38,846 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:38,846 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:31:38,846 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:38,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash -458989665, now seen corresponding path program 1 times [2019-09-16 16:31:38,847 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:38,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:38,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:38,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:38,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:39,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:31:39,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 16:31:39,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:31:39,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:31:39,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:31:39,090 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 8 states. [2019-09-16 16:31:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:39,303 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-09-16 16:31:39,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:31:39,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-09-16 16:31:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:39,305 INFO L225 Difference]: With dead ends: 44 [2019-09-16 16:31:39,305 INFO L226 Difference]: Without dead ends: 42 [2019-09-16 16:31:39,305 INFO L636 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-09-16 16:31:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-16 16:31:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-09-16 16:31:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-16 16:31:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-16 16:31:39,312 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-09-16 16:31:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:39,312 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-16 16:31:39,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:31:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-16 16:31:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 16:31:39,314 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:39,314 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:31:39,314 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:39,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash 221068705, now seen corresponding path program 1 times [2019-09-16 16:31:39,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:39,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:39,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:39,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:39,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:39,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:31:39,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-16 16:31:39,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:31:39,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:31:39,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:31:39,537 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2019-09-16 16:31:39,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:39,739 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-16 16:31:39,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:31:39,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-09-16 16:31:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:39,740 INFO L225 Difference]: With dead ends: 37 [2019-09-16 16:31:39,740 INFO L226 Difference]: Without dead ends: 35 [2019-09-16 16:31:39,741 INFO L636 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-09-16 16:31:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-16 16:31:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-09-16 16:31:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-16 16:31:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-16 16:31:39,746 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2019-09-16 16:31:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:39,746 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-16 16:31:39,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:31:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-16 16:31:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 16:31:39,747 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:39,748 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:31:39,748 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1418643305, now seen corresponding path program 1 times [2019-09-16 16:31:39,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:39,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:39,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:39,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:39,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:39,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:39,873 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-09-16 16:31:40,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:40,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-16 16:31:40,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:40,118 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-09-16 16:31:40,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:40,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:40,133 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-09-16 16:31:40,134 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:40,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:40,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:40,140 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-09-16 16:31:40,154 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-09-16 16:31:40,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:40,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:40,172 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-09-16 16:31:40,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:40,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:40,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:40,181 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-09-16 16:31:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:40,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:31:40,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-09-16 16:31:40,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:31:40,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:31:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:31:40,191 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 7 states. [2019-09-16 16:31:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:40,312 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-09-16 16:31:40,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:31:40,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-16 16:31:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:40,314 INFO L225 Difference]: With dead ends: 48 [2019-09-16 16:31:40,314 INFO L226 Difference]: Without dead ends: 32 [2019-09-16 16:31:40,315 INFO L636 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-09-16 16:31:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-16 16:31:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-16 16:31:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-16 16:31:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-16 16:31:40,326 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2019-09-16 16:31:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:40,327 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-16 16:31:40,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:31:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-16 16:31:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:31:40,328 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:40,328 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:31:40,328 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:40,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:40,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1939400262, now seen corresponding path program 2 times [2019-09-16 16:31:40,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:40,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:40,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:40,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:40,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-16 16:31:40,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:40,485 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-09-16 16:31:40,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:31:40,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:31:40,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:31:40,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-16 16:31:40,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:40,629 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-09-16 16:31:40,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:40,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:40,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:40,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-16 16:31:40,668 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-09-16 16:31:40,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:40,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:40,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:40,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-09-16 16:31:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-16 16:31:40,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:31:40,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-09-16 16:31:40,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:31:40,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:31:40,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:31:40,682 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 9 states. [2019-09-16 16:31:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:40,876 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-09-16 16:31:40,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:31:40,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-09-16 16:31:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:40,877 INFO L225 Difference]: With dead ends: 90 [2019-09-16 16:31:40,877 INFO L226 Difference]: Without dead ends: 71 [2019-09-16 16:31:40,878 INFO L636 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-09-16 16:31:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-16 16:31:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-09-16 16:31:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-16 16:31:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-09-16 16:31:40,885 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2019-09-16 16:31:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:40,885 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-09-16 16:31:40,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:31:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-09-16 16:31:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:31:40,886 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:40,887 INFO L407 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-09-16 16:31:40,887 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:40,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1681234824, now seen corresponding path program 1 times [2019-09-16 16:31:40,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:40,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:40,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:40,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:31:40,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:41,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:41,118 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-09-16 16:31:41,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:41,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-16 16:31:41,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:41,262 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-09-16 16:31:41,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:41,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:41,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:41,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:31:41,323 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:41,324 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-09-16 16:31:41,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:41,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:41,353 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_9|, |v_#memory_$Pointer$.base_9|], 4=[|v_#memory_int_11|]} [2019-09-16 16:31:41,360 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-09-16 16:31:41,360 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:41,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:41,388 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-09-16 16:31:41,388 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:41,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:41,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:41,423 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-09-16 16:31:41,424 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:41,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:41,445 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-09-16 16:31:41,445 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:75, output treesize:42 [2019-09-16 16:31:41,554 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-09-16 16:31:41,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:41,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:41,572 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-09-16 16:31:41,573 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:41,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:41,584 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-09-16 16:31:41,584 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:32 [2019-09-16 16:31:41,653 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-09-16 16:31:41,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:41,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:41,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:41,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-09-16 16:31:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:41,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:31:41,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-09-16 16:31:41,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-16 16:31:41,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-16 16:31:41,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-16 16:31:41,675 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 16 states. [2019-09-16 16:31:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:42,330 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-09-16 16:31:42,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:31:42,330 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-09-16 16:31:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:42,332 INFO L225 Difference]: With dead ends: 71 [2019-09-16 16:31:42,332 INFO L226 Difference]: Without dead ends: 69 [2019-09-16 16:31:42,333 INFO L636 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-09-16 16:31:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-16 16:31:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2019-09-16 16:31:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-16 16:31:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-09-16 16:31:42,342 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 27 [2019-09-16 16:31:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:42,342 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-09-16 16:31:42,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-16 16:31:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-09-16 16:31:42,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:31:42,344 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:42,344 INFO L407 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-09-16 16:31:42,344 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1344449784, now seen corresponding path program 1 times [2019-09-16 16:31:42,344 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:42,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:42,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:42,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:42,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:42,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:42,528 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-09-16 16:31:42,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:42,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-16 16:31:42,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:42,631 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-09-16 16:31:42,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:42,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:42,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:42,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:31:42,700 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:42,700 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-09-16 16:31:42,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:42,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:42,720 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_10|, |v_#memory_$Pointer$.base_10|], 4=[|v_#memory_int_12|]} [2019-09-16 16:31:42,727 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-09-16 16:31:42,727 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:42,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:42,747 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-09-16 16:31:42,747 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:42,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:42,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:42,770 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-09-16 16:31:42,770 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:42,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:42,786 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-09-16 16:31:42,786 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-09-16 16:31:42,844 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-09-16 16:31:42,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:42,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:42,854 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-09-16 16:31:42,854 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:42,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:42,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:42,861 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-09-16 16:31:42,883 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-09-16 16:31:42,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:42,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:42,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:42,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-16 16:31:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:42,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:31:42,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-09-16 16:31:42,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 16:31:42,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 16:31:42,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-16 16:31:42,894 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 14 states. [2019-09-16 16:31:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:43,494 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-09-16 16:31:43,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 16:31:43,495 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-09-16 16:31:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:43,496 INFO L225 Difference]: With dead ends: 65 [2019-09-16 16:31:43,497 INFO L226 Difference]: Without dead ends: 63 [2019-09-16 16:31:43,498 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-09-16 16:31:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-16 16:31:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-09-16 16:31:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-16 16:31:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-09-16 16:31:43,505 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2019-09-16 16:31:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:43,505 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-09-16 16:31:43,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 16:31:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-09-16 16:31:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:31:43,507 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:43,507 INFO L407 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-09-16 16:31:43,507 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:43,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:43,507 INFO L82 PathProgramCache]: Analyzing trace with hash -758836934, now seen corresponding path program 1 times [2019-09-16 16:31:43,507 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:43,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:43,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:43,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:43,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:43,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:43,724 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-09-16 16:31:43,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:43,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-16 16:31:43,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:43,856 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-09-16 16:31:43,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:43,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:43,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:43,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:31:43,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:43,894 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-09-16 16:31:43,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:43,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:43,913 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_11|, |v_#memory_$Pointer$.base_11|], 4=[|v_#memory_int_13|]} [2019-09-16 16:31:43,918 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-09-16 16:31:43,918 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:43,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:43,937 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-09-16 16:31:43,937 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:43,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:43,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:43,955 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-09-16 16:31:43,955 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:43,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:43,967 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-09-16 16:31:43,967 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-09-16 16:31:44,027 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-09-16 16:31:44,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:44,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:44,037 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-09-16 16:31:44,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:44,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:44,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:44,049 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-09-16 16:31:44,074 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-09-16 16:31:44,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:44,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:44,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:44,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-16 16:31:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:44,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:31:44,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-09-16 16:31:44,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 16:31:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 16:31:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-16 16:31:44,088 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2019-09-16 16:31:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:44,792 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2019-09-16 16:31:44,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-16 16:31:44,793 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-09-16 16:31:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:44,794 INFO L225 Difference]: With dead ends: 92 [2019-09-16 16:31:44,794 INFO L226 Difference]: Without dead ends: 90 [2019-09-16 16:31:44,795 INFO L636 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-09-16 16:31:44,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-16 16:31:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2019-09-16 16:31:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-16 16:31:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-09-16 16:31:44,804 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 29 [2019-09-16 16:31:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:44,804 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-09-16 16:31:44,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 16:31:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-09-16 16:31:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:31:44,805 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:44,805 INFO L407 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-09-16 16:31:44,806 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:44,806 INFO L82 PathProgramCache]: Analyzing trace with hash -768788038, now seen corresponding path program 1 times [2019-09-16 16:31:44,806 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:44,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:44,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:44,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:44,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:45,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:45,050 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-09-16 16:31:45,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:45,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-16 16:31:45,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:45,177 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-09-16 16:31:45,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:45,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:45,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:45,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:31:45,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:45,210 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-09-16 16:31:45,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:45,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:45,232 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_12|, |v_#memory_$Pointer$.offset_12|], 4=[|v_#memory_int_14|]} [2019-09-16 16:31:45,237 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-09-16 16:31:45,237 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:45,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:45,260 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-09-16 16:31:45,260 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:45,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:45,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:45,284 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-09-16 16:31:45,284 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:45,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:45,299 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-09-16 16:31:45,300 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:33 [2019-09-16 16:31:45,445 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-09-16 16:31:45,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:45,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:45,463 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-09-16 16:31:45,463 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:45,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:45,472 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-09-16 16:31:45,472 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:32 [2019-09-16 16:31:45,515 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-09-16 16:31:45,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:45,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:45,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:45,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-09-16 16:31:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:45,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:31:45,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2019-09-16 16:31:45,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-16 16:31:45,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-16 16:31:45,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-16 16:31:45,536 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 18 states. [2019-09-16 16:31:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:46,439 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2019-09-16 16:31:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-16 16:31:46,440 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-09-16 16:31:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:46,442 INFO L225 Difference]: With dead ends: 113 [2019-09-16 16:31:46,442 INFO L226 Difference]: Without dead ends: 111 [2019-09-16 16:31:46,443 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2019-09-16 16:31:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-16 16:31:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2019-09-16 16:31:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-16 16:31:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-09-16 16:31:46,453 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 29 [2019-09-16 16:31:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:46,453 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-09-16 16:31:46,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-16 16:31:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-09-16 16:31:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:31:46,454 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:46,454 INFO L407 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-09-16 16:31:46,455 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:46,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1436663426, now seen corresponding path program 2 times [2019-09-16 16:31:46,455 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:46,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:46,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:46,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:46,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:31:46,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:46,530 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-09-16 16:31:46,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:31:46,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:31:46,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:31:46,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-16 16:31:46,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:46,659 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-09-16 16:31:46,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:46,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:46,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:46,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-16 16:31:46,682 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-09-16 16:31:46,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:46,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:46,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:46,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-09-16 16:31:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:31:46,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:31:46,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-09-16 16:31:46,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 16:31:46,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 16:31:46,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:31:46,694 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 10 states. [2019-09-16 16:31:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:46,932 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2019-09-16 16:31:46,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 16:31:46,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-09-16 16:31:46,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:46,935 INFO L225 Difference]: With dead ends: 145 [2019-09-16 16:31:46,936 INFO L226 Difference]: Without dead ends: 100 [2019-09-16 16:31:46,936 INFO L636 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-09-16 16:31:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-16 16:31:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 60. [2019-09-16 16:31:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-16 16:31:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-09-16 16:31:46,961 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 29 [2019-09-16 16:31:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:46,961 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-09-16 16:31:46,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 16:31:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-09-16 16:31:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:31:46,962 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:46,963 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:31:46,963 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:46,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1847186620, now seen corresponding path program 1 times [2019-09-16 16:31:46,963 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:46,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:46,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:46,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:31:46,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:47,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:47,191 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-09-16 16:31:47,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:47,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-16 16:31:47,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:47,299 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-09-16 16:31:47,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:47,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:47,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:47,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:31:47,326 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:47,327 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-09-16 16:31:47,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:47,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:47,342 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_13|, |v_#memory_$Pointer$.offset_13|], 4=[|v_#memory_int_15|]} [2019-09-16 16:31:47,347 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-09-16 16:31:47,347 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:47,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:47,364 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-09-16 16:31:47,365 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:47,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:47,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:47,383 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-09-16 16:31:47,384 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:47,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:47,395 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-09-16 16:31:47,395 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-09-16 16:31:47,445 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-09-16 16:31:47,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:47,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:47,455 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-09-16 16:31:47,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:47,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:47,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:47,462 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-09-16 16:31:47,483 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-09-16 16:31:47,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:47,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:47,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:47,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-16 16:31:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:47,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:31:47,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2019-09-16 16:31:47,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-16 16:31:47,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-16 16:31:47,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-09-16 16:31:47,494 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 15 states. [2019-09-16 16:31:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:48,627 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2019-09-16 16:31:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-16 16:31:48,627 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-09-16 16:31:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:48,629 INFO L225 Difference]: With dead ends: 92 [2019-09-16 16:31:48,629 INFO L226 Difference]: Without dead ends: 90 [2019-09-16 16:31:48,630 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-09-16 16:31:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-16 16:31:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2019-09-16 16:31:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-16 16:31:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2019-09-16 16:31:48,639 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 29 [2019-09-16 16:31:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:48,639 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2019-09-16 16:31:48,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-16 16:31:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2019-09-16 16:31:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:31:48,641 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:48,641 INFO L407 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-09-16 16:31:48,641 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:48,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1837235516, now seen corresponding path program 1 times [2019-09-16 16:31:48,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:48,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:48,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:48,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:48,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:48,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:48,902 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-09-16 16:31:48,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:49,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-16 16:31:49,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:49,020 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-09-16 16:31:49,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:49,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:49,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:49,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:31:49,071 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:49,072 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-09-16 16:31:49,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:49,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:49,099 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_14|, |v_#memory_$Pointer$.offset_14|], 4=[|v_#memory_int_16|]} [2019-09-16 16:31:49,106 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-09-16 16:31:49,106 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:49,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:49,132 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-09-16 16:31:49,132 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:49,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:49,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:49,164 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-09-16 16:31:49,164 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:49,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:49,183 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-09-16 16:31:49,183 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:75, output treesize:42 [2019-09-16 16:31:49,334 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-09-16 16:31:49,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:49,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:49,348 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-09-16 16:31:49,348 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:49,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:49,359 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-09-16 16:31:49,360 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:30 [2019-09-16 16:31:49,399 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-09-16 16:31:49,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:49,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:49,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:49,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-09-16 16:31:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:49,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:31:49,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-09-16 16:31:49,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-16 16:31:49,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-16 16:31:49,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-16 16:31:49,438 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 21 states. [2019-09-16 16:31:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:52,009 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2019-09-16 16:31:52,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-16 16:31:52,010 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-09-16 16:31:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:52,011 INFO L225 Difference]: With dead ends: 135 [2019-09-16 16:31:52,012 INFO L226 Difference]: Without dead ends: 133 [2019-09-16 16:31:52,013 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=327, Invalid=1835, Unknown=0, NotChecked=0, Total=2162 [2019-09-16 16:31:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-16 16:31:52,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 39. [2019-09-16 16:31:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-16 16:31:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-09-16 16:31:52,020 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 29 [2019-09-16 16:31:52,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:52,020 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-09-16 16:31:52,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-16 16:31:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-09-16 16:31:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 16:31:52,022 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:52,022 INFO L407 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-09-16 16:31:52,022 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:52,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:52,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2094339090, now seen corresponding path program 2 times [2019-09-16 16:31:52,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:52,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:52,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:52,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:52,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:52,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:52,174 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-09-16 16:31:52,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:31:52,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:31:52,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:31:52,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-16 16:31:52,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:52,345 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-09-16 16:31:52,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:52,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:52,362 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-09-16 16:31:52,363 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:52,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:52,378 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-09-16 16:31:52,379 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:52,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:52,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:52,410 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2019-09-16 16:31:52,434 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:52,435 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-09-16 16:31:52,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:52,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:52,490 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-09-16 16:31:52,491 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:52,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:52,526 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-09-16 16:31:52,527 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:52,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:52,558 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-09-16 16:31:52,559 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:52,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:52,585 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-09-16 16:31:52,585 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:52,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:52,603 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-09-16 16:31:52,604 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:85, output treesize:39 [2019-09-16 16:31:52,749 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:52,749 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-09-16 16:31:52,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:31:52,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:31:52,755 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:52,775 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-09-16 16:31:52,783 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-09-16 16:31:52,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:52,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:52,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:52,790 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-09-16 16:31:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:52,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:31:52,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-09-16 16:31:52,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-16 16:31:52,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-16 16:31:52,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-16 16:31:52,811 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 13 states. [2019-09-16 16:31:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:53,195 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-16 16:31:53,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:31:53,196 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-09-16 16:31:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:53,197 INFO L225 Difference]: With dead ends: 67 [2019-09-16 16:31:53,197 INFO L226 Difference]: Without dead ends: 46 [2019-09-16 16:31:53,197 INFO L636 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-09-16 16:31:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-16 16:31:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-16 16:31:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-16 16:31:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-09-16 16:31:53,203 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 32 [2019-09-16 16:31:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:53,203 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-09-16 16:31:53,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-16 16:31:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-09-16 16:31:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-16 16:31:53,204 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:53,204 INFO L407 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-09-16 16:31:53,205 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:53,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:53,205 INFO L82 PathProgramCache]: Analyzing trace with hash 934068797, now seen corresponding path program 3 times [2019-09-16 16:31:53,205 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:53,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:53,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:53,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:31:53,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:53,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:53,668 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-09-16 16:31:53,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:31:53,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-16 16:31:53,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:31:53,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-16 16:31:53,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:53,800 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-09-16 16:31:53,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:53,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:53,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:53,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:31:53,890 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:53,891 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-09-16 16:31:53,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:53,952 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.7 percent of original size [2019-09-16 16:31:53,954 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_18|], 4=[|v_#memory_int_17|]} [2019-09-16 16:31:53,969 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-09-16 16:31:53,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:53,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:53,994 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-09-16 16:31:53,994 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:54,018 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-09-16 16:31:54,018 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,037 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-09-16 16:31:54,037 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:44 [2019-09-16 16:31:54,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,113 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-09-16 16:31:54,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,168 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-09-16 16:31:54,174 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:54,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,222 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:54,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:54,267 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-09-16 16:31:54,267 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,331 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-09-16 16:31:54,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:54,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:54,338 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-09-16 16:31:54,339 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:54,377 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-09-16 16:31:54,377 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,405 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-09-16 16:31:54,406 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:135, output treesize:71 [2019-09-16 16:31:54,801 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-16 16:31:54,802 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-09-16 16:31:54,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:31:54,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:31:54,806 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:54,865 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.3 percent of original size [2019-09-16 16:31:54,875 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,876 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-09-16 16:31:54,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,890 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-09-16 16:31:54,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:26 [2019-09-16 16:31:54,937 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-09-16 16:31:54,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-16 16:31:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:31:54,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:31:54,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-09-16 16:31:54,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-16 16:31:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-16 16:31:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2019-09-16 16:31:54,992 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 26 states. [2019-09-16 16:31:56,630 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-16 16:31:57,417 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-16 16:31:57,608 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-16 16:31:57,851 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-16 16:31:58,210 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-16 16:31:58,407 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-16 16:31:58,645 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-09-16 16:31:59,072 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-16 16:31:59,417 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-16 16:31:59,871 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-09-16 16:32:00,190 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-16 16:32:00,480 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-16 16:32:00,792 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-16 16:32:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:32:01,229 INFO L93 Difference]: Finished difference Result 279 states and 305 transitions. [2019-09-16 16:32:01,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-16 16:32:01,229 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2019-09-16 16:32:01,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:32:01,231 INFO L225 Difference]: With dead ends: 279 [2019-09-16 16:32:01,231 INFO L226 Difference]: Without dead ends: 277 [2019-09-16 16:32:01,234 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=566, Invalid=3340, Unknown=0, NotChecked=0, Total=3906 [2019-09-16 16:32:01,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-16 16:32:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 93. [2019-09-16 16:32:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-16 16:32:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2019-09-16 16:32:01,248 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 37 [2019-09-16 16:32:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:32:01,249 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2019-09-16 16:32:01,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-16 16:32:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2019-09-16 16:32:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-16 16:32:01,250 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:32:01,250 INFO L407 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-09-16 16:32:01,250 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:32:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:32:01,251 INFO L82 PathProgramCache]: Analyzing trace with hash 833472957, now seen corresponding path program 1 times [2019-09-16 16:32:01,251 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:32:01,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:32:01,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:01,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:32:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:32:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:32:01,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:32:01,591 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-09-16 16:32:01,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:32:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:32:01,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-16 16:32:01,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:32:01,730 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-09-16 16:32:01,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:01,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:01,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:01,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:32:01,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:01,800 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-09-16 16:32:01,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:01,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:01,837 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|], 4=[|v_#memory_int_19|]} [2019-09-16 16:32:01,842 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-09-16 16:32:01,842 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:01,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:01,874 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-09-16 16:32:01,874 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:01,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:01,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:01,912 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-09-16 16:32:01,912 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:01,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:01,936 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-09-16 16:32:01,937 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:85, output treesize:56 [2019-09-16 16:32:02,035 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-09-16 16:32:02,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:02,058 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-09-16 16:32:02,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:02,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:02,107 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:02,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:02,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:02,159 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:02,160 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-09-16 16:32:02,161 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:02,235 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.1 percent of original size [2019-09-16 16:32:02,257 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:02,257 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-09-16 16:32:02,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,260 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:02,339 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.1 percent of original size [2019-09-16 16:32:02,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:02,348 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:32:02,376 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:02,377 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-09-16 16:32:02,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,382 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:02,524 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-16 16:32:02,525 INFO L567 ElimStorePlain]: treesize reduction 34, result has 79.6 percent of original size [2019-09-16 16:32:02,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,529 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-09-16 16:32:02,529 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:132, output treesize:143 [2019-09-16 16:32:02,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:02,899 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-16 16:32:02,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:32:03,068 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-16 16:32:03,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:32:03,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:32:03,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:03,382 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-09-16 16:32:03,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:03,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:32:03,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:03,401 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-09-16 16:32:03,402 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:03,423 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-16 16:32:03,424 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-09-16 16:32:03,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:03,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:03,427 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:03,520 INFO L567 ElimStorePlain]: treesize reduction 12, result has 92.7 percent of original size [2019-09-16 16:32:03,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:03,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:03,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, 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-09-16 16:32:03,537 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:03,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:03,553 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:03,553 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-09-16 16:32:03,554 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:03,564 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:03,564 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-09-16 16:32:03,565 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:03,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:03,600 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-09-16 16:32:03,600 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:270, output treesize:88 [2019-09-16 16:32:03,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:32:03,698 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_4, |#memory_int|], 3=[v_prenex_6]} [2019-09-16 16:32:03,706 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:03,707 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-09-16 16:32:03,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:03,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:03,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:03,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:03,746 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-09-16 16:32:03,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:03,748 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:03,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:03,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:03,788 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-09-16 16:32:03,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:03,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:03,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:03,791 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:03,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:03,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-16 16:32:03,823 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:100, output treesize:11 [2019-09-16 16:32:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:32:03,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:32:03,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-09-16 16:32:03,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-16 16:32:03,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-16 16:32:03,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2019-09-16 16:32:03,880 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand 25 states. [2019-09-16 16:32:05,239 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2019-09-16 16:32:05,475 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-16 16:32:05,750 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-09-16 16:32:06,177 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2019-09-16 16:32:06,597 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2019-09-16 16:32:07,697 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 125 [2019-09-16 16:32:08,269 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-09-16 16:32:08,635 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 153 [2019-09-16 16:32:09,651 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-16 16:32:10,030 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 155 [2019-09-16 16:32:10,761 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-16 16:32:11,057 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 99 [2019-09-16 16:32:11,305 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-16 16:32:11,898 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-16 16:32:12,212 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 101 [2019-09-16 16:32:13,280 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-16 16:32:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:32:13,651 INFO L93 Difference]: Finished difference Result 453 states and 500 transitions. [2019-09-16 16:32:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-16 16:32:13,651 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-09-16 16:32:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:32:13,654 INFO L225 Difference]: With dead ends: 453 [2019-09-16 16:32:13,654 INFO L226 Difference]: Without dead ends: 451 [2019-09-16 16:32:13,656 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1963 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1163, Invalid=6147, Unknown=0, NotChecked=0, Total=7310 [2019-09-16 16:32:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-16 16:32:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 120. [2019-09-16 16:32:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-16 16:32:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2019-09-16 16:32:13,675 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 37 [2019-09-16 16:32:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:32:13,675 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2019-09-16 16:32:13,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-16 16:32:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2019-09-16 16:32:13,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-16 16:32:13,676 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:32:13,676 INFO L407 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-09-16 16:32:13,677 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:32:13,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:32:13,677 INFO L82 PathProgramCache]: Analyzing trace with hash 581200573, now seen corresponding path program 2 times [2019-09-16 16:32:13,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:32:13,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:32:13,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:13,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:32:13,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:32:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:32:13,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:32:13,947 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-09-16 16:32:14,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:32:14,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:32:14,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:32:14,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-16 16:32:14,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:32:14,078 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-09-16 16:32:14,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:32:14,173 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,174 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-09-16 16:32:14,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,222 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-09-16 16:32:14,225 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|], 4=[|v_#memory_int_21|]} [2019-09-16 16:32:14,230 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-09-16 16:32:14,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,254 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-09-16 16:32:14,254 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:14,286 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-09-16 16:32:14,287 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,301 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-09-16 16:32:14,301 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:41 [2019-09-16 16:32:14,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,357 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-09-16 16:32:14,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,420 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-09-16 16:32:14,428 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-09-16 16:32:14,428 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,481 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-09-16 16:32:14,482 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,543 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-09-16 16:32:14,543 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,584 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-09-16 16:32:14,585 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:14,635 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-09-16 16:32:14,636 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,664 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-09-16 16:32:14,665 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:144, output treesize:97 [2019-09-16 16:32:14,934 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,934 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-09-16 16:32:14,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:14,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:14,937 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:14,972 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.1 percent of original size [2019-09-16 16:32:14,977 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-09-16 16:32:14,977 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:14,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:14,994 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-09-16 16:32:14,995 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:24 [2019-09-16 16:32:15,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:15,056 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-09-16 16:32:15,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:15,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:15,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:15,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:15,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-09-16 16:32:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:32:15,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:32:15,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2019-09-16 16:32:15,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-16 16:32:15,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-16 16:32:15,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-09-16 16:32:15,137 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand 22 states. [2019-09-16 16:32:15,876 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-09-16 16:32:16,036 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2019-09-16 16:32:16,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:32:16,567 INFO L93 Difference]: Finished difference Result 164 states and 197 transitions. [2019-09-16 16:32:16,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-16 16:32:16,568 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-09-16 16:32:16,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:32:16,569 INFO L225 Difference]: With dead ends: 164 [2019-09-16 16:32:16,569 INFO L226 Difference]: Without dead ends: 162 [2019-09-16 16:32:16,571 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2019-09-16 16:32:16,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-16 16:32:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 114. [2019-09-16 16:32:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-16 16:32:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 145 transitions. [2019-09-16 16:32:16,587 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 145 transitions. Word has length 37 [2019-09-16 16:32:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:32:16,587 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 145 transitions. [2019-09-16 16:32:16,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-16 16:32:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2019-09-16 16:32:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-16 16:32:16,588 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:32:16,588 INFO L407 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-09-16 16:32:16,588 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:32:16,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:32:16,589 INFO L82 PathProgramCache]: Analyzing trace with hash 480604733, now seen corresponding path program 2 times [2019-09-16 16:32:16,589 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:32:16,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:32:16,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:16,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:32:16,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:32:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:32:16,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:32:16,836 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-09-16 16:32:16,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:32:16,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:32:16,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:32:16,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-16 16:32:16,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:32:16,979 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-09-16 16:32:16,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:16,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:16,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:16,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:32:17,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:17,093 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-09-16 16:32:17,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:17,172 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.6 percent of original size [2019-09-16 16:32:17,173 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|], 4=[|v_#memory_int_23|]} [2019-09-16 16:32:17,179 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-09-16 16:32:17,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:17,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:17,217 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-09-16 16:32:17,218 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:17,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:17,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:17,254 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-09-16 16:32:17,254 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:17,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:17,276 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-09-16 16:32:17,277 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:79, output treesize:58 [2019-09-16 16:32:17,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:17,445 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-09-16 16:32:17,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:17,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:17,518 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-09-16 16:32:17,527 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-09-16 16:32:17,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:17,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:17,584 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:17,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:17,636 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-09-16 16:32:17,637 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:17,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:17,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:17,688 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-09-16 16:32:17,689 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:17,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:17,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:17,739 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-09-16 16:32:17,739 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:17,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:17,788 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-09-16 16:32:17,788 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:163, output treesize:140 [2019-09-16 16:32:18,136 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:18,137 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-09-16 16:32:18,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:18,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:18,139 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:18,172 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.6 percent of original size [2019-09-16 16:32:18,175 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-09-16 16:32:18,176 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:18,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:18,190 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-09-16 16:32:18,190 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:151, output treesize:49 [2019-09-16 16:32:18,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:18,248 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-09-16 16:32:18,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:18,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:18,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:18,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:18,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:3 [2019-09-16 16:32:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:32:18,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:32:18,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2019-09-16 16:32:18,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-16 16:32:18,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-16 16:32:18,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-09-16 16:32:18,280 INFO L87 Difference]: Start difference. First operand 114 states and 145 transitions. Second operand 24 states. [2019-09-16 16:32:20,321 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2019-09-16 16:32:20,462 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-09-16 16:32:20,783 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 49 [2019-09-16 16:32:21,196 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-16 16:32:21,396 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-09-16 16:32:21,544 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-09-16 16:32:21,735 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-16 16:32:21,976 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 75 [2019-09-16 16:32:22,156 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-16 16:32:22,296 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-16 16:32:22,442 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-16 16:32:22,665 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-16 16:32:22,871 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-16 16:32:23,033 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-09-16 16:32:23,239 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-16 16:32:23,513 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 77 [2019-09-16 16:32:23,698 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-16 16:32:23,871 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-16 16:32:24,065 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-16 16:32:24,482 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-16 16:32:24,682 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-16 16:32:25,006 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-16 16:32:25,239 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 82 [2019-09-16 16:32:25,422 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-16 16:32:25,821 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-16 16:32:26,011 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-16 16:32:26,305 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-16 16:32:26,525 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 84 [2019-09-16 16:32:26,692 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-16 16:32:27,551 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-16 16:32:27,742 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73 [2019-09-16 16:32:28,630 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-16 16:32:28,835 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2019-09-16 16:32:29,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:32:29,515 INFO L93 Difference]: Finished difference Result 397 states and 441 transitions. [2019-09-16 16:32:29,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-16 16:32:29,516 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2019-09-16 16:32:29,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:32:29,518 INFO L225 Difference]: With dead ends: 397 [2019-09-16 16:32:29,518 INFO L226 Difference]: Without dead ends: 395 [2019-09-16 16:32:29,521 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2852 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1960, Invalid=7352, Unknown=0, NotChecked=0, Total=9312 [2019-09-16 16:32:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-16 16:32:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 49. [2019-09-16 16:32:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-16 16:32:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-09-16 16:32:29,534 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 37 [2019-09-16 16:32:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:32:29,534 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-09-16 16:32:29,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-16 16:32:29,535 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-09-16 16:32:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-16 16:32:29,535 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:32:29,535 INFO L407 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-09-16 16:32:29,536 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:32:29,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:32:29,536 INFO L82 PathProgramCache]: Analyzing trace with hash -7925313, now seen corresponding path program 3 times [2019-09-16 16:32:29,536 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:32:29,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:32:29,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:29,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:32:29,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:32:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:32:29,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:32:29,882 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-09-16 16:32:30,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:32:30,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-16 16:32:30,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:32:30,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-16 16:32:30,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:32:30,097 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-09-16 16:32:30,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:30,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:30,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:30,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:32:30,152 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:30,152 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-09-16 16:32:30,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:30,230 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.7 percent of original size [2019-09-16 16:32:30,232 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|], 4=[|v_#memory_int_25|]} [2019-09-16 16:32:30,239 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-09-16 16:32:30,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:30,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:30,273 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-09-16 16:32:30,273 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:30,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:30,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:30,311 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-09-16 16:32:30,312 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:30,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:30,331 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-09-16 16:32:30,332 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:44 [2019-09-16 16:32:30,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:30,419 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-09-16 16:32:30,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:30,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:30,474 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-09-16 16:32:30,485 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-09-16 16:32:30,485 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:30,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:30,524 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:30,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:30,558 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-09-16 16:32:30,559 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:30,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:30,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:30,605 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-09-16 16:32:30,606 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:30,651 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.3 percent of original size [2019-09-16 16:32:30,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:30,657 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-09-16 16:32:30,657 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:30,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:30,680 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-09-16 16:32:30,680 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:129, output treesize:65 [2019-09-16 16:32:30,870 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-16 16:32:30,871 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-09-16 16:32:30,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:30,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:30,873 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:30,957 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.8 percent of original size [2019-09-16 16:32:30,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:30,976 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-09-16 16:32:30,976 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:31,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:31,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:31,005 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:11 [2019-09-16 16:32:31,018 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-09-16 16:32:31,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:31,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:31,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:31,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-16 16:32:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:32:31,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:32:31,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2019-09-16 16:32:31,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-16 16:32:31,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-16 16:32:31,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-16 16:32:31,033 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 18 states. [2019-09-16 16:32:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:32:32,878 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2019-09-16 16:32:32,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-16 16:32:32,879 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2019-09-16 16:32:32,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:32:32,880 INFO L225 Difference]: With dead ends: 147 [2019-09-16 16:32:32,880 INFO L226 Difference]: Without dead ends: 145 [2019-09-16 16:32:32,881 INFO L636 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-09-16 16:32:32,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-16 16:32:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 91. [2019-09-16 16:32:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-16 16:32:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2019-09-16 16:32:32,900 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 39 [2019-09-16 16:32:32,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:32:32,901 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2019-09-16 16:32:32,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-16 16:32:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2019-09-16 16:32:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-16 16:32:32,901 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:32:32,902 INFO L407 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-09-16 16:32:32,902 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:32:32,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:32:32,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2103720255, now seen corresponding path program 2 times [2019-09-16 16:32:32,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:32:32,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:32:32,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:32,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:32:32,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:32:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:32:33,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:32:33,258 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-09-16 16:32:33,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:32:33,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:32:33,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:32:33,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-16 16:32:33,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:32:33,393 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-09-16 16:32:33,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:33,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:33,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:33,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:32:33,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:33,436 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-09-16 16:32:33,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:33,495 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-09-16 16:32:33,496 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|], 4=[|v_#memory_int_27|]} [2019-09-16 16:32:33,500 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-09-16 16:32:33,501 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:33,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:33,525 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-09-16 16:32:33,525 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:33,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:33,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:33,548 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-09-16 16:32:33,548 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:33,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:33,568 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-09-16 16:32:33,568 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:41 [2019-09-16 16:32:33,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:33,628 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-09-16 16:32:33,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:33,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:33,678 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-09-16 16:32:33,693 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-09-16 16:32:33,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:33,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:33,744 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-09-16 16:32:33,744 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:33,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:33,792 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-09-16 16:32:33,793 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:33,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:33,843 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-09-16 16:32:33,843 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:33,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:33,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:33,883 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-09-16 16:32:33,883 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:33,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:33,918 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-09-16 16:32:33,919 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:132, output treesize:85 [2019-09-16 16:32:34,323 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:34,323 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-09-16 16:32:34,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:34,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:34,325 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:34,359 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.7 percent of original size [2019-09-16 16:32:34,379 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-09-16 16:32:34,380 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:34,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:34,393 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-09-16 16:32:34,393 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:126, output treesize:32 [2019-09-16 16:32:34,452 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-09-16 16:32:34,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:34,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:34,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:34,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-09-16 16:32:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:32:34,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:32:34,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 23 [2019-09-16 16:32:34,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-16 16:32:34,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-16 16:32:34,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2019-09-16 16:32:34,495 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 23 states. [2019-09-16 16:32:35,435 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-16 16:32:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:32:36,266 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2019-09-16 16:32:36,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-16 16:32:36,266 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-09-16 16:32:36,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:32:36,268 INFO L225 Difference]: With dead ends: 173 [2019-09-16 16:32:36,268 INFO L226 Difference]: Without dead ends: 171 [2019-09-16 16:32:36,269 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2019-09-16 16:32:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-16 16:32:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 93. [2019-09-16 16:32:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-16 16:32:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2019-09-16 16:32:36,290 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 39 [2019-09-16 16:32:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:32:36,290 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2019-09-16 16:32:36,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-16 16:32:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2019-09-16 16:32:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-16 16:32:36,291 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:32:36,291 INFO L407 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-09-16 16:32:36,292 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:32:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:32:36,292 INFO L82 PathProgramCache]: Analyzing trace with hash 188127807, now seen corresponding path program 3 times [2019-09-16 16:32:36,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:32:36,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:32:36,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:36,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:32:36,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:32:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:32:36,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:32:36,672 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-09-16 16:32:36,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:32:36,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-16 16:32:36,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:32:36,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-16 16:32:36,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:32:36,842 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-09-16 16:32:36,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:36,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:36,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:36,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:32:36,904 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:36,905 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-09-16 16:32:36,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:37,001 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.4 percent of original size [2019-09-16 16:32:37,003 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|], 4=[|v_#memory_int_29|]} [2019-09-16 16:32:37,010 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-09-16 16:32:37,010 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:37,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:37,052 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-09-16 16:32:37,052 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:37,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:37,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:37,098 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-09-16 16:32:37,098 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:37,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:37,129 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-09-16 16:32:37,129 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:84, output treesize:59 [2019-09-16 16:32:37,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:37,303 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-09-16 16:32:37,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:37,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:37,356 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-09-16 16:32:37,366 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:37,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:37,411 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:37,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:37,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:37,454 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-09-16 16:32:37,454 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:37,513 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.2 percent of original size [2019-09-16 16:32:37,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:37,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:37,519 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-09-16 16:32:37,520 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:37,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:37,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:37,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:37,556 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-09-16 16:32:37,556 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:37,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:37,581 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-09-16 16:32:37,581 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:140, output treesize:84 [2019-09-16 16:32:37,746 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-16 16:32:37,746 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-09-16 16:32:37,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:37,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:37,748 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:37,782 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.3 percent of original size [2019-09-16 16:32:37,789 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:37,790 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-09-16 16:32:37,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:37,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:37,802 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-09-16 16:32:37,802 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:26 [2019-09-16 16:32:37,856 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-09-16 16:32:37,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:37,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:37,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:37,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-16 16:32:37,909 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-09-16 16:32:37,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:32:37,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2019-09-16 16:32:37,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-16 16:32:37,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-16 16:32:37,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2019-09-16 16:32:37,917 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand 25 states. [2019-09-16 16:32:40,926 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-09-16 16:32:41,168 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2019-09-16 16:32:41,362 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-16 16:32:41,537 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-16 16:32:41,690 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-16 16:32:42,364 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-16 16:32:42,574 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 87 [2019-09-16 16:32:42,725 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-09-16 16:32:43,369 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 89 [2019-09-16 16:32:43,737 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2019-09-16 16:32:43,942 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 90 [2019-09-16 16:32:44,099 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-16 16:32:44,712 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-16 16:32:44,899 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-16 16:32:45,041 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-16 16:32:45,496 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-16 16:32:45,697 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-09-16 16:32:45,849 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-16 16:32:46,037 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-16 16:32:46,251 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-16 16:32:46,449 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-16 16:32:46,595 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-16 16:32:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:32:47,341 INFO L93 Difference]: Finished difference Result 500 states and 547 transitions. [2019-09-16 16:32:47,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-16 16:32:47,344 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2019-09-16 16:32:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:32:47,347 INFO L225 Difference]: With dead ends: 500 [2019-09-16 16:32:47,347 INFO L226 Difference]: Without dead ends: 498 [2019-09-16 16:32:47,350 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=934, Invalid=6206, Unknown=0, NotChecked=0, Total=7140 [2019-09-16 16:32:47,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-09-16 16:32:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 131. [2019-09-16 16:32:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-16 16:32:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2019-09-16 16:32:47,381 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 39 [2019-09-16 16:32:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:32:47,381 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2019-09-16 16:32:47,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-16 16:32:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2019-09-16 16:32:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-16 16:32:47,382 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:32:47,382 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:32:47,382 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:32:47,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:32:47,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1378278081, now seen corresponding path program 2 times [2019-09-16 16:32:47,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:32:47,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:32:47,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:47,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:32:47,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:32:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-16 16:32:47,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:32:47,467 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-09-16 16:32:47,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:32:47,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:32:47,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:32:47,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-16 16:32:47,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:32:47,637 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-09-16 16:32:47,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:47,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:47,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:47,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:9 [2019-09-16 16:32:47,698 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_int|], 4=[|v_#memory_int_31|]} [2019-09-16 16:32:47,700 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:47,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:47,721 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:47,722 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-09-16 16:32:47,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:47,724 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_192], 2=[v_arrayElimCell_191]} [2019-09-16 16:32:47,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:32:47,928 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:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) 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:461) 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-09-16 16:32:47,936 INFO L168 Benchmark]: Toolchain (without parser) took 71288.32 ms. Allocated memory was 140.0 MB in the beginning and 599.3 MB in the end (delta: 459.3 MB). Free memory was 86.0 MB in the beginning and 414.4 MB in the end (delta: -328.3 MB). Peak memory consumption was 131.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:32:47,937 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:32:47,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.58 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 85.8 MB in the beginning and 165.7 MB in the end (delta: -79.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-09-16 16:32:47,937 INFO L168 Benchmark]: Boogie Preprocessor took 69.04 ms. Allocated memory is still 199.8 MB. Free memory was 165.7 MB in the beginning and 162.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:32:47,938 INFO L168 Benchmark]: RCFGBuilder took 546.25 ms. Allocated memory is still 199.8 MB. Free memory was 162.3 MB in the beginning and 123.3 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:32:47,938 INFO L168 Benchmark]: TraceAbstraction took 70057.84 ms. Allocated memory was 199.8 MB in the beginning and 599.3 MB in the end (delta: 399.5 MB). Free memory was 122.7 MB in the beginning and 414.4 MB in the end (delta: -291.7 MB). Peak memory consumption was 107.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:32:47,941 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.55 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 608.58 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 85.8 MB in the beginning and 165.7 MB in the end (delta: -79.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.04 ms. Allocated memory is still 199.8 MB. Free memory was 165.7 MB in the beginning and 162.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 546.25 ms. Allocated memory is still 199.8 MB. Free memory was 162.3 MB in the beginning and 123.3 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70057.84 ms. Allocated memory was 199.8 MB in the beginning and 599.3 MB in the end (delta: 399.5 MB). Free memory was 122.7 MB in the beginning and 414.4 MB in the end (delta: -291.7 MB). Peak memory consumption was 107.8 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...