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_0490b_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:58:33,144 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:58:33,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:58:33,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:58:33,166 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:58:33,167 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:58:33,168 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:58:33,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:58:33,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:58:33,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:58:33,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:58:33,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:58:33,175 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:58:33,176 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:58:33,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:58:33,178 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:58:33,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:58:33,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:58:33,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:58:33,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:58:33,196 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:58:33,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:58:33,202 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:58:33,202 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:58:33,202 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:58:33,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:58:33,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:58:33,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:58:33,210 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:58:33,212 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:58:33,212 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:58:33,214 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:58:33,214 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:58:33,215 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:58:33,216 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:58:33,216 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:58:33,217 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 15:58:33,236 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:58:33,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:58:33,237 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:58:33,237 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:58:33,238 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:58:33,238 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:58:33,238 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:58:33,239 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:58:33,239 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:58:33,239 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:58:33,239 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:58:33,239 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:58:33,240 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:58:33,240 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:58:33,240 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:58:33,240 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:58:33,240 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:58:33,244 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:58:33,244 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:58:33,244 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:58:33,244 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:58:33,244 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:58:33,245 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:58:33,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:58:33,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:58:33,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:58:33,245 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:58:33,246 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:58:33,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:58:33,246 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:58:33,246 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:58:33,246 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:58:33,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:58:33,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:58:33,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:58:33,336 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:58:33,337 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:58:33,337 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0490b_true-unreach-call.c [2018-09-19 15:58:33,686 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad733df81/07a550b10b604552ab7055afc592b464/FLAG25b3055e3 [2018-09-19 15:58:33,915 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:58:33,916 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0490b_true-unreach-call.c [2018-09-19 15:58:33,926 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad733df81/07a550b10b604552ab7055afc592b464/FLAG25b3055e3 [2018-09-19 15:58:33,942 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad733df81/07a550b10b604552ab7055afc592b464 [2018-09-19 15:58:33,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:58:33,957 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:58:33,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:58:33,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:58:33,965 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:58:33,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:58:33" (1/1) ... [2018-09-19 15:58:33,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b4850f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:58:33, skipping insertion in model container [2018-09-19 15:58:33,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:58:33" (1/1) ... [2018-09-19 15:58:33,981 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:58:34,258 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:58:34,282 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:58:34,414 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:58:34,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:58:34 WrapperNode [2018-09-19 15:58:34,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:58:34,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:58:34,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:58:34,472 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:58:34,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:58:34" (1/1) ... [2018-09-19 15:58:34,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:58:34" (1/1) ... [2018-09-19 15:58:34,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:58:34" (1/1) ... [2018-09-19 15:58:34,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:58:34" (1/1) ... [2018-09-19 15:58:34,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:58:34" (1/1) ... [2018-09-19 15:58:34,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:58:34" (1/1) ... [2018-09-19 15:58:34,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:58:34" (1/1) ... [2018-09-19 15:58:34,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:58:34,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:58:34,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:58:34,603 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:58:34,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:58:34" (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 15:58:34,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:58:34,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:58:34,789 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-19 15:58:34,789 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-19 15:58:34,789 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_acos [2018-09-19 15:58:34,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:58:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:58:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-19 15:58:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-19 15:58:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 15:58:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 15:58:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 15:58:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 15:58:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 15:58:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 15:58:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_acos [2018-09-19 15:58:34,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:58:34,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:58:34,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:58:34,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 15:58:34,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 15:58:35,119 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:58:35,163 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:58:35,227 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:58:35,247 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:58:46,585 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:58:53,134 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:58:53,149 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:58:53,168 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:58:53,301 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:58:53,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:58:53 BoogieIcfgContainer [2018-09-19 15:58:53,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:58:53,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:58:53,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:58:53,307 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:58:53,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:58:33" (1/3) ... [2018-09-19 15:58:53,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661dd8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:58:53, skipping insertion in model container [2018-09-19 15:58:53,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:58:34" (2/3) ... [2018-09-19 15:58:53,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661dd8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:58:53, skipping insertion in model container [2018-09-19 15:58:53,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:58:53" (3/3) ... [2018-09-19 15:58:53,311 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0490b_true-unreach-call.c [2018-09-19 15:58:53,321 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:58:53,330 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:58:53,379 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:58:53,380 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:58:53,380 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:58:53,380 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:58:53,380 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:58:53,380 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:58:53,380 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:58:53,381 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:58:53,381 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:58:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2018-09-19 15:58:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-19 15:58:53,414 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:58:53,415 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] [2018-09-19 15:58:53,417 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:58:53,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1580949475, now seen corresponding path program 1 times [2018-09-19 15:58:53,428 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:58:53,429 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) [2018-09-19 15:58:53,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 15:58:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:58:58,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:58:58,380 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 15:58:58,381 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:58:58,464 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:58:58,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:58:58,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:58:58,480 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:58:58,481 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:58:58,484 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 2 states. [2018-09-19 15:58:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:58:58,523 INFO L93 Difference]: Finished difference Result 260 states and 344 transitions. [2018-09-19 15:58:58,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:58:58,525 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-09-19 15:58:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:58:58,539 INFO L225 Difference]: With dead ends: 260 [2018-09-19 15:58:58,540 INFO L226 Difference]: Without dead ends: 130 [2018-09-19 15:58:58,546 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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 15:58:58,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-19 15:58:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-09-19 15:58:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-19 15:58:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 156 transitions. [2018-09-19 15:58:58,602 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 156 transitions. Word has length 22 [2018-09-19 15:58:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:58:58,603 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 156 transitions. [2018-09-19 15:58:58,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:58:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 156 transitions. [2018-09-19 15:58:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-19 15:58:58,605 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:58:58,605 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] [2018-09-19 15:58:58,605 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:58:58,606 INFO L82 PathProgramCache]: Analyzing trace with hash 131486143, now seen corresponding path program 1 times [2018-09-19 15:58:58,607 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:58:58,607 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 15:58:58,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:59:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:59:03,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:59:03,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 14 treesize of output 11 [2018-09-19 15:59:03,434 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 15:59:03,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:59:03,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:59:03,462 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 15:59:03,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 15:59:03,529 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 15:59:03,538 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 15:59:03,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:59:03,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:59:03,627 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 15:59:03,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 15:59:04,145 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 15:59:04,145 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:59:04,247 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:59:04,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 15:59:04,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 15:59:04,250 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 15:59:04,250 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 15:59:04,250 INFO L87 Difference]: Start difference. First operand 130 states and 156 transitions. Second operand 9 states. [2018-09-19 15:59:04,796 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-19 15:59:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:59:21,752 INFO L93 Difference]: Finished difference Result 144 states and 169 transitions. [2018-09-19 15:59:21,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 15:59:21,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-09-19 15:59:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:59:21,758 INFO L225 Difference]: With dead ends: 144 [2018-09-19 15:59:21,759 INFO L226 Difference]: Without dead ends: 116 [2018-09-19 15:59:21,761 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-19 15:59:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-19 15:59:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-09-19 15:59:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-19 15:59:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2018-09-19 15:59:21,775 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 31 [2018-09-19 15:59:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:59:21,776 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2018-09-19 15:59:21,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 15:59:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2018-09-19 15:59:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-19 15:59:21,778 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:59:21,778 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] [2018-09-19 15:59:21,778 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:59:21,779 INFO L82 PathProgramCache]: Analyzing trace with hash 94722355, now seen corresponding path program 1 times [2018-09-19 15:59:21,780 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:59:21,780 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 15:59:21,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:59:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:59:22,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:59:25,266 WARN L797 $PredicateComparison]: unable to prove that (= (let ((.cse0 (fp.sub RNE |c___ieee754_acos_#in~x| |c___ieee754_acos_#in~x|))) (fp.div RNE .cse0 .cse0)) |c___ieee754_acos_#res|) is different from false [2018-09-19 15:59:27,662 WARN L819 $PredicateComparison]: unable to prove that (= (let ((.cse0 (fp.sub RNE |c___ieee754_acos_#in~x| |c___ieee754_acos_#in~x|))) (fp.div RNE .cse0 .cse0)) |c___ieee754_acos_#res|) is different from true [2018-09-19 15:59:27,879 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 15:59:27,879 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:59:27,911 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:59:27,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 15:59:27,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 15:59:27,912 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 15:59:27,912 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=43, Unknown=2, NotChecked=12, Total=72 [2018-09-19 15:59:27,912 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand 9 states. [2018-09-19 15:59:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:59:35,027 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2018-09-19 15:59:35,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-19 15:59:35,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-09-19 15:59:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:59:35,039 INFO L225 Difference]: With dead ends: 123 [2018-09-19 15:59:35,039 INFO L226 Difference]: Without dead ends: 116 [2018-09-19 15:59:35,040 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=19, Invalid=55, Unknown=2, NotChecked=14, Total=90 [2018-09-19 15:59:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-19 15:59:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-09-19 15:59:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-19 15:59:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2018-09-19 15:59:35,063 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 40 [2018-09-19 15:59:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:59:35,064 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2018-09-19 15:59:35,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 15:59:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2018-09-19 15:59:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-19 15:59:35,067 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:59:35,067 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] [2018-09-19 15:59:35,068 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:59:35,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2080023178, now seen corresponding path program 1 times [2018-09-19 15:59:35,071 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:59:35,071 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 15:59:35,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:59:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:59:35,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:59:35,266 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 15:59:35,274 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 15:59:35,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:59:35,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:59:35,299 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 15:59:35,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 15:59:35,405 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 15:59:35,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 15:59:35,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:59:35,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:59:35,428 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 15:59:35,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 15:59:35,692 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 15:59:35,692 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:59:35,704 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:59:35,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 15:59:35,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 15:59:35,705 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 15:59:35,705 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 15:59:35,706 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand 9 states. [2018-09-19 15:59:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:59:41,926 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2018-09-19 15:59:41,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 15:59:41,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-09-19 15:59:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:59:41,929 INFO L225 Difference]: With dead ends: 124 [2018-09-19 15:59:41,929 INFO L226 Difference]: Without dead ends: 102 [2018-09-19 15:59:41,930 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-19 15:59:41,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-19 15:59:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-19 15:59:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-19 15:59:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2018-09-19 15:59:41,939 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 41 [2018-09-19 15:59:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:59:41,939 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2018-09-19 15:59:41,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 15:59:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2018-09-19 15:59:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-19 15:59:41,941 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:59:41,941 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] [2018-09-19 15:59:41,942 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:59:41,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1266623308, now seen corresponding path program 1 times [2018-09-19 15:59:41,942 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:59:41,943 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 15:59:41,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:59:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:59:47,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:59:47,227 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 15:59:47,233 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 15:59:47,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:59:47,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:59:47,258 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 15:59:47,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 15:59:47,315 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 15:59:47,322 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 15:59:47,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:59:47,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:59:47,340 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 15:59:47,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 15:59:47,664 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 15:59:47,665 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:59:47,776 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:59:47,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 15:59:47,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 15:59:47,777 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 15:59:47,778 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 15:59:47,778 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand 9 states. [2018-09-19 15:59:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:59:52,688 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2018-09-19 15:59:52,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 15:59:52,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-09-19 15:59:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:59:52,690 INFO L225 Difference]: With dead ends: 102 [2018-09-19 15:59:52,690 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 15:59:52,692 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-19 15:59:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 15:59:52,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 15:59:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 15:59:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 15:59:52,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2018-09-19 15:59:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:59:52,694 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 15:59:52,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 15:59:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 15:59:52,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 15:59:52,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 15:59:53,060 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2018-09-19 15:59:53,120 INFO L429 ceAbstractionStarter]: At program point __ieee754_sqrtENTRY(lines 21 129) the Hoare annotation is: true [2018-09-19 15:59:53,121 INFO L426 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-09-19 15:59:53,121 INFO L426 ceAbstractionStarter]: For program point L126-1(line 126) no Hoare annotation was computed. [2018-09-19 15:59:53,121 INFO L426 ceAbstractionStarter]: For program point L60(lines 60 63) no Hoare annotation was computed. [2018-09-19 15:59:53,121 INFO L426 ceAbstractionStarter]: For program point L126-2(line 126) no Hoare annotation was computed. [2018-09-19 15:59:53,122 INFO L426 ceAbstractionStarter]: For program point L126-3(line 126) no Hoare annotation was computed. [2018-09-19 15:59:53,122 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 27 32) no Hoare annotation was computed. [2018-09-19 15:59:53,122 INFO L426 ceAbstractionStarter]: For program point L60-2(lines 60 63) no Hoare annotation was computed. [2018-09-19 15:59:53,122 INFO L429 ceAbstractionStarter]: At program point L27-3(lines 27 32) the Hoare annotation is: true [2018-09-19 15:59:53,122 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtFINAL(lines 21 129) no Hoare annotation was computed. [2018-09-19 15:59:53,123 INFO L426 ceAbstractionStarter]: For program point L27-4(lines 21 129) no Hoare annotation was computed. [2018-09-19 15:59:53,123 INFO L426 ceAbstractionStarter]: For program point L52-1(lines 52 53) no Hoare annotation was computed. [2018-09-19 15:59:53,123 INFO L426 ceAbstractionStarter]: For program point L52-3(lines 52 53) no Hoare annotation was computed. [2018-09-19 15:59:53,123 INFO L429 ceAbstractionStarter]: At program point L52-4(lines 52 53) the Hoare annotation is: true [2018-09-19 15:59:53,123 INFO L426 ceAbstractionStarter]: For program point L52-5(lines 52 53) no Hoare annotation was computed. [2018-09-19 15:59:53,123 INFO L426 ceAbstractionStarter]: For program point L110(lines 110 111) no Hoare annotation was computed. [2018-09-19 15:59:53,124 INFO L426 ceAbstractionStarter]: For program point L110-2(lines 110 111) no Hoare annotation was computed. [2018-09-19 15:59:53,124 INFO L426 ceAbstractionStarter]: For program point L102(lines 102 116) no Hoare annotation was computed. [2018-09-19 15:59:53,124 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-19 15:59:53,124 INFO L426 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-09-19 15:59:53,124 INFO L426 ceAbstractionStarter]: For program point L28-2(line 28) no Hoare annotation was computed. [2018-09-19 15:59:53,124 INFO L426 ceAbstractionStarter]: For program point L28-3(line 28) no Hoare annotation was computed. [2018-09-19 15:59:53,125 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 120) no Hoare annotation was computed. [2018-09-19 15:59:53,125 INFO L426 ceAbstractionStarter]: For program point L119-2(lines 119 120) no Hoare annotation was computed. [2018-09-19 15:59:53,125 INFO L426 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-09-19 15:59:53,125 INFO L426 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-09-19 15:59:53,125 INFO L426 ceAbstractionStarter]: For program point L87-2(lines 87 96) no Hoare annotation was computed. [2018-09-19 15:59:53,125 INFO L426 ceAbstractionStarter]: For program point L46(lines 46 57) no Hoare annotation was computed. [2018-09-19 15:59:53,125 INFO L426 ceAbstractionStarter]: For program point L46-2(lines 46 57) no Hoare annotation was computed. [2018-09-19 15:59:53,126 INFO L426 ceAbstractionStarter]: For program point L104(lines 104 115) no Hoare annotation was computed. [2018-09-19 15:59:53,126 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 43) no Hoare annotation was computed. [2018-09-19 15:59:53,126 INFO L426 ceAbstractionStarter]: For program point L71-1(lines 71 81) no Hoare annotation was computed. [2018-09-19 15:59:53,126 INFO L426 ceAbstractionStarter]: For program point L38-2(lines 38 43) no Hoare annotation was computed. [2018-09-19 15:59:53,126 INFO L429 ceAbstractionStarter]: At program point L71-3(lines 71 81) the Hoare annotation is: true [2018-09-19 15:59:53,126 INFO L426 ceAbstractionStarter]: For program point L71-4(lines 71 81) no Hoare annotation was computed. [2018-09-19 15:59:53,126 INFO L426 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-09-19 15:59:53,127 INFO L426 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2018-09-19 15:59:53,127 INFO L426 ceAbstractionStarter]: For program point L30-2(line 30) no Hoare annotation was computed. [2018-09-19 15:59:53,127 INFO L426 ceAbstractionStarter]: For program point L47-1(lines 47 51) no Hoare annotation was computed. [2018-09-19 15:59:53,127 INFO L429 ceAbstractionStarter]: At program point L47-3(lines 47 51) the Hoare annotation is: true [2018-09-19 15:59:53,127 INFO L426 ceAbstractionStarter]: For program point L47-4(lines 47 51) no Hoare annotation was computed. [2018-09-19 15:59:53,127 INFO L426 ceAbstractionStarter]: For program point L39(lines 39 42) no Hoare annotation was computed. [2018-09-19 15:59:53,128 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-19 15:59:53,128 INFO L426 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. [2018-09-19 15:59:53,128 INFO L426 ceAbstractionStarter]: For program point L31-2(line 31) no Hoare annotation was computed. [2018-09-19 15:59:53,128 INFO L426 ceAbstractionStarter]: For program point L31-3(line 31) no Hoare annotation was computed. [2018-09-19 15:59:53,128 INFO L426 ceAbstractionStarter]: For program point L89(lines 89 90) no Hoare annotation was computed. [2018-09-19 15:59:53,128 INFO L426 ceAbstractionStarter]: For program point L122-1(lines 122 127) no Hoare annotation was computed. [2018-09-19 15:59:53,128 INFO L426 ceAbstractionStarter]: For program point L89-2(lines 89 90) no Hoare annotation was computed. [2018-09-19 15:59:53,129 INFO L429 ceAbstractionStarter]: At program point L122-3(lines 122 127) the Hoare annotation is: true [2018-09-19 15:59:53,129 INFO L426 ceAbstractionStarter]: For program point L122-4(lines 122 127) no Hoare annotation was computed. [2018-09-19 15:59:53,129 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 114) no Hoare annotation was computed. [2018-09-19 15:59:53,129 INFO L426 ceAbstractionStarter]: For program point L73(lines 73 77) no Hoare annotation was computed. [2018-09-19 15:59:53,129 INFO L426 ceAbstractionStarter]: For program point L73-2(lines 73 77) no Hoare annotation was computed. [2018-09-19 15:59:53,129 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtEXIT(lines 21 129) no Hoare annotation was computed. [2018-09-19 15:59:53,130 INFO L426 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-09-19 15:59:53,130 INFO L426 ceAbstractionStarter]: For program point L123-1(line 123) no Hoare annotation was computed. [2018-09-19 15:59:53,130 INFO L426 ceAbstractionStarter]: For program point L123-2(line 123) no Hoare annotation was computed. [2018-09-19 15:59:53,130 INFO L426 ceAbstractionStarter]: For program point L123-3(line 123) no Hoare annotation was computed. [2018-09-19 15:59:53,130 INFO L426 ceAbstractionStarter]: For program point L41(lines 41 42) no Hoare annotation was computed. [2018-09-19 15:59:53,130 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-19 15:59:53,130 INFO L426 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-09-19 15:59:53,131 INFO L426 ceAbstractionStarter]: For program point L92(lines 92 93) no Hoare annotation was computed. [2018-09-19 15:59:53,131 INFO L426 ceAbstractionStarter]: For program point L92-2(lines 92 93) no Hoare annotation was computed. [2018-09-19 15:59:53,131 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 84 100) no Hoare annotation was computed. [2018-09-19 15:59:53,131 INFO L429 ceAbstractionStarter]: At program point L84-3(lines 84 100) the Hoare annotation is: true [2018-09-19 15:59:53,131 INFO L426 ceAbstractionStarter]: For program point L84-4(lines 21 129) no Hoare annotation was computed. [2018-09-19 15:59:53,131 INFO L426 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2018-09-19 15:59:53,131 INFO L429 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 17) the Hoare annotation is: true [2018-09-19 15:59:53,132 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 17) no Hoare annotation was computed. [2018-09-19 15:59:53,132 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 17) no Hoare annotation was computed. [2018-09-19 15:59:53,132 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 15:59:53,132 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 15:59:53,132 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 15:59:53,132 INFO L426 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-09-19 15:59:53,133 INFO L426 ceAbstractionStarter]: For program point L155(lines 155 169) no Hoare annotation was computed. [2018-09-19 15:59:53,133 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-19 15:59:53,133 INFO L426 ceAbstractionStarter]: For program point __ieee754_acosEXIT(lines 146 215) no Hoare annotation was computed. [2018-09-19 15:59:53,133 INFO L426 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-09-19 15:59:53,133 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-19 15:59:53,133 INFO L426 ceAbstractionStarter]: For program point L160-1(line 160) no Hoare annotation was computed. [2018-09-19 15:59:53,133 INFO L429 ceAbstractionStarter]: At program point __ieee754_acosENTRY(lines 146 215) the Hoare annotation is: true [2018-09-19 15:59:53,134 INFO L426 ceAbstractionStarter]: For program point L160-2(line 160) no Hoare annotation was computed. [2018-09-19 15:59:53,134 INFO L426 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-09-19 15:59:53,134 INFO L426 ceAbstractionStarter]: For program point L152-1(line 152) no Hoare annotation was computed. [2018-09-19 15:59:53,134 INFO L426 ceAbstractionStarter]: For program point L152-2(line 152) no Hoare annotation was computed. [2018-09-19 15:59:53,134 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-19 15:59:53,134 INFO L426 ceAbstractionStarter]: For program point L202-1(line 202) no Hoare annotation was computed. [2018-09-19 15:59:53,135 INFO L426 ceAbstractionStarter]: For program point L202-2(line 202) no Hoare annotation was computed. [2018-09-19 15:59:53,135 INFO L426 ceAbstractionStarter]: For program point L202-3(line 202) no Hoare annotation was computed. [2018-09-19 15:59:53,135 INFO L426 ceAbstractionStarter]: For program point __ieee754_acosFINAL(lines 146 215) no Hoare annotation was computed. [2018-09-19 15:59:53,135 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 198 203) no Hoare annotation was computed. [2018-09-19 15:59:53,135 INFO L422 ceAbstractionStarter]: At program point L198-3(lines 198 203) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|))) (= ((_ extract 63 32) |v_q#valueAsBitvector_9|) __ieee754_acos_~hx~0))) (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (bvand ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv2147483647 32)) __ieee754_acos_~ix~0) (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|))))) (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (not (bvsge (bvand ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv2147483647 32)) (_ bv1072693248 32))) (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|))))) (= |__ieee754_acos_#in~x| __ieee754_acos_~x)) [2018-09-19 15:59:53,136 INFO L426 ceAbstractionStarter]: For program point L198-4(lines 198 203) no Hoare annotation was computed. [2018-09-19 15:59:53,136 INFO L422 ceAbstractionStarter]: At program point L190(line 190) the Hoare annotation is: (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|))) (not (bvsge (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) (_ bv1072693248 32))))) [2018-09-19 15:59:53,136 INFO L426 ceAbstractionStarter]: For program point L190-1(line 190) no Hoare annotation was computed. [2018-09-19 15:59:53,136 INFO L426 ceAbstractionStarter]: For program point L157-1(lines 157 161) no Hoare annotation was computed. [2018-09-19 15:59:53,136 INFO L422 ceAbstractionStarter]: At program point L157-3(lines 157 161) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_10| (_ BitVec 64))) (and (= (bvand ((_ extract 63 32) |v_q#valueAsBitvector_10|) (_ bv2147483647 32)) __ieee754_acos_~ix~0) (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_10|) ((_ extract 62 52) |v_q#valueAsBitvector_10|) ((_ extract 51 0) |v_q#valueAsBitvector_10|))))) (exists ((|v_q#valueAsBitvector_10| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_10|) __ieee754_acos_~hx~0) (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_10|) ((_ extract 62 52) |v_q#valueAsBitvector_10|) ((_ extract 51 0) |v_q#valueAsBitvector_10|))))) (= |__ieee754_acos_#in~x| __ieee754_acos_~x)) [2018-09-19 15:59:53,137 INFO L426 ceAbstractionStarter]: For program point L157-4(lines 155 169) no Hoare annotation was computed. [2018-09-19 15:59:53,137 INFO L426 ceAbstractionStarter]: For program point L182(lines 182 214) no Hoare annotation was computed. [2018-09-19 15:59:53,137 INFO L426 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2018-09-19 15:59:53,137 INFO L422 ceAbstractionStarter]: At program point L149-3(lines 149 153) the Hoare annotation is: (= |__ieee754_acos_#in~x| __ieee754_acos_~x) [2018-09-19 15:59:53,137 INFO L426 ceAbstractionStarter]: For program point L149-4(lines 149 153) no Hoare annotation was computed. [2018-09-19 15:59:53,137 INFO L426 ceAbstractionStarter]: For program point L170(lines 170 214) no Hoare annotation was computed. [2018-09-19 15:59:53,138 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-19 15:59:53,138 INFO L426 ceAbstractionStarter]: For program point L199-1(line 199) no Hoare annotation was computed. [2018-09-19 15:59:53,138 INFO L426 ceAbstractionStarter]: For program point L199-2(line 199) no Hoare annotation was computed. [2018-09-19 15:59:53,138 INFO L426 ceAbstractionStarter]: For program point L199-3(line 199) no Hoare annotation was computed. [2018-09-19 15:59:53,138 INFO L426 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-09-19 15:59:53,138 INFO L426 ceAbstractionStarter]: For program point L158-1(line 158) no Hoare annotation was computed. [2018-09-19 15:59:53,139 INFO L426 ceAbstractionStarter]: For program point L158-2(line 158) no Hoare annotation was computed. [2018-09-19 15:59:53,139 INFO L426 ceAbstractionStarter]: For program point L158-3(line 158) no Hoare annotation was computed. [2018-09-19 15:59:53,139 INFO L426 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-09-19 15:59:53,139 INFO L426 ceAbstractionStarter]: For program point L150-1(line 150) no Hoare annotation was computed. [2018-09-19 15:59:53,139 INFO L426 ceAbstractionStarter]: For program point L150-2(line 150) no Hoare annotation was computed. [2018-09-19 15:59:53,139 INFO L426 ceAbstractionStarter]: For program point L150-3(line 150) no Hoare annotation was computed. [2018-09-19 15:59:53,140 INFO L426 ceAbstractionStarter]: For program point L171(lines 171 172) no Hoare annotation was computed. [2018-09-19 15:59:53,140 INFO L426 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-09-19 15:59:53,140 INFO L422 ceAbstractionStarter]: At program point L196(line 196) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|))) (= ((_ extract 63 32) |v_q#valueAsBitvector_9|) __ieee754_acos_~hx~0))) (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (bvand ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv2147483647 32)) __ieee754_acos_~ix~0) (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|))))) (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (not (bvsge (bvand ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv2147483647 32)) (_ bv1072693248 32))) (= |__ieee754_acos_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|))))) (= |__ieee754_acos_#in~x| __ieee754_acos_~x)) [2018-09-19 15:59:53,140 INFO L426 ceAbstractionStarter]: For program point L163(lines 163 166) no Hoare annotation was computed. [2018-09-19 15:59:53,140 INFO L426 ceAbstractionStarter]: For program point L196-1(line 196) no Hoare annotation was computed. [2018-09-19 15:59:53,141 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 15:59:53,141 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-19 15:59:53,141 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 15:59:53,141 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 15:59:53,141 INFO L422 ceAbstractionStarter]: At program point L224(line 224) the Hoare annotation is: (= (fp.div RNE (fp.neg ((_ to_fp 11 53) RNE 1.0)) (_ +zero 11 53)) main_~x~0) [2018-09-19 15:59:53,141 INFO L426 ceAbstractionStarter]: For program point L224-1(line 224) no Hoare annotation was computed. [2018-09-19 15:59:53,141 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 217 233) the Hoare annotation is: true [2018-09-19 15:59:53,142 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 217 233) no Hoare annotation was computed. [2018-09-19 15:59:53,142 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 217 233) no Hoare annotation was computed. [2018-09-19 15:59:53,142 INFO L426 ceAbstractionStarter]: For program point L228(line 228) no Hoare annotation was computed. [2018-09-19 15:59:53,142 INFO L422 ceAbstractionStarter]: At program point L227(line 227) the Hoare annotation is: (let ((.cse0 (fp.div RNE (fp.neg ((_ to_fp 11 53) RNE 1.0)) (_ +zero 11 53)))) (and (= .cse0 main_~x~0) (= (let ((.cse1 (fp.sub RNE .cse0 .cse0))) (fp.div RNE .cse1 .cse1)) main_~res~0))) [2018-09-19 15:59:53,142 INFO L426 ceAbstractionStarter]: For program point L227-1(lines 227 230) no Hoare annotation was computed. [2018-09-19 15:59:53,143 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 228) no Hoare annotation was computed. [2018-09-19 15:59:53,151 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,154 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,154 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,154 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,160 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,160 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,165 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,165 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,165 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,165 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,167 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:59:53 BoogieIcfgContainer [2018-09-19 15:59:53,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:59:53,172 INFO L168 Benchmark]: Toolchain (without parser) took 79217.90 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -410.6 MB). Peak memory consumption was 316.0 MB. Max. memory is 7.1 GB. [2018-09-19 15:59:53,174 INFO L168 Benchmark]: CDTParser took 0.25 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 15:59:53,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.13 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-19 15:59:53,175 INFO L168 Benchmark]: Boogie Preprocessor took 130.62 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 15:59:53,176 INFO L168 Benchmark]: RCFGBuilder took 18699.69 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -753.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2018-09-19 15:59:53,177 INFO L168 Benchmark]: TraceAbstraction took 59868.35 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 321.7 MB). Peak memory consumption was 321.7 MB. Max. memory is 7.1 GB. [2018-09-19 15:59:53,181 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 513.13 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.62 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 18699.69 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -753.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59868.35 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 321.7 MB). Peak memory consumption was 321.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 228]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant [2018-09-19 15:59:53,191 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,196 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,196 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,196 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,196 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,196 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 15:59:53,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] Derived loop invariant: (((\exists v_q#valueAsBitvector_9 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) && v_q#valueAsBitvector_9[63:32] == hx) && (\exists v_q#valueAsBitvector_9 : bv64 :: ~bvand32(v_q#valueAsBitvector_9[63:32], 2147483647bv32) == ix && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]))) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsge32(~bvand32(v_q#valueAsBitvector_9[63:32], 2147483647bv32), 1072693248bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]))) && \old(x) == x - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant [2018-09-19 15:59:53,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 15:59:53,203 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] Derived loop invariant: ((\exists v_q#valueAsBitvector_10 : bv64 :: ~bvand32(v_q#valueAsBitvector_10[63:32], 2147483647bv32) == ix && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_10[63:63], v_q#valueAsBitvector_10[62:52], v_q#valueAsBitvector_10[51:0])) && (\exists v_q#valueAsBitvector_10 : bv64 :: v_q#valueAsBitvector_10[63:32] == hx && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_10[63:63], v_q#valueAsBitvector_10[62:52], v_q#valueAsBitvector_10[51:0]))) && \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 134 locations, 1 error locations. SAFE Result, 59.7s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 35.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 653 SDtfs, 229 SDslu, 3031 SDs, 0 SdLazy, 313 SolverSat, 13 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 29.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 45 PreInvPairs, 63 NumberOfFragments, 233 HoareAnnotationTreeSize, 45 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 32 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 14.1s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 180 ConstructedInterpolants, 51 QuantifiedInterpolants, 48400 SizeOfPredicates, 29 NumberOfNonLiveVariables, 634 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...