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_0210_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:20:03,178 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:20:03,180 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:20:03,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:20:03,193 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:20:03,194 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:20:03,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:20:03,197 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:20:03,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:20:03,200 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:20:03,201 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:20:03,202 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:20:03,203 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:20:03,204 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:20:03,205 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:20:03,206 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:20:03,207 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:20:03,209 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:20:03,211 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:20:03,212 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:20:03,213 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:20:03,215 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:20:03,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:20:03,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:20:03,218 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:20:03,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:20:03,220 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:20:03,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:20:03,222 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:20:03,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:20:03,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:20:03,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:20:03,225 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:20:03,225 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:20:03,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:20:03,227 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:20:03,227 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:20:03,258 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:20:03,258 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:20:03,259 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:20:03,259 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:20:03,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:20:03,260 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:20:03,260 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:20:03,261 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:20:03,261 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:20:03,261 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:20:03,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:20:03,262 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:20:03,262 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:20:03,263 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:20:03,263 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:20:03,263 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:20:03,263 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:20:03,263 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:20:03,263 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:20:03,264 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:20:03,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:20:03,264 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:20:03,264 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:20:03,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:20:03,266 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:20:03,266 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:20:03,266 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:20:03,266 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:20:03,266 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:20:03,266 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:20:03,267 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:20:03,267 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:20:03,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:20:03,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:20:03,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:20:03,333 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:20:03,333 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:20:03,334 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_0210_true-unreach-call.c [2018-09-19 16:20:03,683 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce3e6312/e97da60ce1b246be8287f6360ff5bfb3/FLAG9ccf85edd [2018-09-19 16:20:03,949 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:20:03,950 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_0210_true-unreach-call.c [2018-09-19 16:20:03,962 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce3e6312/e97da60ce1b246be8287f6360ff5bfb3/FLAG9ccf85edd [2018-09-19 16:20:03,978 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce3e6312/e97da60ce1b246be8287f6360ff5bfb3 [2018-09-19 16:20:03,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:20:03,993 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:20:03,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:20:03,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:20:04,001 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:20:04,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:20:03" (1/1) ... [2018-09-19 16:20:04,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7201b880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:20:04, skipping insertion in model container [2018-09-19 16:20:04,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:20:03" (1/1) ... [2018-09-19 16:20:04,018 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:20:04,519 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:20:04,589 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:20:04,751 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:20:04,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:20:04 WrapperNode [2018-09-19 16:20:04,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:20:04,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:20:04,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:20:04,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:20:04,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:20:04" (1/1) ... [2018-09-19 16:20:04,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:20:04" (1/1) ... [2018-09-19 16:20:05,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:20:04" (1/1) ... [2018-09-19 16:20:05,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:20:04" (1/1) ... [2018-09-19 16:20:05,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:20:04" (1/1) ... [2018-09-19 16:20:05,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:20:04" (1/1) ... [2018-09-19 16:20:05,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:20:04" (1/1) ... [2018-09-19 16:20:05,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:20:05,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:20:05,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:20:05,125 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:20:05,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:20:04" (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:20:05,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:20:05,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:20:05,202 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_float [2018-09-19 16:20:05,202 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-09-19 16:20:05,202 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_float [2018-09-19 16:20:05,202 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_float [2018-09-19 16:20:05,202 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2018-09-19 16:20:05,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __kernel_rem_pio2f [2018-09-19 16:20:05,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_rem_pio2f [2018-09-19 16:20:05,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __kernel_sinf [2018-09-19 16:20:05,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __kernel_cosf [2018-09-19 16:20:05,203 INFO L138 BoogieDeclarations]: Found implementation of procedure sin_float [2018-09-19 16:20:05,206 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:20:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:20:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure floor_float [2018-09-19 16:20:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:20:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-19 16:20:05,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:20:05,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:20:05,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:20:05,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-19 16:20:05,207 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-09-19 16:20:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_float [2018-09-19 16:20:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_float [2018-09-19 16:20:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2018-09-19 16:20:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure __kernel_rem_pio2f [2018-09-19 16:20:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_rem_pio2f [2018-09-19 16:20:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure __kernel_sinf [2018-09-19 16:20:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure __kernel_cosf [2018-09-19 16:20:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure sin_float [2018-09-19 16:20:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:20:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:20:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:20:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:20:05,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-19 16:20:07,804 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:07,827 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:12,151 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:12,171 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:12,184 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:21,298 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:21,394 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:21,478 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:23,202 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:23,216 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:23,230 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:23,313 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:23,326 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:23,652 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:23,665 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:23,683 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:23,704 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:27,222 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:27,255 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:27,686 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:27,695 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:33,905 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:33,912 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:33,962 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,046 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,058 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,133 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,139 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,148 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,152 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,222 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,317 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,384 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,469 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,637 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,726 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,794 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:34,880 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:36,965 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:37,001 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:37,008 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:37,016 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:37,994 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:38,002 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:38,024 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:39,666 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:39,752 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:39,759 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:39,769 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:39,805 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:39,828 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:39,936 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:40,388 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:40,396 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:40,508 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:40,513 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:20:40,684 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:20:40,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:20:40 BoogieIcfgContainer [2018-09-19 16:20:40,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:20:40,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:20:40,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:20:40,689 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:20:40,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:20:03" (1/3) ... [2018-09-19 16:20:40,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662a2fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:20:40, skipping insertion in model container [2018-09-19 16:20:40,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:20:04" (2/3) ... [2018-09-19 16:20:40,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662a2fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:20:40, skipping insertion in model container [2018-09-19 16:20:40,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:20:40" (3/3) ... [2018-09-19 16:20:40,693 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0210_true-unreach-call.c [2018-09-19 16:20:40,703 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:20:40,713 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:20:40,767 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:20:40,767 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:20:40,768 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:20:40,768 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:20:40,768 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:20:40,768 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:20:40,768 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:20:40,769 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:20:40,769 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:20:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2018-09-19 16:20:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-19 16:20:40,828 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:20:40,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:40,832 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:20:40,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1235862278, now seen corresponding path program 1 times [2018-09-19 16:20:40,844 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:20:40,845 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:20:40,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:20:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:20:41,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:20:41,404 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:20:41,404 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:20:41,423 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:20:41,424 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:20:41,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:20:41,441 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:20:41,442 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:20:41,445 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 2 states. [2018-09-19 16:20:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:20:41,561 INFO L93 Difference]: Finished difference Result 1288 states and 1614 transitions. [2018-09-19 16:20:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:20:41,563 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 225 [2018-09-19 16:20:41,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:20:41,587 INFO L225 Difference]: With dead ends: 1288 [2018-09-19 16:20:41,587 INFO L226 Difference]: Without dead ends: 745 [2018-09-19 16:20:41,597 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 224 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:20:41,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-09-19 16:20:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2018-09-19 16:20:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-09-19 16:20:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 840 transitions. [2018-09-19 16:20:41,703 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 840 transitions. Word has length 225 [2018-09-19 16:20:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:20:41,705 INFO L480 AbstractCegarLoop]: Abstraction has 745 states and 840 transitions. [2018-09-19 16:20:41,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:20:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 840 transitions. [2018-09-19 16:20:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-19 16:20:41,714 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:20:41,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:41,716 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:20:41,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1040884851, now seen corresponding path program 1 times [2018-09-19 16:20:41,718 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:20:41,718 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:20:41,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:20:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:20:42,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:20:42,730 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:20:42,730 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:20:42,745 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:20:42,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:20:42,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:20:42,748 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:20:42,749 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:20:42,749 INFO L87 Difference]: Start difference. First operand 745 states and 840 transitions. Second operand 9 states. [2018-09-19 16:20:43,234 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-19 16:20:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:20:44,196 INFO L93 Difference]: Finished difference Result 752 states and 847 transitions. [2018-09-19 16:20:44,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-19 16:20:44,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 234 [2018-09-19 16:20:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:20:44,206 INFO L225 Difference]: With dead ends: 752 [2018-09-19 16:20:44,207 INFO L226 Difference]: Without dead ends: 743 [2018-09-19 16:20:44,208 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-09-19 16:20:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-09-19 16:20:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2018-09-19 16:20:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-09-19 16:20:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 837 transitions. [2018-09-19 16:20:44,241 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 837 transitions. Word has length 234 [2018-09-19 16:20:44,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:20:44,242 INFO L480 AbstractCegarLoop]: Abstraction has 743 states and 837 transitions. [2018-09-19 16:20:44,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:20:44,242 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 837 transitions. [2018-09-19 16:20:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-09-19 16:20:44,247 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:20:44,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:44,248 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:20:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1945490311, now seen corresponding path program 1 times [2018-09-19 16:20:44,250 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:20:44,250 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:20:44,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:20:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:20:44,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:20:44,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:20:44,715 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:20:44,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:20:44,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:20:44,792 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:20:44,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:20:44,828 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:20:44,832 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:20:44,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:20:44,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:20:44,840 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:20:44,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:20:45,116 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:20:45,116 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:20:45,133 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:20:45,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:20:45,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:20:45,137 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:20:45,138 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:20:45,138 INFO L87 Difference]: Start difference. First operand 743 states and 837 transitions. Second operand 9 states. [2018-09-19 16:20:46,501 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-19 16:20:46,800 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-19 16:20:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:20:50,964 INFO L93 Difference]: Finished difference Result 753 states and 846 transitions. [2018-09-19 16:20:50,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 16:20:50,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 251 [2018-09-19 16:20:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:20:50,970 INFO L225 Difference]: With dead ends: 753 [2018-09-19 16:20:50,970 INFO L226 Difference]: Without dead ends: 739 [2018-09-19 16:20:50,971 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-09-19 16:20:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-09-19 16:20:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2018-09-19 16:20:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-09-19 16:20:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 831 transitions. [2018-09-19 16:20:50,994 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 831 transitions. Word has length 251 [2018-09-19 16:20:50,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:20:50,995 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 831 transitions. [2018-09-19 16:20:50,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:20:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 831 transitions. [2018-09-19 16:20:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-09-19 16:20:51,000 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:20:51,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:51,001 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:20:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1642496785, now seen corresponding path program 1 times [2018-09-19 16:20:51,002 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:20:51,002 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:20:51,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:20:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:20:51,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:20:51,495 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:20:51,502 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:20:51,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:20:51,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:20:51,517 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:20:51,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:20:51,546 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:20:51,558 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:20:51,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:20:51,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:20:51,587 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:20:51,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:20:51,963 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:20:51,964 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:20:51,977 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:20:51,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 16:20:51,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:20:51,979 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:20:51,979 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-19 16:20:51,979 INFO L87 Difference]: Start difference. First operand 739 states and 831 transitions. Second operand 11 states. [2018-09-19 16:20:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:20:59,941 INFO L93 Difference]: Finished difference Result 783 states and 882 transitions. [2018-09-19 16:20:59,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 16:20:59,943 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 263 [2018-09-19 16:20:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:20:59,949 INFO L225 Difference]: With dead ends: 783 [2018-09-19 16:20:59,949 INFO L226 Difference]: Without dead ends: 734 [2018-09-19 16:20:59,950 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-09-19 16:20:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-09-19 16:20:59,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-09-19 16:20:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-09-19 16:20:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 825 transitions. [2018-09-19 16:20:59,990 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 825 transitions. Word has length 263 [2018-09-19 16:20:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:20:59,993 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 825 transitions. [2018-09-19 16:20:59,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:20:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 825 transitions. [2018-09-19 16:20:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-19 16:20:59,997 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:20:59,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:59,997 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:20:59,998 INFO L82 PathProgramCache]: Analyzing trace with hash -870510342, now seen corresponding path program 1 times [2018-09-19 16:20:59,999 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:20:59,999 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:21:00,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:21:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:21:00,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:21:00,574 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:21:00,574 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:21:00,587 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:21:00,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 16:21:00,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 16:21:00,589 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 16:21:00,589 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-19 16:21:00,591 INFO L87 Difference]: Start difference. First operand 734 states and 825 transitions. Second operand 5 states. [2018-09-19 16:21:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:21:00,667 INFO L93 Difference]: Finished difference Result 817 states and 919 transitions. [2018-09-19 16:21:00,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 16:21:00,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2018-09-19 16:21:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:21:00,672 INFO L225 Difference]: With dead ends: 817 [2018-09-19 16:21:00,672 INFO L226 Difference]: Without dead ends: 735 [2018-09-19 16:21:00,673 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-19 16:21:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-09-19 16:21:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2018-09-19 16:21:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-09-19 16:21:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 825 transitions. [2018-09-19 16:21:00,699 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 825 transitions. Word has length 266 [2018-09-19 16:21:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:21:00,700 INFO L480 AbstractCegarLoop]: Abstraction has 735 states and 825 transitions. [2018-09-19 16:21:00,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 16:21:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 825 transitions. [2018-09-19 16:21:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-19 16:21:00,702 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:21:00,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:00,703 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:21:00,703 INFO L82 PathProgramCache]: Analyzing trace with hash -663144121, now seen corresponding path program 1 times [2018-09-19 16:21:00,704 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:21:00,704 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:21:00,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:21:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:21:01,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:21:01,385 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:21:01,435 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:21:01,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:21:01,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:21:01,588 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:21:01,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2018-09-19 16:21:02,218 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-09-19 16:21:02,220 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 46 treesize of output 34 [2018-09-19 16:21:02,282 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 34 treesize of output 22 [2018-09-19 16:21:02,283 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:21:02,407 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:21:02,517 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:21:02,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:22 [2018-09-19 16:21:03,235 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:21:03,468 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:21:03,480 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:21:03,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:21:03,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:21:03,513 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:21:03,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:21:03,737 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:21:03,741 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:21:03,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:21:03,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:21:03,748 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:21:03,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:21:06,246 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:21:06,246 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:21:06,259 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:21:06,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-19 16:21:06,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-19 16:21:06,261 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-19 16:21:06,261 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-19 16:21:06,261 INFO L87 Difference]: Start difference. First operand 735 states and 825 transitions. Second operand 15 states. [2018-09-19 16:21:21,547 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-19 16:21:29,830 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-19 16:21:30,597 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-19 16:21:44,513 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-19 16:21:46,236 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-19 16:21:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:21:54,004 INFO L93 Difference]: Finished difference Result 766 states and 861 transitions. [2018-09-19 16:21:54,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 16:21:54,009 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 282 [2018-09-19 16:21:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:21:54,015 INFO L225 Difference]: With dead ends: 766 [2018-09-19 16:21:54,015 INFO L226 Difference]: Without dead ends: 741 [2018-09-19 16:21:54,016 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2018-09-19 16:21:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-09-19 16:21:54,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 740. [2018-09-19 16:21:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-09-19 16:21:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 831 transitions. [2018-09-19 16:21:54,044 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 831 transitions. Word has length 282 [2018-09-19 16:21:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:21:54,045 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 831 transitions. [2018-09-19 16:21:54,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-19 16:21:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 831 transitions. [2018-09-19 16:21:54,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-09-19 16:21:54,048 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:21:54,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:54,048 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:21:54,049 INFO L82 PathProgramCache]: Analyzing trace with hash -79372205, now seen corresponding path program 1 times [2018-09-19 16:21:54,050 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:21:54,050 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:21:54,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:21:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:21:54,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:21:54,972 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:21:54,972 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:21:54,994 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:21:54,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:21:54,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:21:54,995 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:21:54,995 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:21:54,996 INFO L87 Difference]: Start difference. First operand 740 states and 831 transitions. Second operand 4 states. [2018-09-19 16:21:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:21:58,858 INFO L93 Difference]: Finished difference Result 758 states and 850 transitions. [2018-09-19 16:21:58,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:21:58,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2018-09-19 16:21:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:21:58,862 INFO L225 Difference]: With dead ends: 758 [2018-09-19 16:21:58,863 INFO L226 Difference]: Without dead ends: 740 [2018-09-19 16:21:58,863 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 16:21:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-09-19 16:21:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2018-09-19 16:21:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-09-19 16:21:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 830 transitions. [2018-09-19 16:21:58,890 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 830 transitions. Word has length 283 [2018-09-19 16:21:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:21:58,890 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 830 transitions. [2018-09-19 16:21:58,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:21:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 830 transitions. [2018-09-19 16:21:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-09-19 16:21:58,893 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:21:58,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:58,894 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:21:58,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1428179604, now seen corresponding path program 1 times [2018-09-19 16:21:58,896 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:21:58,896 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:21:58,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:21:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:22:00,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:22:00,340 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-19 16:22:00,423 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:22:00,469 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:22:00,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:22:00,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:22:00,685 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:22:00,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2018-09-19 16:22:01,493 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 46 treesize of output 34 [2018-09-19 16:22:01,556 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 34 treesize of output 22 [2018-09-19 16:22:01,557 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:22:01,733 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:22:01,833 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:22:01,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:22 [2018-09-19 16:22:02,372 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:22:04,740 WARN L797 $PredicateComparison]: unable to prove that (exists ((__kernel_sinf_~y (_ FloatingPoint 8 24)) (__kernel_sinf_~v~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~z~2 (_ FloatingPoint 8 24)) (__kernel_sinf_~r~1 (_ FloatingPoint 8 24))) (= (fp.sub RNE |c___kernel_sinf_#in~x| (fp.sub RNE (fp.sub RNE (fp.mul RNE __kernel_sinf_~z~2 (fp.sub RNE (fp.mul RNE c_~half_ksin~0 __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 __kernel_sinf_~r~1))) __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 c_~S1_ksin~0))) |c___kernel_sinf_#res|)) is different from false [2018-09-19 16:22:06,771 WARN L819 $PredicateComparison]: unable to prove that (exists ((__kernel_sinf_~y (_ FloatingPoint 8 24)) (__kernel_sinf_~v~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~z~2 (_ FloatingPoint 8 24)) (__kernel_sinf_~r~1 (_ FloatingPoint 8 24))) (= (fp.sub RNE |c___kernel_sinf_#in~x| (fp.sub RNE (fp.sub RNE (fp.mul RNE __kernel_sinf_~z~2 (fp.sub RNE (fp.mul RNE c_~half_ksin~0 __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 __kernel_sinf_~r~1))) __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 c_~S1_ksin~0))) |c___kernel_sinf_#res|)) is different from true [2018-09-19 16:22:08,842 WARN L797 $PredicateComparison]: unable to prove that (exists ((__kernel_sinf_~y (_ FloatingPoint 8 24)) (__kernel_sinf_~v~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~z~2 (_ FloatingPoint 8 24)) (v_arrayElimCell_12 (_ BitVec 32)) (__kernel_sinf_~r~1 (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= (fp.sub RNE .cse0 (fp.sub RNE (fp.sub RNE (fp.mul RNE __kernel_sinf_~z~2 (fp.sub RNE (fp.mul RNE c_~half_ksin~0 __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 __kernel_sinf_~r~1))) __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 c_~S1_ksin~0))) |c_sin_float_#t~ret99|) (= .cse0 (fp.sub RNE |c_sin_float_#in~x| |c_sin_float_#in~x|))))) is different from false [2018-09-19 16:22:10,870 WARN L819 $PredicateComparison]: unable to prove that (exists ((__kernel_sinf_~y (_ FloatingPoint 8 24)) (__kernel_sinf_~v~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~z~2 (_ FloatingPoint 8 24)) (v_arrayElimCell_12 (_ BitVec 32)) (__kernel_sinf_~r~1 (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= (fp.sub RNE .cse0 (fp.sub RNE (fp.sub RNE (fp.mul RNE __kernel_sinf_~z~2 (fp.sub RNE (fp.mul RNE c_~half_ksin~0 __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 __kernel_sinf_~r~1))) __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 c_~S1_ksin~0))) |c_sin_float_#t~ret99|) (= .cse0 (fp.sub RNE |c_sin_float_#in~x| |c_sin_float_#in~x|))))) is different from true [2018-09-19 16:22:12,930 WARN L797 $PredicateComparison]: unable to prove that (exists ((__kernel_sinf_~y (_ FloatingPoint 8 24)) (__kernel_sinf_~v~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~z~2 (_ FloatingPoint 8 24)) (v_arrayElimCell_12 (_ BitVec 32)) (__kernel_sinf_~r~1 (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= (fp.sub RNE .cse0 (fp.sub RNE (fp.sub RNE (fp.mul RNE __kernel_sinf_~z~2 (fp.sub RNE (fp.mul RNE c_~half_ksin~0 __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 __kernel_sinf_~r~1))) __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 c_~S1_ksin~0))) |c_sin_float_#res|) (= .cse0 (fp.sub RNE |c_sin_float_#in~x| |c_sin_float_#in~x|))))) is different from false [2018-09-19 16:22:14,959 WARN L819 $PredicateComparison]: unable to prove that (exists ((__kernel_sinf_~y (_ FloatingPoint 8 24)) (__kernel_sinf_~v~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~z~2 (_ FloatingPoint 8 24)) (v_arrayElimCell_12 (_ BitVec 32)) (__kernel_sinf_~r~1 (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= (fp.sub RNE .cse0 (fp.sub RNE (fp.sub RNE (fp.mul RNE __kernel_sinf_~z~2 (fp.sub RNE (fp.mul RNE c_~half_ksin~0 __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 __kernel_sinf_~r~1))) __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 c_~S1_ksin~0))) |c_sin_float_#res|) (= .cse0 (fp.sub RNE |c_sin_float_#in~x| |c_sin_float_#in~x|))))) is different from true [2018-09-19 16:22:17,036 WARN L797 $PredicateComparison]: unable to prove that (exists ((__kernel_sinf_~y (_ FloatingPoint 8 24)) (~S1_ksin~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~v~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~z~2 (_ FloatingPoint 8 24)) (v_arrayElimCell_12 (_ BitVec 32)) (~half_ksin~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~r~1 (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= |c_main_#t~ret109| (fp.sub RNE .cse0 (fp.sub RNE (fp.sub RNE (fp.mul RNE __kernel_sinf_~z~2 (fp.sub RNE (fp.mul RNE ~half_ksin~0 __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 __kernel_sinf_~r~1))) __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 ~S1_ksin~0)))) (= .cse0 (let ((.cse1 (fp.div RNE (_ +zero 8 24) (_ +zero 8 24)))) (fp.sub RNE .cse1 .cse1)))))) is different from false [2018-09-19 16:22:19,104 WARN L797 $PredicateComparison]: unable to prove that (exists ((__kernel_sinf_~y (_ FloatingPoint 8 24)) (~S1_ksin~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~v~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~z~2 (_ FloatingPoint 8 24)) (v_arrayElimCell_12 (_ BitVec 32)) (~half_ksin~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~r~1 (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (= .cse0 (let ((.cse1 (fp.div RNE (_ +zero 8 24) (_ +zero 8 24)))) (fp.sub RNE .cse1 .cse1))) (= (fp.sub RNE .cse0 (fp.sub RNE (fp.sub RNE (fp.mul RNE __kernel_sinf_~z~2 (fp.sub RNE (fp.mul RNE ~half_ksin~0 __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 __kernel_sinf_~r~1))) __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 ~S1_ksin~0))) c_main_~res~0)))) is different from false [2018-09-19 16:22:25,748 WARN L797 $PredicateComparison]: unable to prove that (and (exists ((__kernel_sinf_~y (_ FloatingPoint 8 24)) (~S1_ksin~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~v~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~z~2 (_ FloatingPoint 8 24)) (v_arrayElimCell_12 (_ BitVec 32)) (~half_ksin~0 (_ FloatingPoint 8 24)) (__kernel_sinf_~r~1 (_ FloatingPoint 8 24))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (not (let ((.cse0 (fp.sub RNE .cse1 (fp.sub RNE (fp.sub RNE (fp.mul RNE __kernel_sinf_~z~2 (fp.sub RNE (fp.mul RNE ~half_ksin~0 __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 __kernel_sinf_~r~1))) __kernel_sinf_~y) (fp.mul RNE __kernel_sinf_~v~0 ~S1_ksin~0))))) (fp.eq .cse0 .cse0))) (= .cse1 (let ((.cse2 (fp.div RNE (_ +zero 8 24) (_ +zero 8 24)))) (fp.sub RNE .cse2 .cse2)))))) (= (_ bv1 32) |c_main_#t~ret110|)) is different from false [2018-09-19 16:22:25,824 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:22:25,824 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:22:25,844 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:22:25,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-19 16:22:25,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-19 16:22:25,845 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-19 16:22:25,845 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=76, Unknown=9, NotChecked=126, Total=240 [2018-09-19 16:22:25,846 INFO L87 Difference]: Start difference. First operand 740 states and 830 transitions. Second operand 16 states. [2018-09-19 16:22:37,896 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-19 16:22:41,889 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-19 16:22:42,455 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-19 16:22:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:22:57,044 INFO L93 Difference]: Finished difference Result 758 states and 848 transitions. [2018-09-19 16:22:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 16:22:57,049 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 283 [2018-09-19 16:22:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:22:57,053 INFO L225 Difference]: With dead ends: 758 [2018-09-19 16:22:57,053 INFO L226 Difference]: Without dead ends: 736 [2018-09-19 16:22:57,054 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=43, Invalid=128, Unknown=9, NotChecked=162, Total=342 [2018-09-19 16:22:57,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-09-19 16:22:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 726. [2018-09-19 16:22:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-09-19 16:22:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 813 transitions. [2018-09-19 16:22:57,077 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 813 transitions. Word has length 283 [2018-09-19 16:22:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:22:57,077 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 813 transitions. [2018-09-19 16:22:57,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-19 16:22:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 813 transitions. [2018-09-19 16:22:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-19 16:22:57,080 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:22:57,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:57,080 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:22:57,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1080095514, now seen corresponding path program 1 times [2018-09-19 16:22:57,081 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:22:57,082 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) [2018-09-19 16:22:57,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-19 16:22:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:22:57,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:22:57,592 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:22:57,592 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:22:57,607 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:22:57,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 16:22:57,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 16:22:57,608 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 16:22:57,608 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-19 16:22:57,609 INFO L87 Difference]: Start difference. First operand 726 states and 813 transitions. Second operand 5 states. [2018-09-19 16:22:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:22:57,801 INFO L93 Difference]: Finished difference Result 764 states and 852 transitions. [2018-09-19 16:22:57,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 16:22:57,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2018-09-19 16:22:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:22:57,807 INFO L225 Difference]: With dead ends: 764 [2018-09-19 16:22:57,808 INFO L226 Difference]: Without dead ends: 730 [2018-09-19 16:22:57,808 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-19 16:22:57,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-09-19 16:22:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2018-09-19 16:22:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-09-19 16:22:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 817 transitions. [2018-09-19 16:22:57,838 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 817 transitions. Word has length 284 [2018-09-19 16:22:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:22:57,839 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 817 transitions. [2018-09-19 16:22:57,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 16:22:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 817 transitions. [2018-09-19 16:22:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-19 16:22:57,845 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:22:57,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:57,845 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:22:57,846 INFO L82 PathProgramCache]: Analyzing trace with hash -607457992, now seen corresponding path program 1 times [2018-09-19 16:22:57,847 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:22:57,847 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:22:57,856 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:22:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:22:58,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:22:58,324 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:22:58,328 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:22:58,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:22:58,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:22:58,369 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:22:58,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:22:58,396 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:22:58,401 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:22:58,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:22:58,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:22:58,409 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:22:58,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:22:58,774 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:22:58,775 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:22:58,790 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:22:58,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 16:22:58,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:22:58,791 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:22:58,791 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-19 16:22:58,791 INFO L87 Difference]: Start difference. First operand 730 states and 817 transitions. Second operand 11 states. [2018-09-19 16:23:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:23:04,930 INFO L93 Difference]: Finished difference Result 771 states and 864 transitions. [2018-09-19 16:23:04,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 16:23:04,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 284 [2018-09-19 16:23:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:23:04,936 INFO L225 Difference]: With dead ends: 771 [2018-09-19 16:23:04,936 INFO L226 Difference]: Without dead ends: 701 [2018-09-19 16:23:04,938 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-09-19 16:23:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-09-19 16:23:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2018-09-19 16:23:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-09-19 16:23:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 784 transitions. [2018-09-19 16:23:04,958 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 784 transitions. Word has length 284 [2018-09-19 16:23:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:23:04,959 INFO L480 AbstractCegarLoop]: Abstraction has 701 states and 784 transitions. [2018-09-19 16:23:04,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:23:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 784 transitions. [2018-09-19 16:23:04,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-19 16:23:04,961 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:23:04,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:04,962 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:23:04,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1537897066, now seen corresponding path program 1 times [2018-09-19 16:23:04,964 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:23:04,964 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:23:04,969 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:23:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:23:05,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:23:05,664 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:23:05,668 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:23:05,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:23:05,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:23:05,686 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:23:05,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:23:05,711 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:23:05,715 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:23:05,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:23:05,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:23:05,722 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:23:05,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:23:06,121 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:23:06,121 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:23:06,139 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:23:06,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 16:23:06,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 16:23:06,140 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 16:23:06,140 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:23:06,141 INFO L87 Difference]: Start difference. First operand 701 states and 784 transitions. Second operand 12 states. [2018-09-19 16:23:07,936 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-09-19 16:23:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:23:10,034 INFO L93 Difference]: Finished difference Result 742 states and 831 transitions. [2018-09-19 16:23:10,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 16:23:10,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 310 [2018-09-19 16:23:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:23:10,039 INFO L225 Difference]: With dead ends: 742 [2018-09-19 16:23:10,039 INFO L226 Difference]: Without dead ends: 628 [2018-09-19 16:23:10,040 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:23:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-09-19 16:23:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2018-09-19 16:23:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-09-19 16:23:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 706 transitions. [2018-09-19 16:23:10,058 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 706 transitions. Word has length 310 [2018-09-19 16:23:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:23:10,059 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 706 transitions. [2018-09-19 16:23:10,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 16:23:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 706 transitions. [2018-09-19 16:23:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-09-19 16:23:10,063 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:23:10,063 INFO L376 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:10,064 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:23:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash 850499343, now seen corresponding path program 1 times [2018-09-19 16:23:10,065 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:23:10,065 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) [2018-09-19 16:23:10,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-19 16:23:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:23:10,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:23:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-19 16:23:10,722 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:23:10,744 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:23:10,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 16:23:10,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 16:23:10,745 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 16:23:10,745 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:23:10,745 INFO L87 Difference]: Start difference. First operand 628 states and 706 transitions. Second operand 3 states. [2018-09-19 16:23:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:23:11,667 INFO L93 Difference]: Finished difference Result 1003 states and 1159 transitions. [2018-09-19 16:23:11,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 16:23:11,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 384 [2018-09-19 16:23:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:23:11,676 INFO L225 Difference]: With dead ends: 1003 [2018-09-19 16:23:11,676 INFO L226 Difference]: Without dead ends: 634 [2018-09-19 16:23:11,678 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:23:11,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-09-19 16:23:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 630. [2018-09-19 16:23:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-09-19 16:23:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 708 transitions. [2018-09-19 16:23:11,701 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 708 transitions. Word has length 384 [2018-09-19 16:23:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:23:11,702 INFO L480 AbstractCegarLoop]: Abstraction has 630 states and 708 transitions. [2018-09-19 16:23:11,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 16:23:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 708 transitions. [2018-09-19 16:23:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-09-19 16:23:11,707 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:23:11,707 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:11,707 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:23:11,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1188967097, now seen corresponding path program 1 times [2018-09-19 16:23:11,709 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:23:11,709 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) [2018-09-19 16:23:11,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-19 16:23:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:23:12,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:23:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-19 16:23:12,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:23:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-19 16:23:12,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:23:12,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-19 16:23:12,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 16:23:12,926 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 16:23:12,926 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-19 16:23:12,926 INFO L87 Difference]: Start difference. First operand 630 states and 708 transitions. Second operand 6 states. [2018-09-19 16:23:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:23:13,667 INFO L93 Difference]: Finished difference Result 1009 states and 1165 transitions. [2018-09-19 16:23:13,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 16:23:13,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 390 [2018-09-19 16:23:13,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:23:13,672 INFO L225 Difference]: With dead ends: 1009 [2018-09-19 16:23:13,673 INFO L226 Difference]: Without dead ends: 640 [2018-09-19 16:23:13,674 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 775 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-19 16:23:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-09-19 16:23:13,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2018-09-19 16:23:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-09-19 16:23:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 714 transitions. [2018-09-19 16:23:13,697 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 714 transitions. Word has length 390 [2018-09-19 16:23:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:23:13,697 INFO L480 AbstractCegarLoop]: Abstraction has 636 states and 714 transitions. [2018-09-19 16:23:13,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 16:23:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 714 transitions. [2018-09-19 16:23:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-09-19 16:23:13,702 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:23:13,702 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:13,702 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:23:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash -831620737, now seen corresponding path program 2 times [2018-09-19 16:23:13,704 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:23:13,704 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:23:13,711 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-19 16:23:14,084 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-09-19 16:23:14,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 16:23:14,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:23:14,132 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-09-19 16:23:14,159 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:23:14,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2018-09-19 16:23:14,198 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:23:14,199 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:23:14,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-09-19 16:23:14,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-19 16:23:14,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:23:14,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:23:14,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:23:14,243 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:12, output treesize:16 [2018-09-19 16:23:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-19 16:23:15,181 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:23:15,195 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:23:15,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-19 16:23:15,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-19 16:23:15,196 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-19 16:23:15,196 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-09-19 16:23:15,196 INFO L87 Difference]: Start difference. First operand 636 states and 714 transitions. Second operand 7 states. [2018-09-19 16:23:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:23:40,797 INFO L93 Difference]: Finished difference Result 1165 states and 1391 transitions. [2018-09-19 16:23:40,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 16:23:40,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 396 [2018-09-19 16:23:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:23:40,805 INFO L225 Difference]: With dead ends: 1165 [2018-09-19 16:23:40,806 INFO L226 Difference]: Without dead ends: 1064 [2018-09-19 16:23:40,807 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 386 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:23:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2018-09-19 16:23:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 945. [2018-09-19 16:23:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-09-19 16:23:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1116 transitions. [2018-09-19 16:23:40,853 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1116 transitions. Word has length 396 [2018-09-19 16:23:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:23:40,853 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 1116 transitions. [2018-09-19 16:23:40,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-19 16:23:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1116 transitions. [2018-09-19 16:23:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-09-19 16:23:40,860 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:23:40,860 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:40,861 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:23:40,861 INFO L82 PathProgramCache]: Analyzing trace with hash 186444949, now seen corresponding path program 1 times [2018-09-19 16:23:40,862 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:23:40,862 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) [2018-09-19 16:23:40,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-09-19 16:23:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:23:41,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:23:41,691 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-09-19 16:23:41,717 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:23:41,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2018-09-19 16:23:41,723 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:23:41,724 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:23:41,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-09-19 16:23:41,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-19 16:23:41,739 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:23:41,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:23:41,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:23:41,757 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:12, output treesize:16 [2018-09-19 16:23:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-19 16:23:42,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:23:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-19 16:23:44,441 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:23:44,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-09-19 16:23:44,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-19 16:23:44,442 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-19 16:23:44,443 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-09-19 16:23:44,443 INFO L87 Difference]: Start difference. First operand 945 states and 1116 transitions. Second operand 15 states. [2018-09-19 16:23:53,892 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-09-19 16:24:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:24:21,449 INFO L93 Difference]: Finished difference Result 1273 states and 1540 transitions. [2018-09-19 16:24:21,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:24:21,450 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 399 [2018-09-19 16:24:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:24:21,458 INFO L225 Difference]: With dead ends: 1273 [2018-09-19 16:24:21,458 INFO L226 Difference]: Without dead ends: 1172 [2018-09-19 16:24:21,460 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 779 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:24:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-09-19 16:24:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 772. [2018-09-19 16:24:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-09-19 16:24:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 902 transitions. [2018-09-19 16:24:21,507 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 902 transitions. Word has length 399 [2018-09-19 16:24:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:24:21,508 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 902 transitions. [2018-09-19 16:24:21,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-19 16:24:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 902 transitions. [2018-09-19 16:24:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-09-19 16:24:21,514 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:24:21,515 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:21,515 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:24:21,515 INFO L82 PathProgramCache]: Analyzing trace with hash 969378303, now seen corresponding path program 2 times [2018-09-19 16:24:21,516 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:24:21,517 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) [2018-09-19 16:24:21,526 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-19 16:24:21,864 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-09-19 16:24:21,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 16:24:21,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:24:21,926 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-09-19 16:24:21,964 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:24:21,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2018-09-19 16:24:21,968 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:24:21,969 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:24:21,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-09-19 16:24:21,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-19 16:24:21,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:24:21,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:24:21,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:24:22,000 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:12, output treesize:16 [2018-09-19 16:24:22,192 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-19 16:24:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-19 16:24:23,071 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:24:23,085 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:24:23,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-19 16:24:23,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-19 16:24:23,087 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-19 16:24:23,087 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-19 16:24:23,087 INFO L87 Difference]: Start difference. First operand 772 states and 902 transitions. Second operand 7 states. Received shutdown request... [2018-09-19 16:24:38,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 16:24:38,817 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-19 16:24:38,822 WARN L206 ceAbstractionStarter]: Timeout [2018-09-19 16:24:38,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:24:38 BoogieIcfgContainer [2018-09-19 16:24:38,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:24:38,823 INFO L168 Benchmark]: Toolchain (without parser) took 274832.98 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 926.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -500.0 MB). Peak memory consumption was 426.9 MB. Max. memory is 7.1 GB. [2018-09-19 16:24:38,824 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:24:38,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.36 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 16:24:38,825 INFO L168 Benchmark]: Boogie Preprocessor took 277.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2018-09-19 16:24:38,826 INFO L168 Benchmark]: RCFGBuilder took 35563.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 186.1 MB). Peak memory consumption was 186.1 MB. Max. memory is 7.1 GB. [2018-09-19 16:24:38,826 INFO L168 Benchmark]: TraceAbstraction took 238136.47 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 173.5 MB). Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 109.6 MB). Peak memory consumption was 283.1 MB. Max. memory is 7.1 GB. [2018-09-19 16:24:38,829 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 848.36 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 277.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 35563.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 186.1 MB). Peak memory consumption was 186.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238136.47 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 173.5 MB). Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 109.6 MB). Peak memory consumption was 283.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 617]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 617). Cancelled while BasicCegarLoop was constructing difference of abstraction (772states) and FLOYD_HOARE automaton (currently 8 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (973 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 749 locations, 1 error locations. TIMEOUT Result, 238.0s OverallTime, 16 OverallIterations, 5 TraceHistogramMax, 188.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12270 SDtfs, 5387 SDslu, 64611 SDs, 0 SdLazy, 5551 SolverSat, 260 SolverUnsat, 30 SolverUnknown, 0 SolverNotchecked, 166.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5779 GetRequests, 5595 SyntacticMatches, 15 SemanticMatches, 169 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 37.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=945occurred in iteration=14, 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.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 538 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 40.8s InterpolantComputationTime, 4942 NumberOfCodeBlocks, 4824 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 5713 ConstructedInterpolants, 142 QuantifiedInterpolants, 12530735 SizeOfPredicates, 93 NumberOfNonLiveVariables, 8411 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 175/185 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown