java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_0860_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:27:35,741 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:27:35,743 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:27:35,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:27:35,757 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:27:35,758 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:27:35,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:27:35,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:27:35,763 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:27:35,763 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:27:35,764 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:27:35,765 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:27:35,766 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:27:35,767 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:27:35,768 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:27:35,769 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:27:35,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:27:35,771 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:27:35,773 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:27:35,775 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:27:35,776 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:27:35,777 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:27:35,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:27:35,780 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:27:35,780 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:27:35,782 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:27:35,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:27:35,783 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:27:35,784 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:27:35,785 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:27:35,786 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:27:35,787 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:27:35,787 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:27:35,787 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:27:35,788 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:27:35,789 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:27:35,789 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 16:27:35,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:27:35,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:27:35,815 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:27:35,815 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:27:35,816 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:27:35,816 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:27:35,816 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:27:35,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:27:35,816 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:27:35,817 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:27:35,817 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:27:35,817 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:27:35,817 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:27:35,817 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:27:35,817 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:27:35,818 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:27:35,818 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:27:35,818 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:27:35,818 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:27:35,818 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:27:35,819 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:27:35,819 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:27:35,819 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:27:35,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:27:35,819 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:27:35,820 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:27:35,820 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:27:35,820 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:27:35,820 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:27:35,820 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:27:35,821 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:27:35,821 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:27:35,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:27:35,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:27:35,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:27:35,899 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:27:35,899 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:27:35,900 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_0860_true-unreach-call.c [2018-09-19 16:27:36,302 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3709ae90/908badec34904faaa23e3c17807ce440/FLAG72db7b4c6 [2018-09-19 16:27:36,516 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:27:36,519 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_0860_true-unreach-call.c [2018-09-19 16:27:36,532 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3709ae90/908badec34904faaa23e3c17807ce440/FLAG72db7b4c6 [2018-09-19 16:27:36,546 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3709ae90/908badec34904faaa23e3c17807ce440 [2018-09-19 16:27:36,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:27:36,560 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:27:36,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:27:36,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:27:36,569 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:27:36,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:27:36" (1/1) ... [2018-09-19 16:27:36,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc93e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:27:36, skipping insertion in model container [2018-09-19 16:27:36,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:27:36" (1/1) ... [2018-09-19 16:27:36,585 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:27:36,986 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:27:37,009 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:27:37,134 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:27:37,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:27:37 WrapperNode [2018-09-19 16:27:37,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:27:37,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:27:37,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:27:37,218 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:27:37,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:27:37" (1/1) ... [2018-09-19 16:27:37,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:27:37" (1/1) ... [2018-09-19 16:27:37,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:27:37" (1/1) ... [2018-09-19 16:27:37,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:27:37" (1/1) ... [2018-09-19 16:27:37,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:27:37" (1/1) ... [2018-09-19 16:27:37,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:27:37" (1/1) ... [2018-09-19 16:27:37,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:27:37" (1/1) ... [2018-09-19 16:27:37,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:27:37,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:27:37,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:27:37,368 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:27:37,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:27:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:27:37,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:27:37,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:27:37,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-09-19 16:27:37,573 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_float [2018-09-19 16:27:37,573 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_float [2018-09-19 16:27:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2018-09-19 16:27:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_powf [2018-09-19 16:27:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-09-19 16:27:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_float [2018-09-19 16:27:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_float [2018-09-19 16:27:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure isinteger_float [2018-09-19 16:27:37,575 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-09-19 16:27:37,575 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:27:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:27:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-19 16:27:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-09-19 16:27:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:27:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-19 16:27:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:27:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:27:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:27:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-19 16:27:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_float [2018-09-19 16:27:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_float [2018-09-19 16:27:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2018-09-19 16:27:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_powf [2018-09-19 16:27:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-09-19 16:27:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_float [2018-09-19 16:27:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure floor_float [2018-09-19 16:27:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure isinteger_float [2018-09-19 16:27:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-09-19 16:27:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:27:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:27:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:27:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:27:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-19 16:27:38,092 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:38,135 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:38,424 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:38,449 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:38,488 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:38,506 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:38,588 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:38,614 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:38,631 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:38,658 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:42,881 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:42,888 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:43,557 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:43,564 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:45,185 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:45,192 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:47,458 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:47,464 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:49,665 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:49,680 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:51,798 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:51,804 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:52,093 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:52,114 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:54,210 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:54,216 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:56,286 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:56,291 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:58,564 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:58,573 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:58,840 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:58,846 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:59,517 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:59,526 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:59,866 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:27:59,875 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:28:00,038 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:28:00,047 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:28:00,201 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:28:00,238 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:28:00,911 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:28:00,917 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:28:01,812 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:28:01,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:28:01 BoogieIcfgContainer [2018-09-19 16:28:01,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:28:01,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:28:01,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:28:01,818 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:28:01,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:27:36" (1/3) ... [2018-09-19 16:28:01,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68487b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:28:01, skipping insertion in model container [2018-09-19 16:28:01,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:27:37" (2/3) ... [2018-09-19 16:28:01,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68487b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:28:01, skipping insertion in model container [2018-09-19 16:28:01,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:28:01" (3/3) ... [2018-09-19 16:28:01,828 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0860_true-unreach-call.c [2018-09-19 16:28:01,839 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:28:01,852 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:28:01,908 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:28:01,909 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:28:01,909 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:28:01,910 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:28:01,910 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:28:01,910 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:28:01,910 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:28:01,910 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:28:01,910 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:28:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states. [2018-09-19 16:28:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-19 16:28:01,970 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:28:01,971 INFO L376 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] [2018-09-19 16:28:01,974 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:28:01,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1023226999, now seen corresponding path program 1 times [2018-09-19 16:28:01,988 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:28:01,989 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 16:28:01,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:28:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:28:02,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:28:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:28:02,226 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:28:02,242 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:28:02,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:28:02,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:28:02,259 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:28:02,259 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:28:02,261 INFO L87 Difference]: Start difference. First operand 554 states. Second operand 2 states. [2018-09-19 16:28:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:28:02,351 INFO L93 Difference]: Finished difference Result 1100 states and 1415 transitions. [2018-09-19 16:28:02,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:28:02,354 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-19 16:28:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:28:02,375 INFO L225 Difference]: With dead ends: 1100 [2018-09-19 16:28:02,376 INFO L226 Difference]: Without dead ends: 549 [2018-09-19 16:28:02,386 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:28:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-09-19 16:28:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2018-09-19 16:28:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-09-19 16:28:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 624 transitions. [2018-09-19 16:28:02,474 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 624 transitions. Word has length 27 [2018-09-19 16:28:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:28:02,475 INFO L480 AbstractCegarLoop]: Abstraction has 549 states and 624 transitions. [2018-09-19 16:28:02,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:28:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 624 transitions. [2018-09-19 16:28:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-19 16:28:02,479 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:28:02,479 INFO L376 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] [2018-09-19 16:28:02,480 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:28:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash -108711877, now seen corresponding path program 1 times [2018-09-19 16:28:02,481 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:28:02,481 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 16:28:02,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:28:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:28:02,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:28:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:28:02,723 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:28:02,737 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:28:02,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 16:28:02,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 16:28:02,739 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 16:28:02,739 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-19 16:28:02,740 INFO L87 Difference]: Start difference. First operand 549 states and 624 transitions. Second operand 5 states. [2018-09-19 16:28:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:28:03,224 INFO L93 Difference]: Finished difference Result 1096 states and 1246 transitions. [2018-09-19 16:28:03,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 16:28:03,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-09-19 16:28:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:28:03,230 INFO L225 Difference]: With dead ends: 1096 [2018-09-19 16:28:03,230 INFO L226 Difference]: Without dead ends: 549 [2018-09-19 16:28:03,233 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:28:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-09-19 16:28:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2018-09-19 16:28:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-09-19 16:28:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 621 transitions. [2018-09-19 16:28:03,279 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 621 transitions. Word has length 45 [2018-09-19 16:28:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:28:03,279 INFO L480 AbstractCegarLoop]: Abstraction has 549 states and 621 transitions. [2018-09-19 16:28:03,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 16:28:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 621 transitions. [2018-09-19 16:28:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-19 16:28:03,283 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:28:03,283 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:28:03,284 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:28:03,284 INFO L82 PathProgramCache]: Analyzing trace with hash -915066688, now seen corresponding path program 1 times [2018-09-19 16:28:03,285 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:28:03,285 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 16:28:03,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:28:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:28:03,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:28:03,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:28:03,629 INFO L477 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 8 treesize of output 7 [2018-09-19 16:28:03,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:28:03,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:03,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:03,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:28:03,677 INFO L477 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 29 treesize of output 21 [2018-09-19 16:28:03,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:28:03,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:28:03,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:03,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:03,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:28:04,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:28:04,229 INFO L477 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 8 treesize of output 7 [2018-09-19 16:28:04,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:28:04,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:04,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:04,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:28:04,381 INFO L477 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 29 treesize of output 21 [2018-09-19 16:28:04,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:28:04,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:28:04,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:04,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:04,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:28:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:28:04,766 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:28:04,784 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:28:04,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-19 16:28:04,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-19 16:28:04,785 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-19 16:28:04,785 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:28:04,786 INFO L87 Difference]: Start difference. First operand 549 states and 621 transitions. Second operand 17 states. [2018-09-19 16:28:06,585 WARN L178 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-19 16:28:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:28:20,982 INFO L93 Difference]: Finished difference Result 590 states and 664 transitions. [2018-09-19 16:28:20,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-19 16:28:20,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 100 [2018-09-19 16:28:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:28:20,993 INFO L225 Difference]: With dead ends: 590 [2018-09-19 16:28:20,994 INFO L226 Difference]: Without dead ends: 582 [2018-09-19 16:28:20,995 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2018-09-19 16:28:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-09-19 16:28:21,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 559. [2018-09-19 16:28:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-09-19 16:28:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 632 transitions. [2018-09-19 16:28:21,023 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 632 transitions. Word has length 100 [2018-09-19 16:28:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:28:21,024 INFO L480 AbstractCegarLoop]: Abstraction has 559 states and 632 transitions. [2018-09-19 16:28:21,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-19 16:28:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 632 transitions. [2018-09-19 16:28:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-19 16:28:21,028 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:28:21,029 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:28:21,029 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:28:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1221432030, now seen corresponding path program 1 times [2018-09-19 16:28:21,030 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:28:21,030 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 16:28:21,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:28:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:28:21,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:28:21,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:28:21,416 INFO L477 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 8 treesize of output 7 [2018-09-19 16:28:21,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:28:21,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:21,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:21,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:28:21,614 INFO L477 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 29 treesize of output 21 [2018-09-19 16:28:21,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:28:21,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:28:21,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:21,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:21,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:28:22,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:28:22,040 INFO L477 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 8 treesize of output 7 [2018-09-19 16:28:22,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:28:22,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:22,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:22,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:28:22,171 INFO L477 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 29 treesize of output 21 [2018-09-19 16:28:22,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:28:22,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:28:22,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:22,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:22,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:28:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:28:22,513 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:28:22,531 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:28:22,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-19 16:28:22,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-19 16:28:22,532 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-19 16:28:22,532 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:28:22,533 INFO L87 Difference]: Start difference. First operand 559 states and 632 transitions. Second operand 17 states. [2018-09-19 16:28:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:28:39,081 INFO L93 Difference]: Finished difference Result 622 states and 698 transitions. [2018-09-19 16:28:39,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-19 16:28:39,084 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2018-09-19 16:28:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:28:39,092 INFO L225 Difference]: With dead ends: 622 [2018-09-19 16:28:39,092 INFO L226 Difference]: Without dead ends: 614 [2018-09-19 16:28:39,094 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=156, Invalid=1176, Unknown=0, NotChecked=0, Total=1332 [2018-09-19 16:28:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-09-19 16:28:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 570. [2018-09-19 16:28:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-19 16:28:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 643 transitions. [2018-09-19 16:28:39,120 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 643 transitions. Word has length 101 [2018-09-19 16:28:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:28:39,121 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 643 transitions. [2018-09-19 16:28:39,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-19 16:28:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 643 transitions. [2018-09-19 16:28:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-19 16:28:39,123 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:28:39,124 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:28:39,124 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:28:39,124 INFO L82 PathProgramCache]: Analyzing trace with hash -40018148, now seen corresponding path program 1 times [2018-09-19 16:28:39,125 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:28:39,125 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 16:28:39,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:28:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:28:39,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:28:39,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:28:39,368 INFO L477 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 8 treesize of output 7 [2018-09-19 16:28:39,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:28:39,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:39,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:39,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:28:39,408 INFO L477 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 29 treesize of output 21 [2018-09-19 16:28:39,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:28:39,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:28:39,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:39,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:39,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:28:39,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:28:39,945 INFO L477 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 8 treesize of output 7 [2018-09-19 16:28:39,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:28:39,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:40,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:40,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:28:40,145 INFO L477 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 29 treesize of output 21 [2018-09-19 16:28:40,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:28:40,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:28:40,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:40,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:28:40,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:28:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:28:40,631 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:28:40,643 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:28:40,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-19 16:28:40,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-19 16:28:40,644 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-19 16:28:40,644 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:28:40,645 INFO L87 Difference]: Start difference. First operand 570 states and 643 transitions. Second operand 18 states. [2018-09-19 16:28:42,101 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-19 16:28:42,468 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-19 16:28:42,696 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2018-09-19 16:28:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:28:57,930 INFO L93 Difference]: Finished difference Result 588 states and 666 transitions. [2018-09-19 16:28:57,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-19 16:28:57,931 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 102 [2018-09-19 16:28:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:28:57,935 INFO L225 Difference]: With dead ends: 588 [2018-09-19 16:28:57,936 INFO L226 Difference]: Without dead ends: 578 [2018-09-19 16:28:57,937 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2018-09-19 16:28:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-09-19 16:28:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 570. [2018-09-19 16:28:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-19 16:28:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 642 transitions. [2018-09-19 16:28:57,961 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 642 transitions. Word has length 102 [2018-09-19 16:28:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:28:57,962 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 642 transitions. [2018-09-19 16:28:57,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-19 16:28:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 642 transitions. [2018-09-19 16:28:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-19 16:28:57,964 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:28:57,964 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:28:57,964 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:28:57,965 INFO L82 PathProgramCache]: Analyzing trace with hash -236531653, now seen corresponding path program 1 times [2018-09-19 16:28:57,965 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:28:57,965 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 16:28:57,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:28:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:28:58,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:28:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:28:58,246 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:28:58,258 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:28:58,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-19 16:28:58,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-19 16:28:58,261 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-19 16:28:58,261 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-19 16:28:58,261 INFO L87 Difference]: Start difference. First operand 570 states and 642 transitions. Second operand 7 states. [2018-09-19 16:29:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:29:05,663 INFO L93 Difference]: Finished difference Result 577 states and 650 transitions. [2018-09-19 16:29:05,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 16:29:05,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-09-19 16:29:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:29:05,674 INFO L225 Difference]: With dead ends: 577 [2018-09-19 16:29:05,675 INFO L226 Difference]: Without dead ends: 569 [2018-09-19 16:29:05,675 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:29:05,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-09-19 16:29:05,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2018-09-19 16:29:05,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-09-19 16:29:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 639 transitions. [2018-09-19 16:29:05,697 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 639 transitions. Word has length 102 [2018-09-19 16:29:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:29:05,698 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 639 transitions. [2018-09-19 16:29:05,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-19 16:29:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 639 transitions. [2018-09-19 16:29:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-19 16:29:05,700 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:29:05,700 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:29:05,700 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:29:05,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1097942362, now seen corresponding path program 1 times [2018-09-19 16:29:05,701 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:29:05,701 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-19 16:29:05,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:29:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:29:05,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:29:05,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:29:05,966 INFO L477 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 8 treesize of output 7 [2018-09-19 16:29:05,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:05,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:05,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:05,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:29:06,005 INFO L477 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 29 treesize of output 21 [2018-09-19 16:29:06,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:29:06,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:06,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:06,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:06,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:29:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:29:06,133 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:29:06,145 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:29:06,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:29:06,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:29:06,146 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:29:06,146 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:29:06,146 INFO L87 Difference]: Start difference. First operand 569 states and 639 transitions. Second operand 9 states. [2018-09-19 16:29:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:29:10,001 INFO L93 Difference]: Finished difference Result 850 states and 956 transitions. [2018-09-19 16:29:10,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:29:10,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2018-09-19 16:29:10,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:29:10,006 INFO L225 Difference]: With dead ends: 850 [2018-09-19 16:29:10,007 INFO L226 Difference]: Without dead ends: 523 [2018-09-19 16:29:10,009 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-09-19 16:29:10,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-09-19 16:29:10,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2018-09-19 16:29:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-09-19 16:29:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 579 transitions. [2018-09-19 16:29:10,037 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 579 transitions. Word has length 104 [2018-09-19 16:29:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:29:10,037 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 579 transitions. [2018-09-19 16:29:10,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:29:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 579 transitions. [2018-09-19 16:29:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-19 16:29:10,039 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:29:10,039 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:29:10,040 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:29:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash 528628771, now seen corresponding path program 1 times [2018-09-19 16:29:10,041 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:29:10,041 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-19 16:29:10,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:29:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:29:10,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:29:10,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:29:10,288 INFO L477 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 8 treesize of output 7 [2018-09-19 16:29:10,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:10,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:10,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:10,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:29:10,326 INFO L477 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 29 treesize of output 21 [2018-09-19 16:29:10,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:29:10,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:10,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:10,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:10,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:29:10,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:29:10,835 INFO L477 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 8 treesize of output 7 [2018-09-19 16:29:10,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:10,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:10,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:10,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:29:10,916 INFO L477 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 29 treesize of output 21 [2018-09-19 16:29:10,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:29:10,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:10,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:10,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:10,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:29:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:29:11,355 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:29:11,366 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:29:11,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-19 16:29:11,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-19 16:29:11,367 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-19 16:29:11,368 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:29:11,368 INFO L87 Difference]: Start difference. First operand 523 states and 579 transitions. Second operand 18 states. [2018-09-19 16:29:12,726 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-19 16:29:13,063 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-19 16:29:13,295 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2018-09-19 16:29:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:29:23,531 INFO L93 Difference]: Finished difference Result 1076 states and 1183 transitions. [2018-09-19 16:29:23,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-19 16:29:23,533 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 105 [2018-09-19 16:29:23,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:29:23,536 INFO L225 Difference]: With dead ends: 1076 [2018-09-19 16:29:23,537 INFO L226 Difference]: Without dead ends: 677 [2018-09-19 16:29:23,539 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2018-09-19 16:29:23,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-09-19 16:29:23,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 521. [2018-09-19 16:29:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-09-19 16:29:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 572 transitions. [2018-09-19 16:29:23,565 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 572 transitions. Word has length 105 [2018-09-19 16:29:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:29:23,566 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 572 transitions. [2018-09-19 16:29:23,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-19 16:29:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 572 transitions. [2018-09-19 16:29:23,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-19 16:29:23,567 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:29:23,568 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:29:23,568 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:29:23,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1613809251, now seen corresponding path program 1 times [2018-09-19 16:29:23,569 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:29:23,569 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-19 16:29:23,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:29:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:29:23,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:29:24,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:29:24,026 INFO L477 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 8 treesize of output 7 [2018-09-19 16:29:24,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:24,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:24,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:24,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:29:24,066 INFO L477 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 29 treesize of output 21 [2018-09-19 16:29:24,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:29:24,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:24,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:24,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:24,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:29:24,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:29:24,621 INFO L477 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 8 treesize of output 7 [2018-09-19 16:29:24,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:24,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:24,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:24,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:29:24,703 INFO L477 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 29 treesize of output 21 [2018-09-19 16:29:24,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:29:24,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:24,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:24,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:24,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:29:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:29:25,113 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:29:25,127 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:29:25,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-19 16:29:25,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-19 16:29:25,128 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-19 16:29:25,128 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:29:25,128 INFO L87 Difference]: Start difference. First operand 521 states and 572 transitions. Second operand 17 states. [2018-09-19 16:29:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:29:43,167 INFO L93 Difference]: Finished difference Result 960 states and 1056 transitions. [2018-09-19 16:29:43,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-19 16:29:43,169 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2018-09-19 16:29:43,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:29:43,174 INFO L225 Difference]: With dead ends: 960 [2018-09-19 16:29:43,174 INFO L226 Difference]: Without dead ends: 723 [2018-09-19 16:29:43,176 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2018-09-19 16:29:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-09-19 16:29:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 545. [2018-09-19 16:29:43,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-09-19 16:29:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 604 transitions. [2018-09-19 16:29:43,209 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 604 transitions. Word has length 107 [2018-09-19 16:29:43,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:29:43,210 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 604 transitions. [2018-09-19 16:29:43,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-19 16:29:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 604 transitions. [2018-09-19 16:29:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-19 16:29:43,211 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:29:43,211 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:29:43,212 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:29:43,212 INFO L82 PathProgramCache]: Analyzing trace with hash 222587763, now seen corresponding path program 1 times [2018-09-19 16:29:43,213 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:29:43,213 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:29:43,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-19 16:29:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:29:43,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:29:43,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:29:43,712 INFO L477 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 8 treesize of output 7 [2018-09-19 16:29:43,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:43,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:43,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:43,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:29:43,757 INFO L477 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 29 treesize of output 21 [2018-09-19 16:29:43,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:29:43,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:43,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:43,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:43,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:29:44,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:29:44,090 INFO L477 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 8 treesize of output 7 [2018-09-19 16:29:44,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:44,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:44,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:44,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:29:44,186 INFO L477 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 29 treesize of output 21 [2018-09-19 16:29:44,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:29:44,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:44,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:44,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:44,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:29:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:29:44,517 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:29:44,532 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:29:44,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-19 16:29:44,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-19 16:29:44,533 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-19 16:29:44,533 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:29:44,534 INFO L87 Difference]: Start difference. First operand 545 states and 604 transitions. Second operand 17 states. [2018-09-19 16:29:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:29:58,519 INFO L93 Difference]: Finished difference Result 591 states and 653 transitions. [2018-09-19 16:29:58,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-19 16:29:58,520 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 108 [2018-09-19 16:29:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:29:58,525 INFO L225 Difference]: With dead ends: 591 [2018-09-19 16:29:58,525 INFO L226 Difference]: Without dead ends: 583 [2018-09-19 16:29:58,526 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2018-09-19 16:29:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-09-19 16:29:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 545. [2018-09-19 16:29:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-09-19 16:29:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 604 transitions. [2018-09-19 16:29:58,559 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 604 transitions. Word has length 108 [2018-09-19 16:29:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:29:58,559 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 604 transitions. [2018-09-19 16:29:58,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-19 16:29:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 604 transitions. [2018-09-19 16:29:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-19 16:29:58,561 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:29:58,561 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:29:58,561 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:29:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1154801965, now seen corresponding path program 1 times [2018-09-19 16:29:58,562 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:29:58,562 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:29:58,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-19 16:29:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:29:58,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:29:59,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:29:59,140 INFO L477 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 8 treesize of output 7 [2018-09-19 16:29:59,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:59,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:59,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:59,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:29:59,206 INFO L477 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 29 treesize of output 21 [2018-09-19 16:29:59,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:29:59,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:29:59,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:59,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:29:59,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:29:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:29:59,362 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:29:59,375 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:29:59,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-19 16:29:59,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-19 16:29:59,376 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-19 16:29:59,376 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-09-19 16:29:59,376 INFO L87 Difference]: Start difference. First operand 545 states and 604 transitions. Second operand 15 states. [2018-09-19 16:30:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:30:13,021 INFO L93 Difference]: Finished difference Result 578 states and 647 transitions. [2018-09-19 16:30:13,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 16:30:13,022 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2018-09-19 16:30:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:30:13,025 INFO L225 Difference]: With dead ends: 578 [2018-09-19 16:30:13,025 INFO L226 Difference]: Without dead ends: 570 [2018-09-19 16:30:13,026 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-09-19 16:30:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-09-19 16:30:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 563. [2018-09-19 16:30:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-09-19 16:30:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 627 transitions. [2018-09-19 16:30:13,059 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 627 transitions. Word has length 108 [2018-09-19 16:30:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:30:13,060 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 627 transitions. [2018-09-19 16:30:13,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-19 16:30:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 627 transitions. [2018-09-19 16:30:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-19 16:30:13,061 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:30:13,062 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:30:13,062 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:30:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1147042606, now seen corresponding path program 1 times [2018-09-19 16:30:13,063 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:30:13,063 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-19 16:30:13,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:30:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:30:13,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:30:13,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:30:13,373 INFO L477 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 8 treesize of output 7 [2018-09-19 16:30:13,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:13,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:13,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:13,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:30:13,408 INFO L477 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 29 treesize of output 21 [2018-09-19 16:30:13,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:30:13,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:13,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:13,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:13,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:30:13,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:30:13,720 INFO L477 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 8 treesize of output 7 [2018-09-19 16:30:13,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:13,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:13,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:13,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:30:13,811 INFO L477 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 29 treesize of output 21 [2018-09-19 16:30:13,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:30:13,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:13,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:13,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:13,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:30:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:30:14,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:30:14,054 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:30:14,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-19 16:30:14,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-19 16:30:14,055 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-19 16:30:14,055 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-19 16:30:14,055 INFO L87 Difference]: Start difference. First operand 563 states and 627 transitions. Second operand 16 states. [2018-09-19 16:30:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:30:25,074 INFO L93 Difference]: Finished difference Result 605 states and 672 transitions. [2018-09-19 16:30:25,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-19 16:30:25,076 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-09-19 16:30:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:30:25,081 INFO L225 Difference]: With dead ends: 605 [2018-09-19 16:30:25,081 INFO L226 Difference]: Without dead ends: 597 [2018-09-19 16:30:25,082 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2018-09-19 16:30:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-19 16:30:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 555. [2018-09-19 16:30:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-19 16:30:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 617 transitions. [2018-09-19 16:30:25,112 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 617 transitions. Word has length 108 [2018-09-19 16:30:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:30:25,113 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 617 transitions. [2018-09-19 16:30:25,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-19 16:30:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 617 transitions. [2018-09-19 16:30:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-19 16:30:25,115 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:30:25,115 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:30:25,115 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:30:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1193267089, now seen corresponding path program 1 times [2018-09-19 16:30:25,116 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:30:25,116 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-19 16:30:25,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:30:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:30:25,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:30:26,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:30:26,058 INFO L477 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 8 treesize of output 7 [2018-09-19 16:30:26,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:26,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:26,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:26,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:30:26,146 INFO L477 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 29 treesize of output 21 [2018-09-19 16:30:26,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:30:26,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:26,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:26,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:26,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:30:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:30:26,387 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:30:26,400 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:30:26,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-19 16:30:26,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-19 16:30:26,401 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-19 16:30:26,401 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-09-19 16:30:26,401 INFO L87 Difference]: Start difference. First operand 555 states and 617 transitions. Second operand 16 states. [2018-09-19 16:30:28,818 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 16:30:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:30:37,337 INFO L93 Difference]: Finished difference Result 580 states and 648 transitions. [2018-09-19 16:30:37,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 16:30:37,339 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2018-09-19 16:30:37,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:30:37,342 INFO L225 Difference]: With dead ends: 580 [2018-09-19 16:30:37,342 INFO L226 Difference]: Without dead ends: 572 [2018-09-19 16:30:37,343 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2018-09-19 16:30:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-09-19 16:30:37,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 555. [2018-09-19 16:30:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-19 16:30:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 617 transitions. [2018-09-19 16:30:37,372 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 617 transitions. Word has length 109 [2018-09-19 16:30:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:30:37,372 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 617 transitions. [2018-09-19 16:30:37,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-19 16:30:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 617 transitions. [2018-09-19 16:30:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-19 16:30:37,374 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:30:37,374 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:30:37,375 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:30:37,375 INFO L82 PathProgramCache]: Analyzing trace with hash 512784806, now seen corresponding path program 1 times [2018-09-19 16:30:37,375 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:30:37,376 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-19 16:30:37,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:30:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:30:37,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:30:37,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:30:37,712 INFO L477 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 8 treesize of output 7 [2018-09-19 16:30:37,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:37,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:37,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:37,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:30:37,750 INFO L477 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 29 treesize of output 21 [2018-09-19 16:30:37,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:30:37,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:37,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:37,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:37,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:30:37,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:30:37,886 INFO L477 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 8 treesize of output 7 [2018-09-19 16:30:37,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:37,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:37,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:37,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:35 [2018-09-19 16:30:37,970 INFO L477 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 56 treesize of output 42 [2018-09-19 16:30:37,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 42 treesize of output 28 [2018-09-19 16:30:37,990 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:30:38,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:30:38,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:30:38,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:28 [2018-09-19 16:30:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:30:38,940 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:30:38,953 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:30:38,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-19 16:30:38,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-19 16:30:38,955 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-19 16:30:38,955 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:30:38,955 INFO L87 Difference]: Start difference. First operand 555 states and 617 transitions. Second operand 17 states. [2018-09-19 16:30:42,318 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-09-19 16:30:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:30:43,978 INFO L93 Difference]: Finished difference Result 1035 states and 1143 transitions. [2018-09-19 16:30:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-19 16:30:43,979 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2018-09-19 16:30:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:30:43,982 INFO L225 Difference]: With dead ends: 1035 [2018-09-19 16:30:43,982 INFO L226 Difference]: Without dead ends: 569 [2018-09-19 16:30:43,984 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2018-09-19 16:30:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-09-19 16:30:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 555. [2018-09-19 16:30:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-19 16:30:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 615 transitions. [2018-09-19 16:30:44,012 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 615 transitions. Word has length 112 [2018-09-19 16:30:44,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:30:44,013 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 615 transitions. [2018-09-19 16:30:44,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-19 16:30:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 615 transitions. [2018-09-19 16:30:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-19 16:30:44,015 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:30:44,015 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:30:44,015 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:30:44,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1712493745, now seen corresponding path program 1 times [2018-09-19 16:30:44,016 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:30:44,016 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-09-19 16:30:44,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:30:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:30:44,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:30:44,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:30:44,425 INFO L477 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 8 treesize of output 7 [2018-09-19 16:30:44,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:44,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:44,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:44,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:30:44,635 INFO L477 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 29 treesize of output 21 [2018-09-19 16:30:44,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:30:44,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:44,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:44,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:44,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:30:44,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:30:44,839 INFO L477 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 8 treesize of output 7 [2018-09-19 16:30:44,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:44,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:44,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:30:44,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-09-19 16:30:44,937 INFO L477 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 29 treesize of output 21 [2018-09-19 16:30:44,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 6 [2018-09-19 16:30:44,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:44,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:44,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:30:44,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2018-09-19 16:30:46,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:30:46,120 INFO L477 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 8 treesize of output 7 [2018-09-19 16:30:46,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:46,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:46,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:46,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:30:46,236 INFO L477 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 29 treesize of output 21 [2018-09-19 16:30:46,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:30:46,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:30:46,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:46,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:30:46,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:30:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:30:46,746 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:30:46,758 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:30:46,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-09-19 16:30:46,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-19 16:30:46,759 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-19 16:30:46,759 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2018-09-19 16:30:46,759 INFO L87 Difference]: Start difference. First operand 555 states and 615 transitions. Second operand 25 states. [2018-09-19 16:30:52,869 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-09-19 16:31:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:31:04,848 INFO L93 Difference]: Finished difference Result 603 states and 670 transitions. [2018-09-19 16:31:04,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-19 16:31:04,850 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 113 [2018-09-19 16:31:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:31:04,853 INFO L225 Difference]: With dead ends: 603 [2018-09-19 16:31:04,854 INFO L226 Difference]: Without dead ends: 595 [2018-09-19 16:31:04,855 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=188, Invalid=2068, Unknown=0, NotChecked=0, Total=2256 [2018-09-19 16:31:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-09-19 16:31:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 555. [2018-09-19 16:31:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-19 16:31:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 615 transitions. [2018-09-19 16:31:04,884 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 615 transitions. Word has length 113 [2018-09-19 16:31:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:31:04,885 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 615 transitions. [2018-09-19 16:31:04,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-19 16:31:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 615 transitions. [2018-09-19 16:31:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-19 16:31:04,886 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:31:04,887 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:31:04,887 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:31:04,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1243997904, now seen corresponding path program 1 times [2018-09-19 16:31:04,888 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:31:04,888 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-19 16:31:04,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:31:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:31:05,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:31:05,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:31:05,210 INFO L477 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 8 treesize of output 7 [2018-09-19 16:31:05,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:05,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:05,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:05,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:31:05,348 INFO L477 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 29 treesize of output 21 [2018-09-19 16:31:05,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:31:05,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:05,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:05,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:05,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:31:05,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:31:05,983 INFO L477 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 8 treesize of output 7 [2018-09-19 16:31:05,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:05,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:06,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:06,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:31:06,070 INFO L477 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 29 treesize of output 21 [2018-09-19 16:31:06,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:31:06,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:06,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:06,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:06,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:31:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:31:06,432 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:31:06,445 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:31:06,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-19 16:31:06,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-19 16:31:06,446 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-19 16:31:06,446 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:31:06,446 INFO L87 Difference]: Start difference. First operand 555 states and 615 transitions. Second operand 18 states. [2018-09-19 16:31:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:31:22,621 INFO L93 Difference]: Finished difference Result 597 states and 659 transitions. [2018-09-19 16:31:22,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-19 16:31:22,623 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 114 [2018-09-19 16:31:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:31:22,625 INFO L225 Difference]: With dead ends: 597 [2018-09-19 16:31:22,625 INFO L226 Difference]: Without dead ends: 587 [2018-09-19 16:31:22,626 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=166, Invalid=1316, Unknown=0, NotChecked=0, Total=1482 [2018-09-19 16:31:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-09-19 16:31:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2018-09-19 16:31:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-09-19 16:31:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 590 transitions. [2018-09-19 16:31:22,654 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 590 transitions. Word has length 114 [2018-09-19 16:31:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:31:22,655 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 590 transitions. [2018-09-19 16:31:22,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-19 16:31:22,655 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 590 transitions. [2018-09-19 16:31:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-19 16:31:22,656 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:31:22,657 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:31:22,657 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:31:22,657 INFO L82 PathProgramCache]: Analyzing trace with hash 958179074, now seen corresponding path program 1 times [2018-09-19 16:31:22,657 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:31:22,657 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-09-19 16:31:22,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:31:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:31:23,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:31:23,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:31:23,425 INFO L477 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 8 treesize of output 7 [2018-09-19 16:31:23,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:23,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:23,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:23,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:31:23,641 INFO L477 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 29 treesize of output 21 [2018-09-19 16:31:23,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:31:23,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:23,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:23,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:23,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:31:24,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:31:24,707 INFO L477 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 8 treesize of output 7 [2018-09-19 16:31:24,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:24,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:24,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:24,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:31:24,789 INFO L477 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 29 treesize of output 21 [2018-09-19 16:31:24,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:31:24,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:24,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:24,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:24,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:31:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:31:25,147 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:31:25,161 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:31:25,162 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-19 16:31:25,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-19 16:31:25,162 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-19 16:31:25,163 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:31:25,163 INFO L87 Difference]: Start difference. First operand 534 states and 590 transitions. Second operand 18 states. [2018-09-19 16:31:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:31:39,336 INFO L93 Difference]: Finished difference Result 1081 states and 1179 transitions. [2018-09-19 16:31:39,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-19 16:31:39,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2018-09-19 16:31:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:31:39,342 INFO L225 Difference]: With dead ends: 1081 [2018-09-19 16:31:39,342 INFO L226 Difference]: Without dead ends: 716 [2018-09-19 16:31:39,344 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2018-09-19 16:31:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-09-19 16:31:39,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 554. [2018-09-19 16:31:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-09-19 16:31:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 613 transitions. [2018-09-19 16:31:39,378 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 613 transitions. Word has length 121 [2018-09-19 16:31:39,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:31:39,379 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 613 transitions. [2018-09-19 16:31:39,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-19 16:31:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 613 transitions. [2018-09-19 16:31:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-19 16:31:39,380 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:31:39,380 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:31:39,381 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:31:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2036171686, now seen corresponding path program 1 times [2018-09-19 16:31:39,381 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:31:39,382 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-09-19 16:31:39,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:31:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:31:39,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:31:40,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:31:40,093 INFO L477 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 8 treesize of output 7 [2018-09-19 16:31:40,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:40,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:40,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:40,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:31:40,311 INFO L477 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 29 treesize of output 21 [2018-09-19 16:31:40,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:31:40,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:40,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:40,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:40,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:31:41,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:31:41,615 INFO L477 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 8 treesize of output 7 [2018-09-19 16:31:41,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:41,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:41,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:41,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:31:41,693 INFO L477 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 29 treesize of output 21 [2018-09-19 16:31:41,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:31:41,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:41,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:41,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:41,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:31:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:31:42,091 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:31:42,107 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:31:42,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-19 16:31:42,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-19 16:31:42,109 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-19 16:31:42,109 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:31:42,109 INFO L87 Difference]: Start difference. First operand 554 states and 613 transitions. Second operand 18 states. [2018-09-19 16:31:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:31:57,557 INFO L93 Difference]: Finished difference Result 602 states and 665 transitions. [2018-09-19 16:31:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-19 16:31:57,559 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2018-09-19 16:31:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:31:57,561 INFO L225 Difference]: With dead ends: 602 [2018-09-19 16:31:57,561 INFO L226 Difference]: Without dead ends: 594 [2018-09-19 16:31:57,562 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2018-09-19 16:31:57,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-09-19 16:31:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 575. [2018-09-19 16:31:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-09-19 16:31:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 638 transitions. [2018-09-19 16:31:57,596 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 638 transitions. Word has length 121 [2018-09-19 16:31:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:31:57,597 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 638 transitions. [2018-09-19 16:31:57,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-19 16:31:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 638 transitions. [2018-09-19 16:31:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-19 16:31:57,599 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:31:57,599 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:31:57,599 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:31:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash 658781958, now seen corresponding path program 1 times [2018-09-19 16:31:57,600 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:31:57,600 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:31:57,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2018-09-19 16:31:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:31:57,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:31:57,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:31:57,952 INFO L477 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 8 treesize of output 7 [2018-09-19 16:31:57,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:57,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:57,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:57,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:31:57,987 INFO L477 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 29 treesize of output 21 [2018-09-19 16:31:57,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:31:57,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:57,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:57,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:57,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:31:58,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:31:58,045 INFO L477 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 8 treesize of output 7 [2018-09-19 16:31:58,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:58,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:58,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:58,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:31:58,092 INFO L477 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 43 treesize of output 31 [2018-09-19 16:31:58,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-09-19 16:31:58,104 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:31:58,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:31:58,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:31:58,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2018-09-19 16:31:58,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:31:58,628 INFO L477 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 8 treesize of output 7 [2018-09-19 16:31:58,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:58,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:58,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:58,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:31:58,714 INFO L477 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 29 treesize of output 21 [2018-09-19 16:31:58,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 9 [2018-09-19 16:31:58,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:31:58,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:58,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:31:58,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:31:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:31:58,929 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:31:58,941 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:31:58,942 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-09-19 16:31:58,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-19 16:31:58,944 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-19 16:31:58,944 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-09-19 16:31:58,944 INFO L87 Difference]: Start difference. First operand 575 states and 638 transitions. Second operand 20 states. Received shutdown request... [2018-09-19 16:32:07,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-19 16:32:07,814 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-19 16:32:07,820 WARN L206 ceAbstractionStarter]: Timeout [2018-09-19 16:32:07,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:32:07 BoogieIcfgContainer [2018-09-19 16:32:07,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:32:07,822 INFO L168 Benchmark]: Toolchain (without parser) took 271263.78 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 955.3 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -351.3 MB). Peak memory consumption was 604.0 MB. Max. memory is 7.1 GB. [2018-09-19 16:32:07,822 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:32:07,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 16:32:07,823 INFO L168 Benchmark]: Boogie Preprocessor took 149.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:32:07,823 INFO L168 Benchmark]: RCFGBuilder took 24445.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -716.4 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2018-09-19 16:32:07,823 INFO L168 Benchmark]: TraceAbstraction took 246006.21 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 205.0 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 319.8 MB). Peak memory consumption was 524.8 MB. Max. memory is 7.1 GB. [2018-09-19 16:32:07,825 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 656.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 24445.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -716.4 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246006.21 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 205.0 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 319.8 MB). Peak memory consumption was 524.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 588]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 588). Cancelled while BasicCegarLoop was constructing difference of abstraction (575states) and FLOYD_HOARE automaton (currently 25 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (231 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 568 locations, 1 error locations. TIMEOUT Result, 245.9s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 219.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10032 SDtfs, 12663 SDslu, 111033 SDs, 0 SdLazy, 15263 SolverSat, 233 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 180.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2169 GetRequests, 1653 SyntacticMatches, 4 SemanticMatches, 512 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2214 ImplicationChecksByTransitivity, 38.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=575occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 801 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 20.0s InterpolantComputationTime, 1928 NumberOfCodeBlocks, 1928 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1909 ConstructedInterpolants, 250 QuantifiedInterpolants, 1194171 SizeOfPredicates, 262 NumberOfNonLiveVariables, 5691 ConjunctsInSsa, 333 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 238/238 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown