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/forester-heap/sll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:25:45,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:25:45,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:25:45,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:25:45,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:25:45,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:25:45,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:25:45,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:25:45,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:25:45,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:25:45,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:25:45,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:25:45,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:25:45,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:25:45,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:25:45,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:25:45,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:25:45,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:25:45,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:25:45,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:25:45,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:25:45,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:25:45,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:25:45,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:25:45,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:25:45,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:25:45,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:25:45,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:25:45,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:25:45,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:25:45,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:25:45,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:25:45,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:25:45,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:25:45,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:25:45,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:25:45,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:25:45,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:25:45,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:25:45,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:25:45,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:25:45,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:25:45,676 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:25:45,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:25:45,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:25:45,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:25:45,678 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:25:45,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:25:45,678 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:25:45,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:25:45,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:25:45,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:25:45,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:25:45,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:25:45,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:25:45,680 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:25:45,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:25:45,680 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:25:45,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:25:45,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:25:45,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:25:45,681 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:25:45,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:25:45,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:25:45,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:25:45,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:25:45,682 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:25:45,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:25:45,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:25:45,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:25:45,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:25:45,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:25:45,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:25:45,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:25:45,752 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:25:45,752 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:25:45,753 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-09-16 16:25:45,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b8e7c35/b6b60220160e4b99bf9fa5d946cdcb07/FLAG186292e3e [2019-09-16 16:25:46,373 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:25:46,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-09-16 16:25:46,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b8e7c35/b6b60220160e4b99bf9fa5d946cdcb07/FLAG186292e3e [2019-09-16 16:25:46,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b8e7c35/b6b60220160e4b99bf9fa5d946cdcb07 [2019-09-16 16:25:46,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:25:46,674 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:25:46,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:25:46,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:25:46,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:25:46,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:25:46" (1/1) ... [2019-09-16 16:25:46,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac59b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:46, skipping insertion in model container [2019-09-16 16:25:46,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:25:46" (1/1) ... [2019-09-16 16:25:46,689 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:25:46,747 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:25:47,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:25:47,316 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:25:47,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:25:47,419 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:25:47,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:47 WrapperNode [2019-09-16 16:25:47,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:25:47,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:25:47,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:25:47,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:25:47,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:47" (1/1) ... [2019-09-16 16:25:47,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:47" (1/1) ... [2019-09-16 16:25:47,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:47" (1/1) ... [2019-09-16 16:25:47,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:47" (1/1) ... [2019-09-16 16:25:47,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:47" (1/1) ... [2019-09-16 16:25:47,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:47" (1/1) ... [2019-09-16 16:25:47,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:47" (1/1) ... [2019-09-16 16:25:47,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:25:47,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:25:47,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:25:47,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:25:47,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:25:47,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:25:47,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:25:47,609 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:25:47,609 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-16 16:25:47,610 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-16 16:25:47,610 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-16 16:25:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-16 16:25:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-16 16:25:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-16 16:25:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-16 16:25:47,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-16 16:25:47,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-16 16:25:47,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-16 16:25:47,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-16 16:25:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-16 16:25:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-16 16:25:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-16 16:25:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-16 16:25:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-16 16:25:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-16 16:25:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-16 16:25:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-16 16:25:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-16 16:25:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-16 16:25:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-16 16:25:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-16 16:25:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-16 16:25:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-16 16:25:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-16 16:25:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-16 16:25:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-16 16:25:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-16 16:25:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-16 16:25:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-16 16:25:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-16 16:25:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-16 16:25:47,620 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-16 16:25:47,620 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-16 16:25:47,620 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-16 16:25:47,620 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-16 16:25:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-16 16:25:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-16 16:25:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-16 16:25:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-16 16:25:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-16 16:25:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-16 16:25:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-16 16:25:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-16 16:25:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-16 16:25:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-16 16:25:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-16 16:25:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-16 16:25:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-16 16:25:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 16:25:47,624 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 16:25:47,624 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-16 16:25:47,624 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-16 16:25:47,624 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-16 16:25:47,624 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-16 16:25:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-16 16:25:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-16 16:25:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-16 16:25:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-16 16:25:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-16 16:25:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-16 16:25:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-16 16:25:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-16 16:25:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-16 16:25:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-16 16:25:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-16 16:25:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-16 16:25:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-16 16:25:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-16 16:25:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-16 16:25:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-16 16:25:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-16 16:25:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-16 16:25:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-16 16:25:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-16 16:25:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-16 16:25:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-16 16:25:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-16 16:25:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-16 16:25:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-16 16:25:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-16 16:25:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-16 16:25:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-16 16:25:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-16 16:25:47,634 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-16 16:25:47,634 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-16 16:25:47,634 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-16 16:25:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-16 16:25:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-16 16:25:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-16 16:25:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-16 16:25:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-16 16:25:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-16 16:25:47,636 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-16 16:25:47,636 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-16 16:25:47,636 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-16 16:25:47,636 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-16 16:25:47,636 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-16 16:25:47,636 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-16 16:25:47,636 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-16 16:25:47,637 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-16 16:25:47,637 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-16 16:25:47,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:25:47,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:25:47,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:25:47,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 16:25:47,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 16:25:47,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 16:25:47,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:25:47,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:25:47,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:25:48,353 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:25:48,353 INFO L283 CfgBuilder]: Removed 30 assume(true) statements. [2019-09-16 16:25:48,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:25:48 BoogieIcfgContainer [2019-09-16 16:25:48,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:25:48,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:25:48,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:25:48,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:25:48,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:25:46" (1/3) ... [2019-09-16 16:25:48,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4522c777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:25:48, skipping insertion in model container [2019-09-16 16:25:48,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:25:47" (2/3) ... [2019-09-16 16:25:48,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4522c777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:25:48, skipping insertion in model container [2019-09-16 16:25:48,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:25:48" (3/3) ... [2019-09-16 16:25:48,367 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2019-09-16 16:25:48,379 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:25:48,391 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-09-16 16:25:48,411 INFO L252 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-09-16 16:25:48,449 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:25:48,450 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:25:48,450 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:25:48,451 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:25:48,451 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:25:48,451 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:25:48,451 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:25:48,451 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:25:48,451 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:25:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-09-16 16:25:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-09-16 16:25:48,485 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:48,487 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:48,501 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:48,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1861454184, now seen corresponding path program 1 times [2019-09-16 16:25:48,509 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:48,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:48,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:48,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:48,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:48,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:48,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:48,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:48,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:48,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:48,722 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-09-16 16:25:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:48,802 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2019-09-16 16:25:48,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:48,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-09-16 16:25:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:48,816 INFO L225 Difference]: With dead ends: 186 [2019-09-16 16:25:48,816 INFO L226 Difference]: Without dead ends: 99 [2019-09-16 16:25:48,820 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-16 16:25:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2019-09-16 16:25:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-16 16:25:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-09-16 16:25:48,871 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2019-09-16 16:25:48,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:48,872 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-09-16 16:25:48,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:48,872 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-09-16 16:25:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-16 16:25:48,873 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:48,873 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:48,874 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:48,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1461031906, now seen corresponding path program 1 times [2019-09-16 16:25:48,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:48,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:48,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:48,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:48,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:48,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:48,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:48,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:48,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:48,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:48,963 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 3 states. [2019-09-16 16:25:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:48,989 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-16 16:25:48,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:48,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-16 16:25:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:48,991 INFO L225 Difference]: With dead ends: 84 [2019-09-16 16:25:48,991 INFO L226 Difference]: Without dead ends: 82 [2019-09-16 16:25:48,993 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-16 16:25:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-09-16 16:25:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-16 16:25:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-09-16 16:25:49,004 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2019-09-16 16:25:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:49,005 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-09-16 16:25:49,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-09-16 16:25:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-16 16:25:49,006 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:49,006 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:49,007 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:49,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1461033828, now seen corresponding path program 1 times [2019-09-16 16:25:49,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:49,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:49,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:49,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:49,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:25:49,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:25:49,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:25:49,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:25:49,107 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 4 states. [2019-09-16 16:25:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:49,187 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-09-16 16:25:49,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:25:49,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-16 16:25:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:49,189 INFO L225 Difference]: With dead ends: 83 [2019-09-16 16:25:49,189 INFO L226 Difference]: Without dead ends: 81 [2019-09-16 16:25:49,189 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:25:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-16 16:25:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-09-16 16:25:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-16 16:25:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-09-16 16:25:49,199 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2019-09-16 16:25:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:49,200 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-09-16 16:25:49,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:25:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-09-16 16:25:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 16:25:49,201 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:49,201 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:49,201 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:49,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:49,202 INFO L82 PathProgramCache]: Analyzing trace with hash 177734485, now seen corresponding path program 1 times [2019-09-16 16:25:49,202 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:49,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:49,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:49,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:49,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:49,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:49,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:49,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:49,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:49,262 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 3 states. [2019-09-16 16:25:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:49,353 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2019-09-16 16:25:49,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:49,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 16:25:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:49,355 INFO L225 Difference]: With dead ends: 82 [2019-09-16 16:25:49,356 INFO L226 Difference]: Without dead ends: 78 [2019-09-16 16:25:49,356 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-16 16:25:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-09-16 16:25:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-16 16:25:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-09-16 16:25:49,374 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 19 [2019-09-16 16:25:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:49,375 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-09-16 16:25:49,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-09-16 16:25:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:25:49,376 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:49,376 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:49,378 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:49,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:49,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1214805939, now seen corresponding path program 1 times [2019-09-16 16:25:49,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:49,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:49,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:49,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:49,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:25:49,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:25:49,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:25:49,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:25:49,478 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 5 states. [2019-09-16 16:25:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:49,603 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2019-09-16 16:25:49,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:25:49,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-16 16:25:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:49,608 INFO L225 Difference]: With dead ends: 134 [2019-09-16 16:25:49,608 INFO L226 Difference]: Without dead ends: 114 [2019-09-16 16:25:49,609 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:25:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-16 16:25:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 74. [2019-09-16 16:25:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-16 16:25:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2019-09-16 16:25:49,626 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 20 [2019-09-16 16:25:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:49,627 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2019-09-16 16:25:49,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:25:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2019-09-16 16:25:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:25:49,628 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:49,629 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:49,630 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:49,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1924122782, now seen corresponding path program 1 times [2019-09-16 16:25:49,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:49,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:49,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:49,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:49,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:49,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:49,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:49,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:49,674 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 3 states. [2019-09-16 16:25:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:49,687 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2019-09-16 16:25:49,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:49,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:25:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:49,689 INFO L225 Difference]: With dead ends: 139 [2019-09-16 16:25:49,689 INFO L226 Difference]: Without dead ends: 98 [2019-09-16 16:25:49,690 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-16 16:25:49,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2019-09-16 16:25:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-16 16:25:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-09-16 16:25:49,698 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 24 [2019-09-16 16:25:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:49,698 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-09-16 16:25:49,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-09-16 16:25:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:25:49,699 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:49,699 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:49,700 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:49,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:49,700 INFO L82 PathProgramCache]: Analyzing trace with hash -481740404, now seen corresponding path program 1 times [2019-09-16 16:25:49,700 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:49,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:49,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:49,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:49,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:49,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:49,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:49,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:49,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:49,751 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 3 states. [2019-09-16 16:25:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:49,771 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2019-09-16 16:25:49,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:49,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:25:49,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:49,773 INFO L225 Difference]: With dead ends: 77 [2019-09-16 16:25:49,773 INFO L226 Difference]: Without dead ends: 75 [2019-09-16 16:25:49,773 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-16 16:25:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-16 16:25:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-16 16:25:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-09-16 16:25:49,782 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 25 [2019-09-16 16:25:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:49,782 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-09-16 16:25:49,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-09-16 16:25:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:25:49,783 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:49,783 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:49,784 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:49,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:49,784 INFO L82 PathProgramCache]: Analyzing trace with hash -611625627, now seen corresponding path program 1 times [2019-09-16 16:25:49,784 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:49,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:49,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:49,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:49,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:49,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:25:49,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:25:49,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:25:49,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:25:49,883 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 4 states. [2019-09-16 16:25:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:49,952 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-09-16 16:25:49,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:25:49,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-16 16:25:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:49,954 INFO L225 Difference]: With dead ends: 76 [2019-09-16 16:25:49,954 INFO L226 Difference]: Without dead ends: 74 [2019-09-16 16:25:49,955 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:25:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-16 16:25:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-16 16:25:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-16 16:25:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-09-16 16:25:49,961 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 27 [2019-09-16 16:25:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:49,962 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-09-16 16:25:49,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:25:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-09-16 16:25:49,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:25:49,963 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:49,963 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:49,964 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:49,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2038545261, now seen corresponding path program 1 times [2019-09-16 16:25:49,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:49,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:49,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:50,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:50,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:25:50,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:25:50,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:25:50,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:25:50,017 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 4 states. [2019-09-16 16:25:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:50,112 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2019-09-16 16:25:50,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:25:50,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-09-16 16:25:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:50,115 INFO L225 Difference]: With dead ends: 187 [2019-09-16 16:25:50,116 INFO L226 Difference]: Without dead ends: 126 [2019-09-16 16:25:50,116 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:25:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-16 16:25:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 75. [2019-09-16 16:25:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-16 16:25:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-09-16 16:25:50,124 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 28 [2019-09-16 16:25:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:50,124 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-09-16 16:25:50,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:25:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-09-16 16:25:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:25:50,125 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:50,126 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:50,126 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:50,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash 668074133, now seen corresponding path program 1 times [2019-09-16 16:25:50,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:50,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:50,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:50,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:50,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:50,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:50,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:25:50,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:25:50,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:25:50,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:25:50,242 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 6 states. [2019-09-16 16:25:50,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:50,503 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2019-09-16 16:25:50,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:25:50,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-16 16:25:50,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:50,505 INFO L225 Difference]: With dead ends: 179 [2019-09-16 16:25:50,505 INFO L226 Difference]: Without dead ends: 137 [2019-09-16 16:25:50,506 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:25:50,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-16 16:25:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2019-09-16 16:25:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-16 16:25:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-09-16 16:25:50,512 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2019-09-16 16:25:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:50,513 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-09-16 16:25:50,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:25:50,513 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-09-16 16:25:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:25:50,514 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:50,514 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:50,515 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash 567478293, now seen corresponding path program 1 times [2019-09-16 16:25:50,515 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:50,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:50,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:50,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:50,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:50,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-16 16:25:50,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:25:50,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:25:50,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:25:50,867 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 9 states. [2019-09-16 16:25:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:51,380 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2019-09-16 16:25:51,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-16 16:25:51,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-09-16 16:25:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:51,382 INFO L225 Difference]: With dead ends: 174 [2019-09-16 16:25:51,382 INFO L226 Difference]: Without dead ends: 172 [2019-09-16 16:25:51,383 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-16 16:25:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-16 16:25:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 104. [2019-09-16 16:25:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-16 16:25:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2019-09-16 16:25:51,391 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 28 [2019-09-16 16:25:51,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:51,392 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-09-16 16:25:51,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:25:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-09-16 16:25:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:25:51,393 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:51,393 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:51,394 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:51,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1429819819, now seen corresponding path program 1 times [2019-09-16 16:25:51,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:51,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:51,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:25:51,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:51,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:25:51,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:25:51,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:25:51,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:25:51,474 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 5 states. [2019-09-16 16:25:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:51,623 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2019-09-16 16:25:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:25:51,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-16 16:25:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:51,625 INFO L225 Difference]: With dead ends: 150 [2019-09-16 16:25:51,625 INFO L226 Difference]: Without dead ends: 132 [2019-09-16 16:25:51,625 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:25:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-16 16:25:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2019-09-16 16:25:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-16 16:25:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2019-09-16 16:25:51,635 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 30 [2019-09-16 16:25:51,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:51,635 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2019-09-16 16:25:51,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:25:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2019-09-16 16:25:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:25:51,637 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:51,637 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:51,657 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash -753501909, now seen corresponding path program 1 times [2019-09-16 16:25:51,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:51,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:51,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:51,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:25:51,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:51,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:51,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:51,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:51,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:51,697 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand 3 states. [2019-09-16 16:25:51,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:51,746 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2019-09-16 16:25:51,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:51,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 16:25:51,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:51,748 INFO L225 Difference]: With dead ends: 124 [2019-09-16 16:25:51,748 INFO L226 Difference]: Without dead ends: 122 [2019-09-16 16:25:51,749 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-16 16:25:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-09-16 16:25:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-16 16:25:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-09-16 16:25:51,758 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 30 [2019-09-16 16:25:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:51,758 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-09-16 16:25:51,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-09-16 16:25:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:25:51,762 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:51,762 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:51,762 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:51,763 INFO L82 PathProgramCache]: Analyzing trace with hash 758661948, now seen corresponding path program 1 times [2019-09-16 16:25:51,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:51,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:51,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:51,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:51,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:52,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:52,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-16 16:25:52,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:25:52,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:25:52,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:25:52,057 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 9 states. [2019-09-16 16:25:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:52,573 INFO L93 Difference]: Finished difference Result 200 states and 228 transitions. [2019-09-16 16:25:52,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-16 16:25:52,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-16 16:25:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:52,575 INFO L225 Difference]: With dead ends: 200 [2019-09-16 16:25:52,575 INFO L226 Difference]: Without dead ends: 198 [2019-09-16 16:25:52,576 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-16 16:25:52,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-16 16:25:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 129. [2019-09-16 16:25:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-16 16:25:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-09-16 16:25:52,585 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2019-09-16 16:25:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:52,585 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-09-16 16:25:52,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:25:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-09-16 16:25:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 16:25:52,586 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:52,586 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:52,587 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:52,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:52,587 INFO L82 PathProgramCache]: Analyzing trace with hash -999338862, now seen corresponding path program 1 times [2019-09-16 16:25:52,587 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:52,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:52,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:52,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:52,639 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:25:52,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:52,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-16 16:25:52,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:52,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-16 16:25:52,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:52,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:52,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-16 16:25:52,893 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:52,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:52,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:52,900 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-09-16 16:25:52,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:52,929 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 21 treesize of output 20 [2019-09-16 16:25:52,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:52,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:52,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:52,953 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 21 treesize of output 20 [2019-09-16 16:25:52,953 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:52,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:52,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:52,964 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-09-16 16:25:53,025 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-09-16 16:25:53,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:53,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:53,038 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-09-16 16:25:53,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:53,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,043 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-09-16 16:25:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:53,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:25:53,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-09-16 16:25:53,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:25:53,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:25:53,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:25:53,056 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 8 states. [2019-09-16 16:25:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:53,380 INFO L93 Difference]: Finished difference Result 218 states and 250 transitions. [2019-09-16 16:25:53,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 16:25:53,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-09-16 16:25:53,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:53,383 INFO L225 Difference]: With dead ends: 218 [2019-09-16 16:25:53,384 INFO L226 Difference]: Without dead ends: 158 [2019-09-16 16:25:53,384 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:25:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-16 16:25:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 120. [2019-09-16 16:25:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-16 16:25:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2019-09-16 16:25:53,394 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 33 [2019-09-16 16:25:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:53,395 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2019-09-16 16:25:53,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:25:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2019-09-16 16:25:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 16:25:53,396 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:53,396 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:53,396 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:53,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:53,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2072098386, now seen corresponding path program 1 times [2019-09-16 16:25:53,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:53,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:53,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:53,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:53,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:53,576 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:25:53,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:53,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-16 16:25:53,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:53,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:53,792 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 23 treesize of output 15 [2019-09-16 16:25:53,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,797 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 23 treesize of output 19 [2019-09-16 16:25:53,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:53,811 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 16 treesize of output 8 [2019-09-16 16:25:53,812 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,815 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 12 treesize of output 8 [2019-09-16 16:25:53,816 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:53,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:53,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-16 16:25:53,820 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:9 [2019-09-16 16:25:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:53,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:25:53,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-16 16:25:53,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-16 16:25:53,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-16 16:25:53,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:25:53,840 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand 12 states. [2019-09-16 16:25:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:54,772 INFO L93 Difference]: Finished difference Result 269 states and 305 transitions. [2019-09-16 16:25:54,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-16 16:25:54,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-09-16 16:25:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:54,775 INFO L225 Difference]: With dead ends: 269 [2019-09-16 16:25:54,775 INFO L226 Difference]: Without dead ends: 225 [2019-09-16 16:25:54,776 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-09-16 16:25:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-16 16:25:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 155. [2019-09-16 16:25:54,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-16 16:25:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2019-09-16 16:25:54,787 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 33 [2019-09-16 16:25:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:54,788 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2019-09-16 16:25:54,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-16 16:25:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2019-09-16 16:25:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 16:25:54,789 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:54,789 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:54,789 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:54,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1941174974, now seen corresponding path program 1 times [2019-09-16 16:25:54,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:54,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:54,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:54,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:54,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:54,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:54,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:25:54,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:25:54,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:25:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:54,818 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand 3 states. [2019-09-16 16:25:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:54,837 INFO L93 Difference]: Finished difference Result 297 states and 355 transitions. [2019-09-16 16:25:54,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:25:54,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-16 16:25:54,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:54,839 INFO L225 Difference]: With dead ends: 297 [2019-09-16 16:25:54,839 INFO L226 Difference]: Without dead ends: 222 [2019-09-16 16:25:54,840 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:25:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-16 16:25:54,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 189. [2019-09-16 16:25:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-16 16:25:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 224 transitions. [2019-09-16 16:25:54,853 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 224 transitions. Word has length 35 [2019-09-16 16:25:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:54,853 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 224 transitions. [2019-09-16 16:25:54,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:25:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 224 transitions. [2019-09-16 16:25:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-16 16:25:54,854 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:54,854 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:54,855 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:54,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:54,855 INFO L82 PathProgramCache]: Analyzing trace with hash 930038423, now seen corresponding path program 1 times [2019-09-16 16:25:54,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:54,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:54,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:54,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:54,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:54,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:54,940 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:25:55,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:55,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-16 16:25:55,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:55,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, 0 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-09-16 16:25:55,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:55,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:55,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:55,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-09-16 16:25:55,148 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-09-16 16:25:55,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-16 16:25:55,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:55,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:55,172 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-09-16 16:25:55,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-09-16 16:25:55,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:55,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:55,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:55,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2019-09-16 16:25:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:55,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:25:55,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-09-16 16:25:55,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 16:25:55,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 16:25:55,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:25:55,189 INFO L87 Difference]: Start difference. First operand 189 states and 224 transitions. Second operand 10 states. [2019-09-16 16:25:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:55,445 INFO L93 Difference]: Finished difference Result 344 states and 402 transitions. [2019-09-16 16:25:55,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:25:55,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-09-16 16:25:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:55,448 INFO L225 Difference]: With dead ends: 344 [2019-09-16 16:25:55,448 INFO L226 Difference]: Without dead ends: 313 [2019-09-16 16:25:55,448 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-16 16:25:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-16 16:25:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 221. [2019-09-16 16:25:55,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-16 16:25:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 265 transitions. [2019-09-16 16:25:55,461 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 265 transitions. Word has length 36 [2019-09-16 16:25:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:55,462 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 265 transitions. [2019-09-16 16:25:55,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 16:25:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 265 transitions. [2019-09-16 16:25:55,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 16:25:55,463 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:55,463 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:55,464 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:55,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash 958849274, now seen corresponding path program 1 times [2019-09-16 16:25:55,465 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:55,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:55,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:55,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:55,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:25:55,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:25:55,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:25:55,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:25:55,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:25:55,559 INFO L87 Difference]: Start difference. First operand 221 states and 265 transitions. Second operand 5 states. [2019-09-16 16:25:55,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:25:55,702 INFO L93 Difference]: Finished difference Result 370 states and 448 transitions. [2019-09-16 16:25:55,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:25:55,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-09-16 16:25:55,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:25:55,704 INFO L225 Difference]: With dead ends: 370 [2019-09-16 16:25:55,704 INFO L226 Difference]: Without dead ends: 230 [2019-09-16 16:25:55,705 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:25:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-16 16:25:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2019-09-16 16:25:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-16 16:25:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 267 transitions. [2019-09-16 16:25:55,717 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 267 transitions. Word has length 40 [2019-09-16 16:25:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:25:55,718 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 267 transitions. [2019-09-16 16:25:55,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:25:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 267 transitions. [2019-09-16 16:25:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 16:25:55,719 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:25:55,719 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:25:55,719 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:25:55,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:25:55,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1979917628, now seen corresponding path program 1 times [2019-09-16 16:25:55,720 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:25:55,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:25:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:55,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:25:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:56,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:56,365 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:25:56,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:56,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-16 16:25:56,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:56,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:25:56,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:56,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:56,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:56,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-16 16:25:56,523 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 13 treesize of output 9 [2019-09-16 16:25:56,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:56,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:56,541 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 13 treesize of output 9 [2019-09-16 16:25:56,541 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:56,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:56,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:56,553 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-09-16 16:25:56,691 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:56,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-16 16:25:56,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:56,782 INFO L567 ElimStorePlain]: treesize reduction 14, result has 87.3 percent of original size [2019-09-16 16:25:56,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:56,798 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 37 treesize of output 27 [2019-09-16 16:25:56,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:56,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:56,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:56,842 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 37 treesize of output 27 [2019-09-16 16:25:56,843 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:56,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:56,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:56,868 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:98, output treesize:71 [2019-09-16 16:25:56,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:56,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-09-16 16:25:56,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:57,090 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-16 16:25:57,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:57,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:57,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:57,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:57,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:57,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:57,327 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-16 16:25:57,328 INFO L341 Elim1Store]: treesize reduction 39, result has 79.8 percent of original size [2019-09-16 16:25:57,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 260 treesize of output 301 [2019-09-16 16:25:57,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:57,537 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-16 16:25:57,538 INFO L567 ElimStorePlain]: treesize reduction 375, result has 41.9 percent of original size [2019-09-16 16:25:57,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:57,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:57,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:57,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:57,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2019-09-16 16:25:57,571 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:57,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:57,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:57,609 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:614, output treesize:223 [2019-09-16 16:25:57,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:57,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:57,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:57,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 202 treesize of output 244 [2019-09-16 16:25:57,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:57,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:58,141 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:58,225 INFO L567 ElimStorePlain]: treesize reduction 156, result has 36.1 percent of original size [2019-09-16 16:25:58,238 INFO L341 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2019-09-16 16:25:58,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 41 [2019-09-16 16:25:58,240 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:58,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:25:58,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:25:58,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:230, output treesize:7 [2019-09-16 16:25:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:58,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:25:58,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2019-09-16 16:25:58,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-16 16:25:58,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-16 16:25:58,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=339, Unknown=1, NotChecked=0, Total=420 [2019-09-16 16:25:58,308 INFO L87 Difference]: Start difference. First operand 223 states and 267 transitions. Second operand 21 states. [2019-09-16 16:26:00,934 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-16 16:26:01,070 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-16 16:26:03,247 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-16 16:26:03,462 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-16 16:26:03,723 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-16 16:26:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:26:07,582 INFO L93 Difference]: Finished difference Result 612 states and 723 transitions. [2019-09-16 16:26:07,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-16 16:26:07,582 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-09-16 16:26:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:26:07,586 INFO L225 Difference]: With dead ends: 612 [2019-09-16 16:26:07,586 INFO L226 Difference]: Without dead ends: 497 [2019-09-16 16:26:07,588 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=484, Invalid=1672, Unknown=6, NotChecked=0, Total=2162 [2019-09-16 16:26:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-16 16:26:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 262. [2019-09-16 16:26:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-16 16:26:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 310 transitions. [2019-09-16 16:26:07,607 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 310 transitions. Word has length 40 [2019-09-16 16:26:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:26:07,607 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 310 transitions. [2019-09-16 16:26:07,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-16 16:26:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 310 transitions. [2019-09-16 16:26:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 16:26:07,609 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:26:07,609 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:26:07,609 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:26:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:26:07,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1295314108, now seen corresponding path program 1 times [2019-09-16 16:26:07,610 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:26:07,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:26:07,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:26:07,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:26:07,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:26:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:26:08,186 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-09-16 16:26:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:26:08,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:26:08,531 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:26:08,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:26:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:26:08,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-16 16:26:08,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:26:08,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:26:08,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:08,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:08,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:08,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-16 16:26:08,691 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:08,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-09-16 16:26:08,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:08,793 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.2 percent of original size [2019-09-16 16:26:08,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:08,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:08,874 INFO L341 Elim1Store]: treesize reduction 88, result has 57.5 percent of original size [2019-09-16 16:26:08,875 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 2 case distinctions, treesize of input 141 treesize of output 232 [2019-09-16 16:26:08,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:08,945 INFO L567 ElimStorePlain]: treesize reduction 98, result has 60.0 percent of original size [2019-09-16 16:26:08,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:08,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:08,955 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:26:08,966 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-09-16 16:26:08,967 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 1 case distinctions, treesize of input 42 treesize of output 31 [2019-09-16 16:26:08,967 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:08,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:08,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:08,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:08,996 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:357, output treesize:117 [2019-09-16 16:26:09,258 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-16 16:26:09,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:09,440 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:09,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-09-16 16:26:09,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:09,638 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-16 16:26:09,639 INFO L567 ElimStorePlain]: treesize reduction 46, result has 78.7 percent of original size [2019-09-16 16:26:09,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:09,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:26:09,702 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:09,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 111 treesize of output 152 [2019-09-16 16:26:09,704 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:09,848 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-16 16:26:09,849 INFO L567 ElimStorePlain]: treesize reduction 150, result has 51.1 percent of original size [2019-09-16 16:26:09,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:09,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:09,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2019-09-16 16:26:09,860 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:09,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:09,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:09,914 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:162, output treesize:145 [2019-09-16 16:26:10,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:10,076 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:10,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 47 [2019-09-16 16:26:10,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:10,272 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-09-16 16:26:10,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:10,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:10,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:10,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:10,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:10,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:10,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:10,306 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:26:10,757 WARN L191 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2019-09-16 16:26:10,758 INFO L341 Elim1Store]: treesize reduction 87, result has 75.8 percent of original size [2019-09-16 16:26:10,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 337 treesize of output 451 [2019-09-16 16:26:10,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:10,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:10,796 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:26:11,125 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 72 [2019-09-16 16:26:11,125 INFO L567 ElimStorePlain]: treesize reduction 705, result has 30.8 percent of original size [2019-09-16 16:26:11,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:11,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:11,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:11,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:11,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:11,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2019-09-16 16:26:11,144 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:11,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:11,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:26:11,223 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:692, output treesize:310 [2019-09-16 16:26:11,597 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:26:11,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:11,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:12,394 WARN L191 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 143 [2019-09-16 16:26:12,395 INFO L341 Elim1Store]: treesize reduction 8, result has 97.6 percent of original size [2019-09-16 16:26:12,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 35 case distinctions, treesize of input 304 treesize of output 468 [2019-09-16 16:26:12,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:12,544 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-16 16:26:12,755 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 52 [2019-09-16 16:26:12,755 INFO L567 ElimStorePlain]: treesize reduction 202, result has 38.0 percent of original size [2019-09-16 16:26:12,797 INFO L341 Elim1Store]: treesize reduction 10, result has 71.4 percent of original size [2019-09-16 16:26:12,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 8 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 68 [2019-09-16 16:26:12,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:12,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:12,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:12,829 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:325, output treesize:7 [2019-09-16 16:26:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:26:12,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:26:12,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-09-16 16:26:12,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-16 16:26:12,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-16 16:26:12,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=340, Unknown=1, NotChecked=0, Total=420 [2019-09-16 16:26:12,906 INFO L87 Difference]: Start difference. First operand 262 states and 310 transitions. Second operand 21 states. [2019-09-16 16:26:13,525 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-16 16:26:15,874 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-16 16:26:18,528 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-16 16:26:18,825 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2019-09-16 16:26:25,600 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 79 [2019-09-16 16:26:25,867 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-16 16:26:26,115 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 136 [2019-09-16 16:26:26,386 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-16 16:26:27,012 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-16 16:26:27,283 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 140 [2019-09-16 16:26:27,802 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 93 [2019-09-16 16:26:28,072 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 88 [2019-09-16 16:26:28,292 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-16 16:26:28,667 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-09-16 16:26:29,553 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 92 [2019-09-16 16:26:29,727 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-16 16:26:29,997 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2019-09-16 16:26:30,633 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-09-16 16:26:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:26:30,673 INFO L93 Difference]: Finished difference Result 906 states and 1075 transitions. [2019-09-16 16:26:30,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-16 16:26:30,674 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-09-16 16:26:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:26:30,678 INFO L225 Difference]: With dead ends: 906 [2019-09-16 16:26:30,678 INFO L226 Difference]: Without dead ends: 742 [2019-09-16 16:26:30,680 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=845, Invalid=2571, Unknown=6, NotChecked=0, Total=3422 [2019-09-16 16:26:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-09-16 16:26:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 320. [2019-09-16 16:26:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-16 16:26:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 379 transitions. [2019-09-16 16:26:30,703 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 379 transitions. Word has length 40 [2019-09-16 16:26:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:26:30,703 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 379 transitions. [2019-09-16 16:26:30,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-16 16:26:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 379 transitions. [2019-09-16 16:26:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-16 16:26:30,704 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:26:30,704 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:26:30,705 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:26:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:26:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash 608870837, now seen corresponding path program 1 times [2019-09-16 16:26:30,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:26:30,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:26:30,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:26:30,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:26:30,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:26:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:26:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:26:31,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:26:31,551 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:26:31,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:26:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:26:31,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-16 16:26:31,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:26:31,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:26:31,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:31,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:31,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:31,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-16 16:26:31,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:31,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-09-16 16:26:31,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:31,830 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-09-16 16:26:31,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:31,859 INFO L341 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2019-09-16 16:26:31,859 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 1 case distinctions, treesize of input 141 treesize of output 130 [2019-09-16 16:26:31,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:31,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:31,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:31,895 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 42 treesize of output 31 [2019-09-16 16:26:31,896 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:31,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:31,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:31,921 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-09-16 16:26:32,065 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:32,065 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-09-16 16:26:32,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:32,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:32,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:32,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2019-09-16 16:26:32,134 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:32,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:32,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:32,181 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:26:32,234 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:32,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 147 [2019-09-16 16:26:32,237 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:32,359 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-16 16:26:32,360 INFO L567 ElimStorePlain]: treesize reduction 160, result has 40.1 percent of original size [2019-09-16 16:26:32,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:32,361 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:150, output treesize:100 [2019-09-16 16:26:32,422 INFO L392 ElimStorePlain]: Different costs {18=[|v_#memory_$Pointer$.offset_44|], 28=[|v_#memory_$Pointer$.base_43|]} [2019-09-16 16:26:32,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:32,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:32,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 72 [2019-09-16 16:26:32,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:32,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:32,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:32,472 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:26:32,711 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-09-16 16:26:32,712 INFO L341 Elim1Store]: treesize reduction 70, result has 71.1 percent of original size [2019-09-16 16:26:32,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 131 treesize of output 234 [2019-09-16 16:26:32,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:32,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:32,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:33,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:33,093 INFO L496 ElimStorePlain]: Start of recursive call 3: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2019-09-16 16:26:35,284 WARN L191 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 290 DAG size of output: 192 [2019-09-16 16:26:35,285 INFO L567 ElimStorePlain]: treesize reduction 3239, result has 25.1 percent of original size [2019-09-16 16:26:35,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:35,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2019-09-16 16:26:35,288 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:151, output treesize:1238 [2019-09-16 16:26:35,550 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 44 [2019-09-16 16:26:35,757 INFO L392 ElimStorePlain]: Different costs {25=[|#memory_$Pointer$.offset|], 32=[|#memory_$Pointer$.base|]} [2019-09-16 16:26:35,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:35,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:35,784 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:35,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 49 [2019-09-16 16:26:35,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:35,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:36,026 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-16 16:26:36,026 INFO L341 Elim1Store]: treesize reduction 10, result has 92.4 percent of original size [2019-09-16 16:26:36,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 150 [2019-09-16 16:26:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:36,056 INFO L496 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-16 16:26:36,142 INFO L567 ElimStorePlain]: treesize reduction 235, result has 6.4 percent of original size [2019-09-16 16:26:36,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:36,143 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:150, output treesize:7 [2019-09-16 16:26:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:26:36,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:26:36,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2019-09-16 16:26:36,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-16 16:26:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-16 16:26:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=378, Unknown=1, NotChecked=0, Total=462 [2019-09-16 16:26:36,187 INFO L87 Difference]: Start difference. First operand 320 states and 379 transitions. Second operand 22 states. [2019-09-16 16:26:36,641 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-16 16:26:37,009 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-16 16:26:37,225 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-16 16:26:37,742 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-16 16:26:38,126 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-16 16:26:39,631 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-09-16 16:26:39,914 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 93 [2019-09-16 16:26:40,144 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 95 [2019-09-16 16:26:40,881 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-16 16:26:41,364 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 99 [2019-09-16 16:26:41,699 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-09-16 16:26:41,962 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-16 16:26:42,135 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2019-09-16 16:26:42,376 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-16 16:26:42,516 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 41 [2019-09-16 16:26:42,749 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-16 16:26:43,432 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-16 16:26:44,154 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-09-16 16:26:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:26:44,429 INFO L93 Difference]: Finished difference Result 864 states and 1013 transitions. [2019-09-16 16:26:44,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-16 16:26:44,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2019-09-16 16:26:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:26:44,435 INFO L225 Difference]: With dead ends: 864 [2019-09-16 16:26:44,436 INFO L226 Difference]: Without dead ends: 862 [2019-09-16 16:26:44,438 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1167, Invalid=3254, Unknown=1, NotChecked=0, Total=4422 [2019-09-16 16:26:44,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-09-16 16:26:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 364. [2019-09-16 16:26:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-16 16:26:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 429 transitions. [2019-09-16 16:26:44,468 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 429 transitions. Word has length 43 [2019-09-16 16:26:44,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:26:44,468 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 429 transitions. [2019-09-16 16:26:44,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-16 16:26:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 429 transitions. [2019-09-16 16:26:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-16 16:26:44,469 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:26:44,469 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:26:44,469 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:26:44,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:26:44,470 INFO L82 PathProgramCache]: Analyzing trace with hash 938403788, now seen corresponding path program 1 times [2019-09-16 16:26:44,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:26:44,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:26:44,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:26:44,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:26:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:26:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:26:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-16 16:26:44,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:26:44,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 16:26:44,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:26:44,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:26:44,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:26:44,688 INFO L87 Difference]: Start difference. First operand 364 states and 429 transitions. Second operand 8 states. [2019-09-16 16:26:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:26:44,987 INFO L93 Difference]: Finished difference Result 393 states and 458 transitions. [2019-09-16 16:26:44,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:26:44,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-09-16 16:26:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:26:44,990 INFO L225 Difference]: With dead ends: 393 [2019-09-16 16:26:44,990 INFO L226 Difference]: Without dead ends: 391 [2019-09-16 16:26:44,990 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:26:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-16 16:26:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 370. [2019-09-16 16:26:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-16 16:26:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 435 transitions. [2019-09-16 16:26:45,029 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 435 transitions. Word has length 44 [2019-09-16 16:26:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:26:45,029 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 435 transitions. [2019-09-16 16:26:45,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:26:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 435 transitions. [2019-09-16 16:26:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 16:26:45,030 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:26:45,031 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:26:45,031 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:26:45,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:26:45,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1122193205, now seen corresponding path program 1 times [2019-09-16 16:26:45,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:26:45,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:26:45,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:26:45,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:26:45,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:26:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:26:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:26:45,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:26:45,400 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:26:45,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:26:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:26:45,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-16 16:26:45,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:26:45,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:26:45,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:45,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:45,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:45,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-09-16 16:26:45,573 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:45,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-16 16:26:45,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:45,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:45,596 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 27 treesize of output 15 [2019-09-16 16:26:45,597 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:45,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:45,620 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 27 treesize of output 15 [2019-09-16 16:26:45,620 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:45,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:45,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:45,633 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-09-16 16:26:45,695 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:45,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 86 [2019-09-16 16:26:45,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:45,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:45,731 INFO L567 ElimStorePlain]: treesize reduction 48, result has 58.6 percent of original size [2019-09-16 16:26:45,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-09-16 16:26:45,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:45,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:45,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:45,749 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:60 [2019-09-16 16:26:45,854 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:26:45,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:45,888 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:45,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 89 [2019-09-16 16:26:45,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:45,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:45,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:45,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:45,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:45,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:45,893 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:26:45,925 INFO L567 ElimStorePlain]: treesize reduction 42, result has 50.0 percent of original size [2019-09-16 16:26:45,946 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:45,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 34 [2019-09-16 16:26:45,947 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:45,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:45,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:45,952 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:94, output treesize:7 [2019-09-16 16:26:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:26:45,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:26:45,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-09-16 16:26:45,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-16 16:26:45,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-16 16:26:45,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-16 16:26:45,965 INFO L87 Difference]: Start difference. First operand 370 states and 435 transitions. Second operand 16 states. [2019-09-16 16:26:48,330 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-16 16:26:48,843 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-16 16:26:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:26:49,338 INFO L93 Difference]: Finished difference Result 828 states and 974 transitions. [2019-09-16 16:26:49,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-16 16:26:49,338 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2019-09-16 16:26:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:26:49,342 INFO L225 Difference]: With dead ends: 828 [2019-09-16 16:26:49,342 INFO L226 Difference]: Without dead ends: 746 [2019-09-16 16:26:49,343 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=444, Invalid=1908, Unknown=0, NotChecked=0, Total=2352 [2019-09-16 16:26:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-09-16 16:26:49,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 477. [2019-09-16 16:26:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-09-16 16:26:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 561 transitions. [2019-09-16 16:26:49,381 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 561 transitions. Word has length 45 [2019-09-16 16:26:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:26:49,382 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 561 transitions. [2019-09-16 16:26:49,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-16 16:26:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 561 transitions. [2019-09-16 16:26:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 16:26:49,383 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:26:49,383 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:26:49,383 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:26:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:26:49,384 INFO L82 PathProgramCache]: Analyzing trace with hash 944633931, now seen corresponding path program 1 times [2019-09-16 16:26:49,384 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:26:49,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:26:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:26:49,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:26:49,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:26:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:26:49,585 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-09-16 16:26:49,798 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2019-09-16 16:26:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:26:50,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:26:50,233 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:26:50,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:26:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:26:50,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-16 16:26:50,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:26:50,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:26:50,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:50,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:50,414 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:50,415 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 1 case distinctions, treesize of input 27 treesize of output 31 [2019-09-16 16:26:50,415 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:50,461 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.6 percent of original size [2019-09-16 16:26:50,476 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-09-16 16:26:50,476 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 1 case distinctions, treesize of input 27 treesize of output 15 [2019-09-16 16:26:50,477 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:50,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:50,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:50,499 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:67, output treesize:44 [2019-09-16 16:26:50,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:50,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:50,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 329 treesize of output 333 [2019-09-16 16:26:50,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:50,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:50,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 525 treesize of output 529 [2019-09-16 16:26:50,681 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:51,263 WARN L191 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-09-16 16:26:51,264 INFO L567 ElimStorePlain]: treesize reduction 7, result has 99.2 percent of original size [2019-09-16 16:26:51,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:51,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:51,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2019-09-16 16:26:51,320 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:51,458 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-16 16:26:51,458 INFO L341 Elim1Store]: treesize reduction 88, result has 47.9 percent of original size [2019-09-16 16:26:51,459 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 237 treesize of output 212 [2019-09-16 16:26:51,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:51,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:26:51,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:51,475 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:26:51,756 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-16 16:26:51,756 INFO L567 ElimStorePlain]: treesize reduction 116, result has 71.1 percent of original size [2019-09-16 16:26:51,862 INFO L341 Elim1Store]: treesize reduction 16, result has 79.5 percent of original size [2019-09-16 16:26:51,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 128 [2019-09-16 16:26:51,863 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:51,913 INFO L341 Elim1Store]: treesize reduction 16, result has 66.0 percent of original size [2019-09-16 16:26:51,913 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 2 case distinctions, treesize of input 73 treesize of output 83 [2019-09-16 16:26:51,914 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:52,069 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-16 16:26:52,069 INFO L567 ElimStorePlain]: treesize reduction 48, result has 75.4 percent of original size [2019-09-16 16:26:52,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:52,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-09-16 16:26:52,071 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:855, output treesize:177 [2019-09-16 16:26:52,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:52,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:52,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:52,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:52,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:52,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:52,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:52,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:52,754 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2019-09-16 16:26:52,938 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-16 16:26:53,115 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-16 16:26:53,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:53,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:53,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:53,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:53,329 INFO L392 ElimStorePlain]: Different costs {26=[|#memory_$Pointer$.offset|], 32=[|#memory_$Pointer$.base|]} [2019-09-16 16:26:53,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:53,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:53,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:26:53,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:53,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 8 case distinctions, treesize of input 134 treesize of output 177 [2019-09-16 16:26:53,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:53,439 INFO L567 ElimStorePlain]: treesize reduction 20, result has 81.3 percent of original size [2019-09-16 16:26:53,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:53,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 78 [2019-09-16 16:26:53,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:26:53,473 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:26:53,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:26:53,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:26:53,476 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:202, output treesize:7 [2019-09-16 16:26:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:26:53,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:26:53,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2019-09-16 16:26:53,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-16 16:26:53,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-16 16:26:53,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-16 16:26:53,509 INFO L87 Difference]: Start difference. First operand 477 states and 561 transitions. Second operand 19 states. [2019-09-16 16:26:54,709 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 135 [2019-09-16 16:26:54,871 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-16 16:26:55,072 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-16 16:26:55,646 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 66 [2019-09-16 16:26:55,962 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 72 [2019-09-16 16:26:56,268 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 52 [2019-09-16 16:26:56,555 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-16 16:26:56,835 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 113 [2019-09-16 16:26:57,089 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-16 16:26:57,580 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 150 [2019-09-16 16:26:58,072 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-16 16:26:58,613 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 154 [2019-09-16 16:26:59,231 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-16 16:26:59,600 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-09-16 16:27:00,117 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 159 [2019-09-16 16:27:00,448 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-09-16 16:27:01,800 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-09-16 16:27:02,155 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-09-16 16:27:02,715 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-16 16:27:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:02,901 INFO L93 Difference]: Finished difference Result 1066 states and 1235 transitions. [2019-09-16 16:27:02,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-16 16:27:02,902 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-09-16 16:27:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:02,907 INFO L225 Difference]: With dead ends: 1066 [2019-09-16 16:27:02,907 INFO L226 Difference]: Without dead ends: 1013 [2019-09-16 16:27:02,909 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=564, Invalid=2516, Unknown=0, NotChecked=0, Total=3080 [2019-09-16 16:27:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-09-16 16:27:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 570. [2019-09-16 16:27:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-09-16 16:27:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 673 transitions. [2019-09-16 16:27:02,959 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 673 transitions. Word has length 45 [2019-09-16 16:27:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:02,960 INFO L475 AbstractCegarLoop]: Abstraction has 570 states and 673 transitions. [2019-09-16 16:27:02,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-16 16:27:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 673 transitions. [2019-09-16 16:27:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-16 16:27:02,961 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:02,961 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:02,962 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:02,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:02,962 INFO L82 PathProgramCache]: Analyzing trace with hash 49320255, now seen corresponding path program 1 times [2019-09-16 16:27:02,962 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:02,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:02,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:02,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:02,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-16 16:27:03,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:27:03,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 16:27:03,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:27:03,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:27:03,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:27:03,148 INFO L87 Difference]: Start difference. First operand 570 states and 673 transitions. Second operand 8 states. [2019-09-16 16:27:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:03,460 INFO L93 Difference]: Finished difference Result 591 states and 694 transitions. [2019-09-16 16:27:03,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:27:03,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-09-16 16:27:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:03,463 INFO L225 Difference]: With dead ends: 591 [2019-09-16 16:27:03,463 INFO L226 Difference]: Without dead ends: 560 [2019-09-16 16:27:03,464 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:27:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-16 16:27:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 544. [2019-09-16 16:27:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-16 16:27:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 646 transitions. [2019-09-16 16:27:03,508 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 646 transitions. Word has length 47 [2019-09-16 16:27:03,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:03,508 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 646 transitions. [2019-09-16 16:27:03,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:27:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 646 transitions. [2019-09-16 16:27:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-16 16:27:03,509 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:03,509 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:03,510 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:03,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:03,510 INFO L82 PathProgramCache]: Analyzing trace with hash 967827270, now seen corresponding path program 1 times [2019-09-16 16:27:03,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:03,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:03,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:27:04,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:27:04,062 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:04,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:04,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-16 16:27:04,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:27:04,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:27:04,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:04,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:04,235 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:04,235 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 1 case distinctions, treesize of input 27 treesize of output 31 [2019-09-16 16:27:04,236 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:04,279 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.6 percent of original size [2019-09-16 16:27:04,291 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-09-16 16:27:04,292 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 1 case distinctions, treesize of input 27 treesize of output 15 [2019-09-16 16:27:04,292 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:04,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:04,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:27:04,308 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:67, output treesize:44 [2019-09-16 16:27:04,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:04,403 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:04,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 525 treesize of output 529 [2019-09-16 16:27:04,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:04,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:04,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 329 treesize of output 333 [2019-09-16 16:27:04,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:05,119 WARN L191 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-09-16 16:27:05,119 INFO L567 ElimStorePlain]: treesize reduction 7, result has 99.2 percent of original size [2019-09-16 16:27:05,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:27:05,305 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-16 16:27:05,305 INFO L341 Elim1Store]: treesize reduction 88, result has 47.9 percent of original size [2019-09-16 16:27:05,306 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 237 treesize of output 212 [2019-09-16 16:27:05,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:05,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:27:05,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,317 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:27:05,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:27:05,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:27:05,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2019-09-16 16:27:05,346 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:05,598 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-16 16:27:05,598 INFO L567 ElimStorePlain]: treesize reduction 116, result has 71.1 percent of original size [2019-09-16 16:27:05,656 INFO L341 Elim1Store]: treesize reduction 16, result has 66.0 percent of original size [2019-09-16 16:27:05,656 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 2 case distinctions, treesize of input 73 treesize of output 83 [2019-09-16 16:27:05,657 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:05,753 INFO L341 Elim1Store]: treesize reduction 16, result has 79.5 percent of original size [2019-09-16 16:27:05,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 128 [2019-09-16 16:27:05,755 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:05,920 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-16 16:27:05,920 INFO L567 ElimStorePlain]: treesize reduction 48, result has 75.4 percent of original size [2019-09-16 16:27:05,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:05,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-09-16 16:27:05,922 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:855, output treesize:177 [2019-09-16 16:27:05,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:06,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:06,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:06,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:06,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:06,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:06,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:06,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:06,571 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2019-09-16 16:27:06,739 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-16 16:27:06,969 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-16 16:27:06,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,114 INFO L392 ElimStorePlain]: Different costs {26=[|#memory_$Pointer$.offset|], 32=[|#memory_$Pointer$.base|]} [2019-09-16 16:27:07,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:27:07,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:27:07,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:27:07,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:07,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 8 case distinctions, treesize of input 130 treesize of output 173 [2019-09-16 16:27:07,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:07,254 INFO L567 ElimStorePlain]: treesize reduction 36, result has 70.7 percent of original size [2019-09-16 16:27:07,288 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:07,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 78 [2019-09-16 16:27:07,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:07,293 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:27:07,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:07,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:27:07,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:198, output treesize:7 [2019-09-16 16:27:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:27:07,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:27:07,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2019-09-16 16:27:07,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-16 16:27:07,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-16 16:27:07,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-09-16 16:27:07,333 INFO L87 Difference]: Start difference. First operand 544 states and 646 transitions. Second operand 20 states. [2019-09-16 16:27:08,313 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 135 [2019-09-16 16:27:08,477 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-16 16:27:08,667 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-16 16:27:09,191 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 66 [2019-09-16 16:27:09,610 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 90 [2019-09-16 16:27:09,995 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 71 [2019-09-16 16:27:10,282 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-16 16:27:10,558 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 113 [2019-09-16 16:27:10,749 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-16 16:27:11,251 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 150 [2019-09-16 16:27:11,708 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-16 16:27:12,494 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 154 [2019-09-16 16:27:13,103 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-09-16 16:27:13,625 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 159 [2019-09-16 16:27:13,955 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-09-16 16:27:15,200 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-09-16 16:27:15,851 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-09-16 16:27:16,100 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-16 16:27:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:27:16,193 INFO L93 Difference]: Finished difference Result 983 states and 1141 transitions. [2019-09-16 16:27:16,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-16 16:27:16,193 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2019-09-16 16:27:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:27:16,197 INFO L225 Difference]: With dead ends: 983 [2019-09-16 16:27:16,197 INFO L226 Difference]: Without dead ends: 981 [2019-09-16 16:27:16,198 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=555, Invalid=2525, Unknown=0, NotChecked=0, Total=3080 [2019-09-16 16:27:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-09-16 16:27:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 553. [2019-09-16 16:27:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-09-16 16:27:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 655 transitions. [2019-09-16 16:27:16,248 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 655 transitions. Word has length 48 [2019-09-16 16:27:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:27:16,248 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 655 transitions. [2019-09-16 16:27:16,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-16 16:27:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 655 transitions. [2019-09-16 16:27:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-16 16:27:16,250 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:27:16,250 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:27:16,251 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:27:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:27:16,251 INFO L82 PathProgramCache]: Analyzing trace with hash 897146061, now seen corresponding path program 1 times [2019-09-16 16:27:16,251 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:27:16,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:27:16,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:16,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:16,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:27:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:16,665 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-09-16 16:27:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:27:16,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:27:16,812 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:16,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:27:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:27:16,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-16 16:27:16,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:27:17,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:17,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 54 [2019-09-16 16:27:17,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:17,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:27:17,053 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:27:17,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:27:17,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:27:17,286 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-16 16:27:17,290 INFO L168 Benchmark]: Toolchain (without parser) took 90616.66 ms. Allocated memory was 132.6 MB in the beginning and 543.2 MB in the end (delta: 410.5 MB). Free memory was 85.7 MB in the beginning and 492.1 MB in the end (delta: -406.5 MB). Peak memory consumption was 420.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:27:17,290 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:27:17,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.90 ms. Allocated memory was 132.6 MB in the beginning and 201.3 MB in the end (delta: 68.7 MB). Free memory was 85.5 MB in the beginning and 165.2 MB in the end (delta: -79.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-09-16 16:27:17,291 INFO L168 Benchmark]: Boogie Preprocessor took 105.90 ms. Allocated memory is still 201.3 MB. Free memory was 165.2 MB in the beginning and 162.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-09-16 16:27:17,293 INFO L168 Benchmark]: RCFGBuilder took 829.83 ms. Allocated memory is still 201.3 MB. Free memory was 162.1 MB in the beginning and 108.7 MB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:27:17,294 INFO L168 Benchmark]: TraceAbstraction took 88930.52 ms. Allocated memory was 201.3 MB in the beginning and 543.2 MB in the end (delta: 341.8 MB). Free memory was 108.1 MB in the beginning and 492.1 MB in the end (delta: -384.1 MB). Peak memory consumption was 374.5 MB. Max. memory is 7.1 GB. [2019-09-16 16:27:17,295 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 745.90 ms. Allocated memory was 132.6 MB in the beginning and 201.3 MB in the end (delta: 68.7 MB). Free memory was 85.5 MB in the beginning and 165.2 MB in the end (delta: -79.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.90 ms. Allocated memory is still 201.3 MB. Free memory was 165.2 MB in the beginning and 162.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 829.83 ms. Allocated memory is still 201.3 MB. Free memory was 162.1 MB in the beginning and 108.7 MB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88930.52 ms. Allocated memory was 201.3 MB in the beginning and 543.2 MB in the end (delta: 341.8 MB). Free memory was 108.1 MB in the beginning and 492.1 MB in the end (delta: -384.1 MB). Peak memory consumption was 374.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...