java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:10:30,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:10:30,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:10:30,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:10:30,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:10:30,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:10:30,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:10:30,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:10:30,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:10:30,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:10:30,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:10:30,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:10:30,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:10:30,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:10:30,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:10:30,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:10:30,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:10:30,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:10:30,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:10:30,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:10:30,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:10:30,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:10:30,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:10:30,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:10:30,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:10:30,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:10:30,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:10:30,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:10:30,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:10:30,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:10:30,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:10:30,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:10:30,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:10:30,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:10:30,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:10:30,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:10:30,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:10:30,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:10:30,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:10:30,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:10:30,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:10:30,479 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:10:30,493 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:10:30,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:10:30,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:10:30,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:10:30,495 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:10:30,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:10:30,495 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:10:30,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:10:30,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:10:30,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:10:30,496 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:10:30,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:10:30,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:10:30,497 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:10:30,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:10:30,497 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:10:30,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:10:30,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:10:30,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:10:30,498 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:10:30,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:10:30,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:30,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:10:30,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:10:30,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:10:30,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:10:30,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:10:30,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:10:30,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:10:30,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:10:30,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:10:30,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:10:30,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:10:30,821 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:10:30,822 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2019-10-14 23:10:30,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ef75ebd/aae8565a4b4b4a1a911894a75bd7c692/FLAG9618e6202 [2019-10-14 23:10:31,522 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:10:31,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2019-10-14 23:10:31,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ef75ebd/aae8565a4b4b4a1a911894a75bd7c692/FLAG9618e6202 [2019-10-14 23:10:31,766 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ef75ebd/aae8565a4b4b4a1a911894a75bd7c692 [2019-10-14 23:10:31,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:10:31,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:10:31,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:31,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:10:31,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:10:31,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:31" (1/1) ... [2019-10-14 23:10:31,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489c2918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:31, skipping insertion in model container [2019-10-14 23:10:31,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:31" (1/1) ... [2019-10-14 23:10:31,803 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:10:31,861 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:10:32,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:32,363 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:10:32,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:32,468 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:10:32,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:32 WrapperNode [2019-10-14 23:10:32,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:32,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:10:32,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:10:32,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:10:32,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:32" (1/1) ... [2019-10-14 23:10:32,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:32" (1/1) ... [2019-10-14 23:10:32,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:32" (1/1) ... [2019-10-14 23:10:32,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:32" (1/1) ... [2019-10-14 23:10:32,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:32" (1/1) ... [2019-10-14 23:10:32,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:32" (1/1) ... [2019-10-14 23:10:32,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:32" (1/1) ... [2019-10-14 23:10:32,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:10:32,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:10:32,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:10:32,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:10:32,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:32,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:10:32,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:10:32,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:10:32,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:10:32,617 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:10:32,618 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:10:32,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:10:32,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:10:32,618 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:10:32,618 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:10:32,618 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:10:32,619 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:10:32,620 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:10:32,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:10:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:10:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:10:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:10:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:10:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:10:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:10:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:10:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:10:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:10:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:10:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:10:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:10:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:10:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:10:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:10:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:10:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:10:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:10:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:10:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:10:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:10:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:10:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:10:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:10:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:10:32,625 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:10:32,625 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:10:32,625 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:10:32,625 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:10:32,625 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:10:32,625 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:10:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:10:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:10:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:10:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:10:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:10:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:10:32,627 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:10:32,627 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:10:32,627 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:10:32,627 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:10:32,627 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:10:32,627 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:10:32,627 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:10:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:10:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:10:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:10:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:10:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:10:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:10:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 23:10:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:10:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:10:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:10:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:10:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:10:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:10:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:10:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:10:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:10:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:10:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:10:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:10:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:10:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:10:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:10:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:10:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:10:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:10:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:10:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:10:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:10:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:10:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:10:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:10:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:10:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:10:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:10:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:10:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:10:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:10:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:10:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:10:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:10:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:10:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:10:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:10:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:10:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:10:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:10:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:10:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:10:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:10:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:10:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:10:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:10:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:10:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:10:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:10:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:10:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:10:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:10:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:10:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:10:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:10:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:10:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:10:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:10:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:10:33,024 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:10:33,368 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:10:33,368 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-14 23:10:33,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:33 BoogieIcfgContainer [2019-10-14 23:10:33,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:10:33,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:10:33,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:10:33,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:10:33,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:10:31" (1/3) ... [2019-10-14 23:10:33,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3c5235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:33, skipping insertion in model container [2019-10-14 23:10:33,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:32" (2/3) ... [2019-10-14 23:10:33,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3c5235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:33, skipping insertion in model container [2019-10-14 23:10:33,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:33" (3/3) ... [2019-10-14 23:10:33,378 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2019-10-14 23:10:33,388 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:10:33,396 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:10:33,408 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:10:33,433 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:10:33,433 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:10:33,434 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:10:33,434 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:10:33,434 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:10:33,435 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:10:33,435 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:10:33,435 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:10:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2019-10-14 23:10:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:10:33,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:33,462 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:33,464 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:33,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:33,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1575706012, now seen corresponding path program 1 times [2019-10-14 23:10:33,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:33,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704181348] [2019-10-14 23:10:33,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:33,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:33,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:33,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704181348] [2019-10-14 23:10:33,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:33,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:10:33,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463992022] [2019-10-14 23:10:33,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:10:33,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:33,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:10:33,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:10:33,676 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2019-10-14 23:10:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:33,869 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2019-10-14 23:10:33,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:10:33,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 23:10:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:33,880 INFO L225 Difference]: With dead ends: 108 [2019-10-14 23:10:33,880 INFO L226 Difference]: Without dead ends: 47 [2019-10-14 23:10:33,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:10:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-14 23:10:33,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-14 23:10:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-14 23:10:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2019-10-14 23:10:33,930 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2019-10-14 23:10:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:33,930 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2019-10-14 23:10:33,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:10:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2019-10-14 23:10:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:10:33,934 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:33,934 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:33,934 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:33,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1627887593, now seen corresponding path program 1 times [2019-10-14 23:10:33,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:33,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160489757] [2019-10-14 23:10:33,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:33,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:33,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:34,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160489757] [2019-10-14 23:10:34,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:34,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:10:34,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867345126] [2019-10-14 23:10:34,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:10:34,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:34,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:10:34,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:10:34,067 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 4 states. [2019-10-14 23:10:34,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:34,219 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2019-10-14 23:10:34,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:10:34,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-10-14 23:10:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:34,222 INFO L225 Difference]: With dead ends: 75 [2019-10-14 23:10:34,223 INFO L226 Difference]: Without dead ends: 55 [2019-10-14 23:10:34,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:10:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-14 23:10:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-14 23:10:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-14 23:10:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2019-10-14 23:10:34,234 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 25 [2019-10-14 23:10:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:34,234 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2019-10-14 23:10:34,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:10:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2019-10-14 23:10:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:10:34,236 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:34,236 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:34,237 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash -164754602, now seen corresponding path program 1 times [2019-10-14 23:10:34,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:34,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814660245] [2019-10-14 23:10:34,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:34,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:34,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:34,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814660245] [2019-10-14 23:10:34,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:34,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:10:34,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382091037] [2019-10-14 23:10:34,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:10:34,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:34,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:10:34,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:10:34,315 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 4 states. [2019-10-14 23:10:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:34,461 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2019-10-14 23:10:34,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:10:34,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-14 23:10:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:34,464 INFO L225 Difference]: With dead ends: 93 [2019-10-14 23:10:34,465 INFO L226 Difference]: Without dead ends: 57 [2019-10-14 23:10:34,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:10:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-14 23:10:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-14 23:10:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 23:10:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2019-10-14 23:10:34,481 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 31 [2019-10-14 23:10:34,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:34,482 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2019-10-14 23:10:34,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:10:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2019-10-14 23:10:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:10:34,483 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:34,483 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:34,484 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:34,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:34,484 INFO L82 PathProgramCache]: Analyzing trace with hash -982403052, now seen corresponding path program 1 times [2019-10-14 23:10:34,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:34,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323914615] [2019-10-14 23:10:34,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:34,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:34,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:34,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323914615] [2019-10-14 23:10:34,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:34,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:10:34,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071255546] [2019-10-14 23:10:34,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:10:34,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:34,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:10:34,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:10:34,585 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 6 states. [2019-10-14 23:10:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:34,782 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2019-10-14 23:10:34,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:10:34,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-10-14 23:10:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:34,784 INFO L225 Difference]: With dead ends: 82 [2019-10-14 23:10:34,785 INFO L226 Difference]: Without dead ends: 78 [2019-10-14 23:10:34,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:10:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-14 23:10:34,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2019-10-14 23:10:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-14 23:10:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2019-10-14 23:10:34,795 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2019-10-14 23:10:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:34,795 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2019-10-14 23:10:34,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:10:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2019-10-14 23:10:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:10:34,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:34,797 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:34,798 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:34,798 INFO L82 PathProgramCache]: Analyzing trace with hash 852152367, now seen corresponding path program 1 times [2019-10-14 23:10:34,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:34,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865053864] [2019-10-14 23:10:34,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:34,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:34,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:34,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865053864] [2019-10-14 23:10:34,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:34,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:10:34,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726568662] [2019-10-14 23:10:34,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:10:34,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:34,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:10:34,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:10:34,916 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 6 states. [2019-10-14 23:10:35,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:35,161 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2019-10-14 23:10:35,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:10:35,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-10-14 23:10:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:35,163 INFO L225 Difference]: With dead ends: 84 [2019-10-14 23:10:35,163 INFO L226 Difference]: Without dead ends: 76 [2019-10-14 23:10:35,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:10:35,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-14 23:10:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2019-10-14 23:10:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-14 23:10:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2019-10-14 23:10:35,171 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 33 [2019-10-14 23:10:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:35,172 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2019-10-14 23:10:35,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:10:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2019-10-14 23:10:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:10:35,174 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:35,174 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:35,174 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:35,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:35,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1876855343, now seen corresponding path program 1 times [2019-10-14 23:10:35,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:35,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421705561] [2019-10-14 23:10:35,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:35,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:35,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:35,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421705561] [2019-10-14 23:10:35,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:35,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:10:35,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009948512] [2019-10-14 23:10:35,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:10:35,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:35,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:10:35,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:10:35,265 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 6 states. [2019-10-14 23:10:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:35,446 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2019-10-14 23:10:35,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:10:35,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-10-14 23:10:35,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:35,448 INFO L225 Difference]: With dead ends: 84 [2019-10-14 23:10:35,448 INFO L226 Difference]: Without dead ends: 73 [2019-10-14 23:10:35,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:10:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-14 23:10:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2019-10-14 23:10:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-14 23:10:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2019-10-14 23:10:35,455 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 33 [2019-10-14 23:10:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:35,455 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2019-10-14 23:10:35,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:10:35,456 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2019-10-14 23:10:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:10:35,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:35,457 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:35,457 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:35,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:35,457 INFO L82 PathProgramCache]: Analyzing trace with hash -778946181, now seen corresponding path program 1 times [2019-10-14 23:10:35,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:35,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916871532] [2019-10-14 23:10:35,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:35,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:35,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:35,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916871532] [2019-10-14 23:10:35,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474712334] [2019-10-14 23:10:35,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:35,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-14 23:10:35,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:35,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:35,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:35,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:35,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:35,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:10:35,871 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:35,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:35,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:35,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:35,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:35,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:35,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:35,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:35,906 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-10-14 23:10:35,929 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:35,930 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 27 treesize of output 11 [2019-10-14 23:10:35,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:35,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:35,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:35,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-10-14 23:10:35,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:35,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:35,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:35,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:35,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-10-14 23:10:36,027 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 22 treesize of output 10 [2019-10-14 23:10:36,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:36,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-10-14 23:10:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:36,042 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:36,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-10-14 23:10:36,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917037464] [2019-10-14 23:10:36,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:10:36,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:36,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:10:36,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:10:36,044 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand 11 states. [2019-10-14 23:10:36,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:36,465 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2019-10-14 23:10:36,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:10:36,466 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-10-14 23:10:36,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:36,467 INFO L225 Difference]: With dead ends: 86 [2019-10-14 23:10:36,467 INFO L226 Difference]: Without dead ends: 82 [2019-10-14 23:10:36,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:10:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-14 23:10:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2019-10-14 23:10:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-14 23:10:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2019-10-14 23:10:36,475 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 35 [2019-10-14 23:10:36,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:36,475 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2019-10-14 23:10:36,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:10:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2019-10-14 23:10:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:10:36,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:36,477 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:36,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:36,681 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:36,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:36,682 INFO L82 PathProgramCache]: Analyzing trace with hash 84455483, now seen corresponding path program 1 times [2019-10-14 23:10:36,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:36,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401097537] [2019-10-14 23:10:36,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:36,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:36,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:36,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401097537] [2019-10-14 23:10:36,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423761204] [2019-10-14 23:10:36,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:36,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-14 23:10:36,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:36,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:36,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:36,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:10:36,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:36,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:36,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:36,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:36,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:36,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:36,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-10-14 23:10:36,998 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:36,999 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 27 treesize of output 11 [2019-10-14 23:10:36,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:37,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-10-14 23:10:37,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:37,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:37,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:37,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-10-14 23:10:37,072 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 22 treesize of output 10 [2019-10-14 23:10:37,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:37,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:37,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-10-14 23:10:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:37,081 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:37,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-10-14 23:10:37,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068431502] [2019-10-14 23:10:37,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:10:37,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:37,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:10:37,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:10:37,083 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. Second operand 11 states. [2019-10-14 23:10:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:37,575 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2019-10-14 23:10:37,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:10:37,576 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-10-14 23:10:37,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:37,578 INFO L225 Difference]: With dead ends: 97 [2019-10-14 23:10:37,578 INFO L226 Difference]: Without dead ends: 91 [2019-10-14 23:10:37,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:10:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-14 23:10:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-10-14 23:10:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-14 23:10:37,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2019-10-14 23:10:37,585 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 35 [2019-10-14 23:10:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:37,586 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2019-10-14 23:10:37,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:10:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2019-10-14 23:10:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-14 23:10:37,587 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:37,587 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:37,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:37,792 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:37,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1194290218, now seen corresponding path program 1 times [2019-10-14 23:10:37,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:37,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551119364] [2019-10-14 23:10:37,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:37,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:38,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551119364] [2019-10-14 23:10:38,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015745493] [2019-10-14 23:10:38,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:38,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-14 23:10:38,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:38,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:38,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:10:38,225 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:38,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-10-14 23:10:38,263 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 13 treesize of output 9 [2019-10-14 23:10:38,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,279 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 13 treesize of output 9 [2019-10-14 23:10:38,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,289 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-10-14 23:10:38,320 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2019-10-14 23:10:38,329 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 29 treesize of output 19 [2019-10-14 23:10:38,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-10-14 23:10:38,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:38,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,386 INFO L567 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-10-14 23:10:38,392 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-10-14 23:10:38,393 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,401 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-10-14 23:10:38,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-10-14 23:10:38,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,449 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 23 treesize of output 11 [2019-10-14 23:10:38,450 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,455 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-10-14 23:10:38,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 23:10:38,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:38,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:38,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-14 23:10:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:38,466 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:38,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-10-14 23:10:38,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620349195] [2019-10-14 23:10:38,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 23:10:38,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:38,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 23:10:38,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:10:38,467 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 16 states. [2019-10-14 23:10:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:39,173 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2019-10-14 23:10:39,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:10:39,173 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-10-14 23:10:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:39,175 INFO L225 Difference]: With dead ends: 99 [2019-10-14 23:10:39,175 INFO L226 Difference]: Without dead ends: 95 [2019-10-14 23:10:39,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2019-10-14 23:10:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-14 23:10:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2019-10-14 23:10:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-14 23:10:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2019-10-14 23:10:39,184 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 37 [2019-10-14 23:10:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:39,184 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2019-10-14 23:10:39,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 23:10:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2019-10-14 23:10:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 23:10:39,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:39,186 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:39,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:39,397 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:39,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:39,397 INFO L82 PathProgramCache]: Analyzing trace with hash -907951247, now seen corresponding path program 2 times [2019-10-14 23:10:39,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:39,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253946774] [2019-10-14 23:10:39,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:39,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:39,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:39,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253946774] [2019-10-14 23:10:39,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557903989] [2019-10-14 23:10:39,625 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:39,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:10:39,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:39,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-14 23:10:39,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:39,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:39,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:39,823 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:39,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-10-14 23:10:39,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:39,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:39,870 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-10-14 23:10:39,903 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|]} [2019-10-14 23:10:39,908 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 23 treesize of output 15 [2019-10-14 23:10:39,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2019-10-14 23:10:39,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:39,948 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,969 INFO L567 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2019-10-14 23:10:39,973 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-10-14 23:10:39,974 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:39,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:39,984 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-10-14 23:10:40,015 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 31 treesize of output 19 [2019-10-14 23:10:40,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,030 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 19 treesize of output 11 [2019-10-14 23:10:40,031 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,037 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-10-14 23:10:40,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 23:10:40,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:40,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:40,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-14 23:10:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:40,050 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:40,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-10-14 23:10:40,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416217473] [2019-10-14 23:10:40,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:10:40,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:40,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:10:40,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:10:40,051 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand 12 states. [2019-10-14 23:10:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:40,573 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2019-10-14 23:10:40,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:10:40,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-10-14 23:10:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:40,579 INFO L225 Difference]: With dead ends: 101 [2019-10-14 23:10:40,579 INFO L226 Difference]: Without dead ends: 91 [2019-10-14 23:10:40,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:10:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-14 23:10:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2019-10-14 23:10:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-14 23:10:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2019-10-14 23:10:40,588 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 39 [2019-10-14 23:10:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:40,588 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2019-10-14 23:10:40,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:10:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2019-10-14 23:10:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 23:10:40,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:40,590 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:40,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:40,799 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:40,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:40,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1308800881, now seen corresponding path program 1 times [2019-10-14 23:10:40,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:40,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308021527] [2019-10-14 23:10:40,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:40,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 23:10:40,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308021527] [2019-10-14 23:10:40,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711817064] [2019-10-14 23:10:40,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:41,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-14 23:10:41,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:41,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:41,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:10:41,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:41,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-10-14 23:10:41,084 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 13 treesize of output 9 [2019-10-14 23:10:41,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,098 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 13 treesize of output 9 [2019-10-14 23:10:41,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,111 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-10-14 23:10:41,132 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 2=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_47|]} [2019-10-14 23:10:41,136 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 29 treesize of output 19 [2019-10-14 23:10:41,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,168 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,169 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-10-14 23:10:41,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:41,170 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,185 INFO L567 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-10-14 23:10:41,188 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-10-14 23:10:41,188 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,198 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-10-14 23:10:41,219 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 39 treesize of output 21 [2019-10-14 23:10:41,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,231 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 23 treesize of output 11 [2019-10-14 23:10:41,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,236 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-10-14 23:10:41,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 23:10:41,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:41,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:41,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-14 23:10:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:41,275 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:41,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-10-14 23:10:41,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433428898] [2019-10-14 23:10:41,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:10:41,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:41,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:10:41,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:10:41,277 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 14 states. [2019-10-14 23:10:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:41,998 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2019-10-14 23:10:41,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 23:10:41,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-10-14 23:10:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:41,999 INFO L225 Difference]: With dead ends: 103 [2019-10-14 23:10:41,999 INFO L226 Difference]: Without dead ends: 85 [2019-10-14 23:10:42,000 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2019-10-14 23:10:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-14 23:10:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-10-14 23:10:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-14 23:10:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2019-10-14 23:10:42,006 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 39 [2019-10-14 23:10:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:42,006 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2019-10-14 23:10:42,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:10:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2019-10-14 23:10:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 23:10:42,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:42,008 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:42,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:42,217 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:42,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash -315248798, now seen corresponding path program 2 times [2019-10-14 23:10:42,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:42,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93090976] [2019-10-14 23:10:42,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:42,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:42,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:42,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93090976] [2019-10-14 23:10:42,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342742244] [2019-10-14 23:10:42,430 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:42,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:10:42,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:42,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-14 23:10:42,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:42,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:42,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:42,591 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:42,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,628 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-10-14 23:10:42,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:42,633 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-10-14 23:10:42,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:42,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:42,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-14 23:10:42,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:10:42,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,752 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 19 treesize of output 18 [2019-10-14 23:10:42,753 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,764 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-10-14 23:10:42,800 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:42,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 23:10:42,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:42,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-10-14 23:10:42,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-10-14 23:10:42,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:42,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-10-14 23:10:42,939 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-14 23:10:42,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:42,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:42,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-10-14 23:10:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:42,975 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:42,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2019-10-14 23:10:42,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47430495] [2019-10-14 23:10:42,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 23:10:42,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:42,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 23:10:42,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:10:42,977 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand 19 states. [2019-10-14 23:10:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:43,881 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2019-10-14 23:10:43,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 23:10:43,882 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2019-10-14 23:10:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:43,883 INFO L225 Difference]: With dead ends: 113 [2019-10-14 23:10:43,883 INFO L226 Difference]: Without dead ends: 107 [2019-10-14 23:10:43,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2019-10-14 23:10:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-14 23:10:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2019-10-14 23:10:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-14 23:10:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2019-10-14 23:10:43,892 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 39 [2019-10-14 23:10:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:43,892 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2019-10-14 23:10:43,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 23:10:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2019-10-14 23:10:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 23:10:43,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:43,893 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:44,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:44,098 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:44,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:44,098 INFO L82 PathProgramCache]: Analyzing trace with hash -15546846, now seen corresponding path program 1 times [2019-10-14 23:10:44,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:44,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772082718] [2019-10-14 23:10:44,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:44,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:44,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:44,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772082718] [2019-10-14 23:10:44,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34481950] [2019-10-14 23:10:44,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:44,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-14 23:10:44,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:44,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:44,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:44,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:44,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:44,421 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,429 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-10-14 23:10:44,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:44,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:44,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-14 23:10:44,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:44,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:44,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-10-14 23:10:44,541 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:44,542 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 23:10:44,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:44,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-10-14 23:10:44,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,611 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-10-14 23:10:44,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,659 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-10-14 23:10:44,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:44,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-10-14 23:10:44,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:44,886 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 22 treesize of output 10 [2019-10-14 23:10:44,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:44,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:44,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-10-14 23:10:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:44,902 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:44,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2019-10-14 23:10:44,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562165603] [2019-10-14 23:10:44,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 23:10:44,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:44,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 23:10:44,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:10:44,904 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand 18 states. [2019-10-14 23:10:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:45,893 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2019-10-14 23:10:45,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-14 23:10:45,894 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2019-10-14 23:10:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:45,895 INFO L225 Difference]: With dead ends: 130 [2019-10-14 23:10:45,895 INFO L226 Difference]: Without dead ends: 124 [2019-10-14 23:10:45,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 23:10:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-14 23:10:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 88. [2019-10-14 23:10:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-14 23:10:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2019-10-14 23:10:45,902 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 39 [2019-10-14 23:10:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:45,902 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2019-10-14 23:10:45,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 23:10:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2019-10-14 23:10:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 23:10:45,903 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:45,903 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:46,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:46,108 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:46,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2037263357, now seen corresponding path program 3 times [2019-10-14 23:10:46,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:46,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267856351] [2019-10-14 23:10:46,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:46,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:46,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:46,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267856351] [2019-10-14 23:10:46,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540875754] [2019-10-14 23:10:46,441 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:46,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 23:10:46,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:46,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-14 23:10:46,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:46,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:46,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:46,637 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:46,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,668 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-14 23:10:46,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-14 23:10:46,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:46,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:46,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,746 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-14 23:10:46,796 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 23:10:46,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,832 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 2=[|v_#memory_$Pointer$.offset_50|, |v_#memory_$Pointer$.base_54|]} [2019-10-14 23:10:46,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:46,838 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:46,869 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 30 treesize of output 14 [2019-10-14 23:10:46,869 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:46,898 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 39 treesize of output 19 [2019-10-14 23:10:46,898 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,918 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:47 [2019-10-14 23:10:46,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:46,968 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 55 treesize of output 19 [2019-10-14 23:10:46,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:46,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:46,999 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 85 [2019-10-14 23:10:47,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,037 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 70 [2019-10-14 23:10:47,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,039 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,083 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.5 percent of original size [2019-10-14 23:10:47,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,084 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:83 [2019-10-14 23:10:47,130 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 5=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_52|]} [2019-10-14 23:10:47,138 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 47 treesize of output 38 [2019-10-14 23:10:47,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,185 INFO L567 ElimStorePlain]: treesize reduction 16, result has 91.8 percent of original size [2019-10-14 23:10:47,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 167 [2019-10-14 23:10:47,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:47,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:47,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:47,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,240 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2019-10-14 23:10:47,345 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 37 [2019-10-14 23:10:47,346 INFO L567 ElimStorePlain]: treesize reduction 1512, result has 7.6 percent of original size [2019-10-14 23:10:47,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:47,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 157 [2019-10-14 23:10:47,371 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,386 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:60 [2019-10-14 23:10:47,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,471 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 57 treesize of output 40 [2019-10-14 23:10:47,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:47,473 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:47,508 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-10-14 23:10:47,512 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 22 treesize of output 10 [2019-10-14 23:10:47,512 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:47,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:29 [2019-10-14 23:10:47,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:47,575 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-10-14 23:10:47,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,591 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-10-14 23:10:47,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:47,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-10-14 23:10:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:47,602 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:47,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2019-10-14 23:10:47,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280067384] [2019-10-14 23:10:47,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 23:10:47,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:47,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 23:10:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:10:47,603 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand 21 states. [2019-10-14 23:10:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:48,712 INFO L93 Difference]: Finished difference Result 117 states and 150 transitions. [2019-10-14 23:10:48,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:10:48,712 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2019-10-14 23:10:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:48,714 INFO L225 Difference]: With dead ends: 117 [2019-10-14 23:10:48,714 INFO L226 Difference]: Without dead ends: 113 [2019-10-14 23:10:48,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2019-10-14 23:10:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-14 23:10:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2019-10-14 23:10:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-14 23:10:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 127 transitions. [2019-10-14 23:10:48,721 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 127 transitions. Word has length 41 [2019-10-14 23:10:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:48,721 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 127 transitions. [2019-10-14 23:10:48,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 23:10:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 127 transitions. [2019-10-14 23:10:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 23:10:48,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:48,722 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:48,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:48,924 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:48,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:48,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1206625923, now seen corresponding path program 1 times [2019-10-14 23:10:48,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:48,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915355628] [2019-10-14 23:10:48,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:48,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:48,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:49,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915355628] [2019-10-14 23:10:49,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365051641] [2019-10-14 23:10:49,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-14 23:10:49,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:49,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:49,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:49,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:10:49,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:49,265 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-10-14 23:10:49,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:49,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:49,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-14 23:10:49,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:49,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:49,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-10-14 23:10:49,348 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:49,348 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 23:10:49,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:49,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-10-14 23:10:49,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,425 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-10-14 23:10:49,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,471 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-10-14 23:10:49,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:49,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-10-14 23:10:49,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:49,563 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 14 [2019-10-14 23:10:49,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,575 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 14 [2019-10-14 23:10:49,576 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,590 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:49,591 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2019-10-14 23:10:49,591 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:49,617 INFO L567 ElimStorePlain]: treesize reduction 20, result has 45.9 percent of original size [2019-10-14 23:10:49,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 23:10:49,618 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:86, output treesize:7 [2019-10-14 23:10:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:49,638 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:49,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2019-10-14 23:10:49,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983987353] [2019-10-14 23:10:49,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 23:10:49,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:49,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 23:10:49,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:10:49,640 INFO L87 Difference]: Start difference. First operand 97 states and 127 transitions. Second operand 17 states. [2019-10-14 23:10:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:50,742 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2019-10-14 23:10:50,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 23:10:50,743 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-10-14 23:10:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:50,744 INFO L225 Difference]: With dead ends: 148 [2019-10-14 23:10:50,745 INFO L226 Difference]: Without dead ends: 136 [2019-10-14 23:10:50,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 23:10:50,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-14 23:10:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2019-10-14 23:10:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-14 23:10:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2019-10-14 23:10:50,753 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 41 [2019-10-14 23:10:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:50,753 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2019-10-14 23:10:50,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 23:10:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2019-10-14 23:10:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 23:10:50,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:50,754 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:50,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:50,958 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash -181922947, now seen corresponding path program 1 times [2019-10-14 23:10:50,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:50,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786058521] [2019-10-14 23:10:50,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:50,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:50,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:51,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786058521] [2019-10-14 23:10:51,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017915079] [2019-10-14 23:10:51,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:51,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-14 23:10:51,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:51,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:51,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:51,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:51,432 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:51,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:51,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,456 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-10-14 23:10:51,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-10-14 23:10:51,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:51,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:51,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:51,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:51,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,533 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-10-14 23:10:51,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:51,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 23:10:51,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:51,607 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_63|], 2=[|v_#memory_$Pointer$.base_59|, |v_#memory_$Pointer$.offset_55|]} [2019-10-14 23:10:51,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:51,613 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:51,663 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-14 23:10:51,663 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 39 treesize of output 27 [2019-10-14 23:10:51,664 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,712 INFO L567 ElimStorePlain]: treesize reduction 8, result has 87.3 percent of original size [2019-10-14 23:10:51,719 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 23 treesize of output 11 [2019-10-14 23:10:51,719 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:51,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,735 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:40 [2019-10-14 23:10:51,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:51,794 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 149 [2019-10-14 23:10:51,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:51,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,857 INFO L567 ElimStorePlain]: treesize reduction 26, result has 85.6 percent of original size [2019-10-14 23:10:51,862 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 105 [2019-10-14 23:10:51,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:51,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:51,900 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 55 treesize of output 19 [2019-10-14 23:10:51,901 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:51,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:51,923 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:162, output treesize:118 [2019-10-14 23:10:51,992 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_65|], 6=[|v_#memory_$Pointer$.offset_57|, |v_#memory_$Pointer$.base_61|]} [2019-10-14 23:10:51,999 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 69 treesize of output 54 [2019-10-14 23:10:52,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,094 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,095 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 257 [2019-10-14 23:10:52,097 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,152 INFO L567 ElimStorePlain]: treesize reduction 100, result has 61.8 percent of original size [2019-10-14 23:10:52,184 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,185 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 159 treesize of output 145 [2019-10-14 23:10:52,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:52,187 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,229 INFO L567 ElimStorePlain]: treesize reduction 108, result has 49.3 percent of original size [2019-10-14 23:10:52,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,230 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:307, output treesize:105 [2019-10-14 23:10:52,347 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,347 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 109 treesize of output 68 [2019-10-14 23:10:52,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:52,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:52,349 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:52,381 INFO L567 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2019-10-14 23:10:52,384 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 32 treesize of output 19 [2019-10-14 23:10:52,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:52,395 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:30 [2019-10-14 23:10:52,440 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,440 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 29 treesize of output 21 [2019-10-14 23:10:52,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:52,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:52,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-10-14 23:10:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:52,454 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:52,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2019-10-14 23:10:52,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621856806] [2019-10-14 23:10:52,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 23:10:52,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:52,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 23:10:52,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:10:52,455 INFO L87 Difference]: Start difference. First operand 116 states and 150 transitions. Second operand 21 states. [2019-10-14 23:10:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:53,623 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2019-10-14 23:10:53,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 23:10:53,624 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2019-10-14 23:10:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:53,625 INFO L225 Difference]: With dead ends: 138 [2019-10-14 23:10:53,625 INFO L226 Difference]: Without dead ends: 132 [2019-10-14 23:10:53,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 23:10:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-14 23:10:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2019-10-14 23:10:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-14 23:10:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 152 transitions. [2019-10-14 23:10:53,635 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 152 transitions. Word has length 41 [2019-10-14 23:10:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:53,635 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 152 transitions. [2019-10-14 23:10:53,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 23:10:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 152 transitions. [2019-10-14 23:10:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-14 23:10:53,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:53,636 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:53,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:53,841 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash -646320680, now seen corresponding path program 4 times [2019-10-14 23:10:53,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:53,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950867031] [2019-10-14 23:10:53,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:53,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:53,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:54,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950867031] [2019-10-14 23:10:54,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446091046] [2019-10-14 23:10:54,277 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:54,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 23:10:54,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:54,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-14 23:10:54,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:54,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:54,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:10:54,492 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:54,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,511 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-10-14 23:10:54,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-10-14 23:10:54,545 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 13 treesize of output 9 [2019-10-14 23:10:54,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,569 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 13 treesize of output 9 [2019-10-14 23:10:54,570 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,585 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-10-14 23:10:54,645 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,646 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 22 treesize of output 32 [2019-10-14 23:10:54,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:54,674 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 25 treesize of output 13 [2019-10-14 23:10:54,674 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,707 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-14 23:10:54,707 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 45 treesize of output 31 [2019-10-14 23:10:54,708 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,726 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-10-14 23:10:54,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,727 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:31 [2019-10-14 23:10:54,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 83 [2019-10-14 23:10:54,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,802 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 127 [2019-10-14 23:10:54,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,804 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,839 INFO L567 ElimStorePlain]: treesize reduction 34, result has 76.2 percent of original size [2019-10-14 23:10:54,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:129, output treesize:103 [2019-10-14 23:10:54,882 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_66|], 6=[|v_#memory_$Pointer$.offset_61|, |v_#memory_$Pointer$.base_65|]} [2019-10-14 23:10:54,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2019-10-14 23:10:54,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:54,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,945 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:54,946 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 304 treesize of output 281 [2019-10-14 23:10:54,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:54,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,018 INFO L567 ElimStorePlain]: treesize reduction 519, result has 28.8 percent of original size [2019-10-14 23:10:55,074 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 209 treesize of output 232 [2019-10-14 23:10:55,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:55,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:55,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:55,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:10:55,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,086 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 9 xjuncts. [2019-10-14 23:10:55,148 INFO L567 ElimStorePlain]: treesize reduction 1793, result has 5.5 percent of original size [2019-10-14 23:10:55,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,148 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:336, output treesize:104 [2019-10-14 23:10:55,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,255 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 146 treesize of output 75 [2019-10-14 23:10:55,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:55,256 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:55,277 INFO L567 ElimStorePlain]: treesize reduction 22, result has 68.1 percent of original size [2019-10-14 23:10:55,281 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 35 treesize of output 16 [2019-10-14 23:10:55,282 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,289 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:146, output treesize:7 [2019-10-14 23:10:55,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 23:10:55,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:55,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:55,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-14 23:10:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:55,301 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:55,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2019-10-14 23:10:55,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967769696] [2019-10-14 23:10:55,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-14 23:10:55,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-14 23:10:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2019-10-14 23:10:55,302 INFO L87 Difference]: Start difference. First operand 118 states and 152 transitions. Second operand 23 states. [2019-10-14 23:10:56,611 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-14 23:10:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:57,046 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2019-10-14 23:10:57,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:10:57,047 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-10-14 23:10:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:57,048 INFO L225 Difference]: With dead ends: 142 [2019-10-14 23:10:57,049 INFO L226 Difference]: Without dead ends: 138 [2019-10-14 23:10:57,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 23:10:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-14 23:10:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2019-10-14 23:10:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-14 23:10:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2019-10-14 23:10:57,058 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 157 transitions. Word has length 43 [2019-10-14 23:10:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:57,059 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 157 transitions. [2019-10-14 23:10:57,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-14 23:10:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 157 transitions. [2019-10-14 23:10:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-14 23:10:57,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:57,060 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:57,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:57,261 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:57,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:57,261 INFO L82 PathProgramCache]: Analyzing trace with hash 415338633, now seen corresponding path program 2 times [2019-10-14 23:10:57,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:57,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783904498] [2019-10-14 23:10:57,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:57,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:57,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:57,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783904498] [2019-10-14 23:10:57,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881536355] [2019-10-14 23:10:57,478 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:57,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:10:57,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:57,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-14 23:10:57,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:57,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:10:57,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:57,656 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:57,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,689 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-10-14 23:10:57,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:10:57,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,707 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-10-14 23:10:57,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:57,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:10:57,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-14 23:10:57,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:10:57,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,809 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 19 treesize of output 18 [2019-10-14 23:10:57,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,820 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-10-14 23:10:57,902 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:57,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 23:10:57,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:57,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-10-14 23:10:57,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-10-14 23:10:57,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:57,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:57,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:57,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-10-14 23:10:58,008 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:10:58,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2019-10-14 23:10:58,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:58,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:58,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-10-14 23:10:58,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:58,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 102 [2019-10-14 23:10:58,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,186 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-10-14 23:10:58,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:58,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-10-14 23:10:58,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:58,435 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-14 23:10:58,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:58,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-10-14 23:10:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:58,455 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:58,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2019-10-14 23:10:58,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170998108] [2019-10-14 23:10:58,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-14 23:10:58,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:58,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-14 23:10:58,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-10-14 23:10:58,456 INFO L87 Difference]: Start difference. First operand 122 states and 157 transitions. Second operand 24 states. [2019-10-14 23:10:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:59,785 INFO L93 Difference]: Finished difference Result 168 states and 211 transitions. [2019-10-14 23:10:59,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:10:59,785 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2019-10-14 23:10:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:59,786 INFO L225 Difference]: With dead ends: 168 [2019-10-14 23:10:59,786 INFO L226 Difference]: Without dead ends: 160 [2019-10-14 23:10:59,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=236, Invalid=1096, Unknown=0, NotChecked=0, Total=1332 [2019-10-14 23:10:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-14 23:10:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 118. [2019-10-14 23:10:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-14 23:10:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 151 transitions. [2019-10-14 23:10:59,797 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 151 transitions. Word has length 43 [2019-10-14 23:10:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:59,797 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 151 transitions. [2019-10-14 23:10:59,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-14 23:10:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 151 transitions. [2019-10-14 23:10:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-14 23:10:59,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:59,798 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:00,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:00,008 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:00,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1704764659, now seen corresponding path program 5 times [2019-10-14 23:11:00,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:00,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016278494] [2019-10-14 23:11:00,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:00,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:00,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:00,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016278494] [2019-10-14 23:11:00,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119906973] [2019-10-14 23:11:00,438 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:00,578 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-14 23:11:00,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:00,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-14 23:11:00,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:00,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:00,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:11:00,637 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:00,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,668 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-10-14 23:11:00,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-10-14 23:11:00,698 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 13 treesize of output 9 [2019-10-14 23:11:00,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,717 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 13 treesize of output 9 [2019-10-14 23:11:00,717 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-10-14 23:11:00,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,775 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 22 treesize of output 32 [2019-10-14 23:11:00,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,819 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-14 23:11:00,819 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 45 treesize of output 31 [2019-10-14 23:11:00,820 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,849 INFO L567 ElimStorePlain]: treesize reduction 10, result has 82.1 percent of original size [2019-10-14 23:11:00,852 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 25 treesize of output 13 [2019-10-14 23:11:00,853 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,865 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:31 [2019-10-14 23:11:00,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,939 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 131 [2019-10-14 23:11:00,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 23:11:01,000 INFO L567 ElimStorePlain]: treesize reduction 130, result has 48.0 percent of original size [2019-10-14 23:11:01,005 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 93 [2019-10-14 23:11:01,006 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:129, output treesize:103 [2019-10-14 23:11:01,107 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_74|], 6=[|v_#memory_$Pointer$.base_71|, |v_#memory_$Pointer$.offset_66|]} [2019-10-14 23:11:01,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2019-10-14 23:11:01,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 314 treesize of output 271 [2019-10-14 23:11:01,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:01,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,215 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,286 INFO L567 ElimStorePlain]: treesize reduction 960, result has 17.9 percent of original size [2019-10-14 23:11:01,336 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,337 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 230 [2019-10-14 23:11:01,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,342 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,383 INFO L567 ElimStorePlain]: treesize reduction 435, result has 19.3 percent of original size [2019-10-14 23:11:01,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,384 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:336, output treesize:104 [2019-10-14 23:11:01,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,513 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 146 treesize of output 75 [2019-10-14 23:11:01,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:01,515 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:01,537 INFO L567 ElimStorePlain]: treesize reduction 22, result has 68.1 percent of original size [2019-10-14 23:11:01,540 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 35 treesize of output 16 [2019-10-14 23:11:01,541 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,549 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:146, output treesize:7 [2019-10-14 23:11:01,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 15 treesize of output 7 [2019-10-14 23:11:01,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:01,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:01,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-14 23:11:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:11:01,567 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:01,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2019-10-14 23:11:01,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207099349] [2019-10-14 23:11:01,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-14 23:11:01,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:01,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-14 23:11:01,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-10-14 23:11:01,571 INFO L87 Difference]: Start difference. First operand 118 states and 151 transitions. Second operand 23 states. [2019-10-14 23:11:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:07,337 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2019-10-14 23:11:07,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:11:07,338 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-10-14 23:11:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:07,339 INFO L225 Difference]: With dead ends: 140 [2019-10-14 23:11:07,339 INFO L226 Difference]: Without dead ends: 128 [2019-10-14 23:11:07,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2019-10-14 23:11:07,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-14 23:11:07,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2019-10-14 23:11:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-14 23:11:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2019-10-14 23:11:07,348 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 45 [2019-10-14 23:11:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:07,349 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2019-10-14 23:11:07,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-14 23:11:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2019-10-14 23:11:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-14 23:11:07,349 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:07,350 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:07,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:07,553 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:07,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:07,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1570483469, now seen corresponding path program 2 times [2019-10-14 23:11:07,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:07,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756233051] [2019-10-14 23:11:07,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:07,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:07,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:07,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756233051] [2019-10-14 23:11:07,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932827840] [2019-10-14 23:11:07,731 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:07,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:07,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:07,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-14 23:11:07,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:07,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:07,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:07,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:07,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:08,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:08,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,057 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-10-14 23:11:08,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:08,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,085 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-10-14 23:11:08,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:11:08,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-14 23:11:08,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:11:08,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,243 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 19 treesize of output 18 [2019-10-14 23:11:08,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-10-14 23:11:08,305 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:08,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 23:11:08,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:08,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-10-14 23:11:08,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-10-14 23:11:08,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:08,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-10-14 23:11:08,406 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-14 23:11:08,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-10-14 23:11:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:08,440 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:08,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-10-14 23:11:08,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82558180] [2019-10-14 23:11:08,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 23:11:08,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:08,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 23:11:08,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:11:08,442 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand 17 states. [2019-10-14 23:11:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:09,207 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2019-10-14 23:11:09,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 23:11:09,207 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2019-10-14 23:11:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:09,209 INFO L225 Difference]: With dead ends: 131 [2019-10-14 23:11:09,209 INFO L226 Difference]: Without dead ends: 116 [2019-10-14 23:11:09,210 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2019-10-14 23:11:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-14 23:11:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2019-10-14 23:11:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-14 23:11:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2019-10-14 23:11:09,216 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 45 [2019-10-14 23:11:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:09,216 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2019-10-14 23:11:09,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 23:11:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2019-10-14 23:11:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-14 23:11:09,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:09,217 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:09,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:09,418 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:09,419 INFO L82 PathProgramCache]: Analyzing trace with hash 61167780, now seen corresponding path program 6 times [2019-10-14 23:11:09,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:09,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819527247] [2019-10-14 23:11:09,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:09,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:09,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:10,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819527247] [2019-10-14 23:11:10,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556477232] [2019-10-14 23:11:10,072 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:10,334 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-14 23:11:10,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:10,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 71 conjunts are in the unsatisfiable core [2019-10-14 23:11:10,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:10,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:10,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:10,395 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:10,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,426 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-10-14 23:11:10,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-10-14 23:11:10,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:10,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:10,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,521 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-10-14 23:11:10,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 23:11:10,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,700 INFO L567 ElimStorePlain]: treesize reduction 40, result has 71.0 percent of original size [2019-10-14 23:11:10,701 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_80|], 2=[|v_#memory_$Pointer$.offset_68|, |v_#memory_$Pointer$.base_75|]} [2019-10-14 23:11:10,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:10,707 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:10,747 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 23 treesize of output 11 [2019-10-14 23:11:10,747 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,804 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-14 23:11:10,805 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 48 treesize of output 32 [2019-10-14 23:11:10,805 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,850 INFO L567 ElimStorePlain]: treesize reduction 8, result has 86.7 percent of original size [2019-10-14 23:11:10,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,851 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:52 [2019-10-14 23:11:10,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:10,924 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 55 treesize of output 19 [2019-10-14 23:11:10,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,965 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 69 [2019-10-14 23:11:10,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,023 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,023 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 110 [2019-10-14 23:11:11,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,026 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,105 INFO L567 ElimStorePlain]: treesize reduction 26, result has 80.7 percent of original size [2019-10-14 23:11:11,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,106 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:164, output treesize:117 [2019-10-14 23:11:11,181 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-10-14 23:11:11,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,223 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_82|, |v_#memory_$Pointer$.offset_70|], 6=[|v_#memory_$Pointer$.base_77|]} [2019-10-14 23:11:11,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:11,230 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 27 treesize of output 26 [2019-10-14 23:11:11,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,296 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-14 23:11:11,297 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 106 treesize of output 86 [2019-10-14 23:11:11,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,299 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:11,389 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.0 percent of original size [2019-10-14 23:11:11,463 INFO L341 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size [2019-10-14 23:11:11,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 82 [2019-10-14 23:11:11,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,468 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:11,541 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-14 23:11:11,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:11,542 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:166, output treesize:82 [2019-10-14 23:11:11,596 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_71|], 6=[|v_#memory_$Pointer$.base_78|, |v_#memory_int_83|]} [2019-10-14 23:11:11,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,618 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 284 treesize of output 252 [2019-10-14 23:11:11,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:11,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-14 23:11:11,754 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-14 23:11:11,755 INFO L567 ElimStorePlain]: treesize reduction 546, result has 34.7 percent of original size [2019-10-14 23:11:11,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:11,806 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 282 treesize of output 212 [2019-10-14 23:11:11,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:11,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:11,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:11,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-10-14 23:11:11,972 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-10-14 23:11:11,973 INFO L567 ElimStorePlain]: treesize reduction 1482, result has 15.5 percent of original size [2019-10-14 23:11:11,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:11,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 209 [2019-10-14 23:11:11,980 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:12,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:12,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:12,021 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:307, output treesize:247 [2019-10-14 23:11:12,102 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_84|, |v_#memory_$Pointer$.offset_72|], 12=[|v_#memory_$Pointer$.base_79|]} [2019-10-14 23:11:12,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 90 [2019-10-14 23:11:12,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:12,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:12,214 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:12,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 467 treesize of output 410 [2019-10-14 23:11:12,218 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:12,309 INFO L567 ElimStorePlain]: treesize reduction 168, result has 64.3 percent of original size [2019-10-14 23:11:12,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:12,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 300 treesize of output 240 [2019-10-14 23:11:12,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:12,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:12,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:12,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,408 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:12,638 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-10-14 23:11:12,639 INFO L567 ElimStorePlain]: treesize reduction 2735, result has 7.7 percent of original size [2019-10-14 23:11:12,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:12,640 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:502, output treesize:228 [2019-10-14 23:11:12,787 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-10-14 23:11:12,797 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:12,797 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 224 treesize of output 191 [2019-10-14 23:11:12,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:12,860 INFO L567 ElimStorePlain]: treesize reduction 44, result has 78.4 percent of original size [2019-10-14 23:11:12,890 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:12,891 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 95 [2019-10-14 23:11:12,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:12,895 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:12,944 INFO L567 ElimStorePlain]: treesize reduction 44, result has 52.7 percent of original size [2019-10-14 23:11:12,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:12,946 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:246, output treesize:49 [2019-10-14 23:11:13,019 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 24 [2019-10-14 23:11:13,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:13,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:13,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:56, output treesize:3 [2019-10-14 23:11:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:11:13,073 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:13,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 28 [2019-10-14 23:11:13,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562842369] [2019-10-14 23:11:13,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-14 23:11:13,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:13,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-14 23:11:13,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2019-10-14 23:11:13,074 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand 28 states.