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/double_req_bl_0871_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:09:10,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:09:10,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:09:10,042 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:09:10,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:09:10,043 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:09:10,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:09:10,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:09:10,049 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:09:10,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:09:10,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:09:10,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:09:10,052 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:09:10,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:09:10,057 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:09:10,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:09:10,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:09:10,067 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:09:10,072 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:09:10,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:09:10,079 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:09:10,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:09:10,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:09:10,083 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:09:10,083 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:09:10,084 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:09:10,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:09:10,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:09:10,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:09:10,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:09:10,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:09:10,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:09:10,089 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:09:10,090 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:09:10,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:09:10,091 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:09:10,092 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:09:10,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:09:10,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:09:10,110 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:09:10,110 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:09:10,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:09:10,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:09:10,111 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:09:10,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:09:10,112 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:09:10,112 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:09:10,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:09:10,112 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:09:10,112 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:09:10,113 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:09:10,113 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:09:10,113 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:09:10,113 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:09:10,113 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:09:10,114 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:09:10,114 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:09:10,114 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:09:10,114 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:09:10,114 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:09:10,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:09:10,115 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:09:10,115 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:09:10,115 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:09:10,115 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:09:10,115 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:09:10,116 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:09:10,116 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:09:10,116 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:09:10,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:09:10,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:09:10,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:09:10,191 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:09:10,191 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:09:10,192 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0871_true-unreach-call.c [2018-09-19 16:09:10,555 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b32e02e/592ad03b9c464b219698cb366bd8eb4a/FLAGf9c848061 [2018-09-19 16:09:10,754 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:09:10,755 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0871_true-unreach-call.c [2018-09-19 16:09:10,767 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b32e02e/592ad03b9c464b219698cb366bd8eb4a/FLAGf9c848061 [2018-09-19 16:09:10,783 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b32e02e/592ad03b9c464b219698cb366bd8eb4a [2018-09-19 16:09:10,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:09:10,798 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:09:10,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:09:10,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:09:10,806 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:09:10,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:09:10" (1/1) ... [2018-09-19 16:09:10,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4913b154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:09:10, skipping insertion in model container [2018-09-19 16:09:10,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:09:10" (1/1) ... [2018-09-19 16:09:10,823 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:09:11,242 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:09:11,278 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:09:11,400 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:09:11,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:09:11 WrapperNode [2018-09-19 16:09:11,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:09:11,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:09:11,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:09:11,464 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:09:11,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:09:11" (1/1) ... [2018-09-19 16:09:11,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:09:11" (1/1) ... [2018-09-19 16:09:11,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:09:11" (1/1) ... [2018-09-19 16:09:11,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:09:11" (1/1) ... [2018-09-19 16:09:11,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:09:11" (1/1) ... [2018-09-19 16:09:11,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:09:11" (1/1) ... [2018-09-19 16:09:11,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:09:11" (1/1) ... [2018-09-19 16:09:11,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:09:11,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:09:11,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:09:11,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:09:11,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:09:11" (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:09:11,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:09:11,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:09:11,771 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_double [2018-09-19 16:09:11,772 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_double [2018-09-19 16:09:11,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-19 16:09:11,772 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-09-19 16:09:11,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_pow [2018-09-19 16:09:11,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:09:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:09:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 16:09:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_double [2018-09-19 16:09:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:09:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:09:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:09:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:09:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:09:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:09:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_double [2018-09-19 16:09:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-19 16:09:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-09-19 16:09:11,775 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_pow [2018-09-19 16:09:11,775 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:09:11,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:09:11,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:09:11,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:09:11,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:09:12,243 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:12,776 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:12,819 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:13,343 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:13,372 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:14,198 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:15,436 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:15,599 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:15,622 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:15,660 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:15,675 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:15,715 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:15,864 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:18,348 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:18,400 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:21,163 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:23,362 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:25,620 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:26,567 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:28,794 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:28,839 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:28,897 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:28,969 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:28,981 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:30,421 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:36,830 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:36,839 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:36,855 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:36,931 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:37,247 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:40,287 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:40,326 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:40,618 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:54,324 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:55,038 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:55,047 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:58,074 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:58,129 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:58,208 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:58,400 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:58,436 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:09:58,540 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:10:00,326 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:10:00,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:10:00 BoogieIcfgContainer [2018-09-19 16:10:00,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:10:00,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:10:00,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:10:00,332 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:10:00,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:09:10" (1/3) ... [2018-09-19 16:10:00,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35261dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:10:00, skipping insertion in model container [2018-09-19 16:10:00,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:09:11" (2/3) ... [2018-09-19 16:10:00,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35261dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:10:00, skipping insertion in model container [2018-09-19 16:10:00,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:10:00" (3/3) ... [2018-09-19 16:10:00,336 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0871_true-unreach-call.c [2018-09-19 16:10:00,347 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:10:00,356 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:10:00,419 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:10:00,422 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:10:00,422 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:10:00,422 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:10:00,422 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:10:00,422 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:10:00,423 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:10:00,423 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:10:00,423 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:10:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states. [2018-09-19 16:10:00,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-19 16:10:00,470 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:10:00,471 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:10:00,473 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:10:00,479 INFO L82 PathProgramCache]: Analyzing trace with hash 425131288, now seen corresponding path program 1 times [2018-09-19 16:10:00,485 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:10:00,486 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:10:00,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:10:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:10:00,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:10:00,740 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:10:00,741 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:10:00,756 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:10:00,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:10:00,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:10:00,777 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:10:00,778 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:10:00,780 INFO L87 Difference]: Start difference. First operand 494 states. Second operand 2 states. [2018-09-19 16:10:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:10:00,873 INFO L93 Difference]: Finished difference Result 980 states and 1264 transitions. [2018-09-19 16:10:00,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:10:00,876 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-09-19 16:10:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:10:00,900 INFO L225 Difference]: With dead ends: 980 [2018-09-19 16:10:00,900 INFO L226 Difference]: Without dead ends: 490 [2018-09-19 16:10:00,908 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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:10:00,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-09-19 16:10:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2018-09-19 16:10:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-09-19 16:10:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 570 transitions. [2018-09-19 16:10:00,991 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 570 transitions. Word has length 17 [2018-09-19 16:10:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:10:00,992 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 570 transitions. [2018-09-19 16:10:00,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:10:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 570 transitions. [2018-09-19 16:10:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-19 16:10:00,994 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:10:00,995 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] [2018-09-19 16:10:00,995 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:10:00,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1962425380, now seen corresponding path program 1 times [2018-09-19 16:10:00,997 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:10:00,997 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:10:01,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:10:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:10:01,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:10:01,401 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:10:01,402 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:10:01,417 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:10:01,418 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 16:10:01,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 16:10:01,420 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 16:10:01,420 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-19 16:10:01,421 INFO L87 Difference]: Start difference. First operand 490 states and 570 transitions. Second operand 6 states. [2018-09-19 16:10:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:10:28,816 INFO L93 Difference]: Finished difference Result 565 states and 653 transitions. [2018-09-19 16:10:28,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 16:10:28,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-09-19 16:10:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:10:28,826 INFO L225 Difference]: With dead ends: 565 [2018-09-19 16:10:28,826 INFO L226 Difference]: Without dead ends: 559 [2018-09-19 16:10:28,827 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:10:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-09-19 16:10:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 490. [2018-09-19 16:10:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-09-19 16:10:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 567 transitions. [2018-09-19 16:10:28,864 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 567 transitions. Word has length 43 [2018-09-19 16:10:28,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:10:28,865 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 567 transitions. [2018-09-19 16:10:28,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 16:10:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 567 transitions. [2018-09-19 16:10:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-19 16:10:28,867 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:10:28,867 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:10:28,867 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:10:28,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1580647785, now seen corresponding path program 1 times [2018-09-19 16:10:28,869 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:10:28,869 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:10:28,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:10:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:10:29,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:10:29,250 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:10:29,252 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:10:29,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-19 16:10:29,300 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:10:29,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:10:29,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:10:29,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:10:29,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:10:29,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:10:29,629 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:10:29,638 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:10:29,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 54 treesize of output 56 [2018-09-19 16:10:29,693 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:10:29,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-19 16:10:29,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:10:29,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:10:29,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:10:29,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-19 16:10:29,912 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 35 treesize of output 27 [2018-09-19 16:10:29,921 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:10:29,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-19 16:10:29,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:10:29,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:10:29,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:10:29,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-19 16:10:30,454 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:10:30,454 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:10:30,470 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:10:30,470 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 16:10:30,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:10:30,471 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:10:30,471 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-19 16:10:30,471 INFO L87 Difference]: Start difference. First operand 490 states and 567 transitions. Second operand 11 states. [2018-09-19 16:10:31,069 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-19 16:10:31,868 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 16:10:32,956 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-19 16:10:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:10:57,331 INFO L93 Difference]: Finished difference Result 595 states and 682 transitions. [2018-09-19 16:10:57,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 16:10:57,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-09-19 16:10:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:10:57,337 INFO L225 Difference]: With dead ends: 595 [2018-09-19 16:10:57,337 INFO L226 Difference]: Without dead ends: 385 [2018-09-19 16:10:57,339 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-09-19 16:10:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-09-19 16:10:57,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2018-09-19 16:10:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-19 16:10:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 442 transitions. [2018-09-19 16:10:57,358 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 442 transitions. Word has length 45 [2018-09-19 16:10:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:10:57,359 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 442 transitions. [2018-09-19 16:10:57,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:10:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 442 transitions. [2018-09-19 16:10:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-19 16:10:57,360 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:10:57,361 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] [2018-09-19 16:10:57,361 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:10:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1131981993, now seen corresponding path program 1 times [2018-09-19 16:10:57,362 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:10:57,362 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:10:57,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:10:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:10:58,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:11:00,951 WARN L797 $PredicateComparison]: unable to prove that (and (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (= |c___ieee754_pow_#res| (fp.div RNE c_~one_pow~0 |c___ieee754_pow_#in~x|))) is different from false [2018-09-19 16:11:01,005 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:11:01,006 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:11:01,035 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:11:01,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:11:01,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:11:01,036 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:11:01,036 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-19 16:11:01,036 INFO L87 Difference]: Start difference. First operand 383 states and 442 transitions. Second operand 8 states. [2018-09-19 16:11:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:11:17,317 INFO L93 Difference]: Finished difference Result 391 states and 449 transitions. [2018-09-19 16:11:18,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 16:11:18,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-09-19 16:11:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:11:18,244 INFO L225 Difference]: With dead ends: 391 [2018-09-19 16:11:18,245 INFO L226 Difference]: Without dead ends: 385 [2018-09-19 16:11:18,245 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-19 16:11:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-09-19 16:11:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2018-09-19 16:11:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-19 16:11:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 441 transitions. [2018-09-19 16:11:18,262 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 441 transitions. Word has length 49 [2018-09-19 16:11:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:11:18,263 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 441 transitions. [2018-09-19 16:11:18,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:11:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 441 transitions. [2018-09-19 16:11:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-19 16:11:18,265 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:11:18,265 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] [2018-09-19 16:11:18,266 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:11:18,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1103352842, now seen corresponding path program 1 times [2018-09-19 16:11:18,266 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:11:18,267 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) [2018-09-19 16:11:18,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 16:11:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:11:18,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:11:18,679 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:11:18,679 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:11:18,692 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:11:18,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-19 16:11:18,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-19 16:11:18,693 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-19 16:11:18,693 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-19 16:11:18,693 INFO L87 Difference]: Start difference. First operand 383 states and 441 transitions. Second operand 7 states. [2018-09-19 16:11:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:11:30,273 INFO L93 Difference]: Finished difference Result 389 states and 446 transitions. [2018-09-19 16:11:30,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 16:11:30,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-09-19 16:11:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:11:30,278 INFO L225 Difference]: With dead ends: 389 [2018-09-19 16:11:30,279 INFO L226 Difference]: Without dead ends: 382 [2018-09-19 16:11:30,279 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:11:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-19 16:11:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-19 16:11:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-19 16:11:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 439 transitions. [2018-09-19 16:11:30,298 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 439 transitions. Word has length 49 [2018-09-19 16:11:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:11:30,299 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 439 transitions. [2018-09-19 16:11:30,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-19 16:11:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 439 transitions. [2018-09-19 16:11:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-19 16:11:30,301 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:11:30,301 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] [2018-09-19 16:11:30,301 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:11:30,301 INFO L82 PathProgramCache]: Analyzing trace with hash -846285129, now seen corresponding path program 1 times [2018-09-19 16:11:30,302 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:11:30,302 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) [2018-09-19 16:11:30,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 16:11:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:11:30,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:11:36,774 WARN L178 SmtUtils]: Spent 2.38 s on a formula simplification that was a NOOP. DAG size: 5 [2018-09-19 16:11:39,251 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:11:39,252 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:11:39,265 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:11:39,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-19 16:11:39,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-19 16:11:39,267 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-19 16:11:39,267 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-19 16:11:39,267 INFO L87 Difference]: Start difference. First operand 382 states and 439 transitions. Second operand 7 states. [2018-09-19 16:11:46,342 WARN L178 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 8 [2018-09-19 16:12:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:12:10,001 INFO L93 Difference]: Finished difference Result 388 states and 444 transitions. [2018-09-19 16:12:10,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 16:12:10,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-09-19 16:12:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:12:10,042 INFO L225 Difference]: With dead ends: 388 [2018-09-19 16:12:10,043 INFO L226 Difference]: Without dead ends: 382 [2018-09-19 16:12:10,043 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:12:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-19 16:12:10,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-19 16:12:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-19 16:12:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 438 transitions. [2018-09-19 16:12:10,059 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 438 transitions. Word has length 49 [2018-09-19 16:12:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:12:10,060 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 438 transitions. [2018-09-19 16:12:10,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-19 16:12:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 438 transitions. [2018-09-19 16:12:10,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-19 16:12:10,062 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:12:10,062 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] [2018-09-19 16:12:10,062 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:12:10,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1666872400, now seen corresponding path program 1 times [2018-09-19 16:12:10,063 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:12:10,063 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:12:10,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:12:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:12:10,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:12:10,847 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 14 treesize of output 11 [2018-09-19 16:12:10,854 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 11 treesize of output 10 [2018-09-19 16:12:10,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:12:10,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:12:10,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:12:10,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:12:10,955 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 20 treesize of output 16 [2018-09-19 16:12:10,960 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 16 treesize of output 4 [2018-09-19 16:12:10,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:12:10,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:12:10,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:12:10,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:12:11,255 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:12:11,256 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:12:11,276 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:12:11,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:12:11,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:12:11,277 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:12:11,277 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:12:11,278 INFO L87 Difference]: Start difference. First operand 382 states and 438 transitions. Second operand 10 states. [2018-09-19 16:12:11,831 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-19 16:12:12,027 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-19 16:12:12,378 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:12:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:12:22,615 INFO L93 Difference]: Finished difference Result 400 states and 457 transitions. [2018-09-19 16:12:22,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:12:22,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-09-19 16:12:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:12:22,621 INFO L225 Difference]: With dead ends: 400 [2018-09-19 16:12:22,621 INFO L226 Difference]: Without dead ends: 391 [2018-09-19 16:12:22,622 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:12:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-09-19 16:12:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 382. [2018-09-19 16:12:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-19 16:12:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 437 transitions. [2018-09-19 16:12:22,640 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 437 transitions. Word has length 71 [2018-09-19 16:12:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:12:22,640 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 437 transitions. [2018-09-19 16:12:22,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:12:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 437 transitions. [2018-09-19 16:12:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-19 16:12:22,648 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:12:22,649 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] [2018-09-19 16:12:22,649 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:12:22,649 INFO L82 PathProgramCache]: Analyzing trace with hash -83148140, now seen corresponding path program 1 times [2018-09-19 16:12:22,650 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:12:22,650 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) [2018-09-19 16:12:22,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-19 16:12:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:12:22,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:12:22,980 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 14 treesize of output 11 [2018-09-19 16:12:22,988 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 11 treesize of output 10 [2018-09-19 16:12:22,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:12:22,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:12:23,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:12:23,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:12:23,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:12:23,075 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 16 treesize of output 4 [2018-09-19 16:12:23,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:12:23,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:12:23,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:12:23,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:12:23,412 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:12:23,412 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:12:23,427 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:12:23,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:12:23,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:12:23,428 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:12:23,428 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:12:23,428 INFO L87 Difference]: Start difference. First operand 382 states and 437 transitions. Second operand 10 states. [2018-09-19 16:12:25,339 WARN L178 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-19 16:12:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:12:33,150 INFO L93 Difference]: Finished difference Result 451 states and 524 transitions. [2018-09-19 16:12:33,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 16:12:33,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-09-19 16:12:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:12:33,158 INFO L225 Difference]: With dead ends: 451 [2018-09-19 16:12:33,158 INFO L226 Difference]: Without dead ends: 384 [2018-09-19 16:12:33,159 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:12:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-09-19 16:12:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2018-09-19 16:12:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-19 16:12:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 431 transitions. [2018-09-19 16:12:33,173 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 431 transitions. Word has length 73 [2018-09-19 16:12:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:12:33,173 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 431 transitions. [2018-09-19 16:12:33,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:12:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 431 transitions. [2018-09-19 16:12:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-19 16:12:33,174 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:12:33,175 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] [2018-09-19 16:12:33,175 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:12:33,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2105643434, now seen corresponding path program 1 times [2018-09-19 16:12:33,176 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:12:33,177 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-19 16:12:33,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:12:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:12:35,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:12:35,453 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 14 treesize of output 11 [2018-09-19 16:12:35,460 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 11 treesize of output 10 [2018-09-19 16:12:35,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:12:35,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:12:35,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:12:35,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-09-19 16:12:35,754 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 20 treesize of output 16 [2018-09-19 16:12:35,783 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 16 treesize of output 4 [2018-09-19 16:12:35,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:12:35,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:12:35,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:12:35,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:22 [2018-09-19 16:12:36,084 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 14 treesize of output 11 [2018-09-19 16:12:36,091 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 11 treesize of output 10 [2018-09-19 16:12:36,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:12:36,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:12:36,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:12:36,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-09-19 16:12:36,461 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 20 treesize of output 16 [2018-09-19 16:12:36,505 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 16 treesize of output 4 [2018-09-19 16:12:36,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:12:36,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:12:36,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:12:36,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:22 [2018-09-19 16:12:37,112 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:12:37,112 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:12:37,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-19 16:12:37,125 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:12:37,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:12:37,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:12:37,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:12:37,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:12:37,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:46 [2018-09-19 16:12:37,426 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 35 treesize of output 28 [2018-09-19 16:12:37,438 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:12:37,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-19 16:12:37,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:12:37,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:12:37,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:12:37,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:44 [2018-09-19 16:12:37,697 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 66 treesize of output 50 [2018-09-19 16:12:37,707 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:12:37,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2018-09-19 16:12:37,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:12:37,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:12:37,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:12:37,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:89, output treesize:51 [2018-09-19 16:12:41,472 WARN L797 $PredicateComparison]: unable to prove that (and (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (exists ((|v_q#valueAsBitvector_49| (_ BitVec 64)) (|v_q#valueAsBitvector_48| (_ BitVec 64))) (and (= (fp.div RNE c_~one_pow~0 (let ((.cse0 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_48|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_49|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) c___ieee754_pow_~z~1) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_48|) ((_ extract 62 52) |v_q#valueAsBitvector_48|) ((_ extract 51 0) |v_q#valueAsBitvector_48|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_49|) ((_ extract 62 52) |v_q#valueAsBitvector_49|) ((_ extract 51 0) |v_q#valueAsBitvector_49|)) |c___ieee754_pow_#in~x|)))) is different from false [2018-09-19 16:13:51,523 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2018-09-19 16:13:51,525 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:149) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:353) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:298) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2018-09-19 16:13:51,530 INFO L168 Benchmark]: Toolchain (without parser) took 280734.40 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 892.9 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -556.4 MB). Peak memory consumption was 336.5 MB. Max. memory is 7.1 GB. [2018-09-19 16:13:51,531 INFO L168 Benchmark]: CDTParser took 0.25 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:13:51,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 16:13:51,532 INFO L168 Benchmark]: Boogie Preprocessor took 116.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:13:51,532 INFO L168 Benchmark]: RCFGBuilder took 48746.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -719.1 MB). Peak memory consumption was 74.1 MB. Max. memory is 7.1 GB. [2018-09-19 16:13:51,533 INFO L168 Benchmark]: TraceAbstraction took 231200.35 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 115.3 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 131.0 MB). Peak memory consumption was 246.4 MB. Max. memory is 7.1 GB. [2018-09-19 16:13:51,537 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.25 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 664.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 48746.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -719.1 MB). Peak memory consumption was 74.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 231200.35 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 115.3 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 131.0 MB). Peak memory consumption was 246.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...