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-benchs/sqrt_biNewton_pseudoconstant_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:50:16,779 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:50:16,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:50:16,800 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:50:16,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:50:16,803 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:50:16,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:50:16,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:50:16,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:50:16,813 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:50:16,816 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:50:16,816 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:50:16,819 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:50:16,820 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:50:16,822 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:50:16,832 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:50:16,833 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:50:16,838 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:50:16,842 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:50:16,844 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:50:16,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:50:16,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:50:16,853 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:50:16,853 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:50:16,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:50:16,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:50:16,859 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:50:16,860 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:50:16,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:50:16,865 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:50:16,865 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:50:16,867 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:50:16,867 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:50:16,867 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:50:16,870 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:50:16,871 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:50:16,872 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:50:16,904 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:50:16,904 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:50:16,905 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:50:16,905 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:50:16,906 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:50:16,906 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:50:16,906 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:50:16,906 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:50:16,907 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:50:16,907 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:50:16,907 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:50:16,907 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:50:16,907 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:50:16,908 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:50:16,908 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:50:16,908 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:50:16,908 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:50:16,909 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:50:16,910 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:50:16,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:50:16,910 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:50:16,910 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:50:16,910 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:50:16,911 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:50:16,911 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:50:16,911 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:50:16,911 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:50:16,912 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:50:16,912 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:50:16,912 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:50:16,912 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:50:16,913 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:50:16,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:50:17,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:50:17,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:50:17,008 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:50:17,008 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:50:17,009 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant_true-unreach-call.c [2018-09-19 15:50:17,363 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fec0a225/5eefa688acb84df0b22cfe9d08af1a68/FLAGabb8f5de9 [2018-09-19 15:50:17,519 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:50:17,520 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant_true-unreach-call.c [2018-09-19 15:50:17,528 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fec0a225/5eefa688acb84df0b22cfe9d08af1a68/FLAGabb8f5de9 [2018-09-19 15:50:17,543 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fec0a225/5eefa688acb84df0b22cfe9d08af1a68 [2018-09-19 15:50:17,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:50:17,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:50:17,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:50:17,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:50:17,564 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:50:17,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:50:17" (1/1) ... [2018-09-19 15:50:17,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1201729e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:17, skipping insertion in model container [2018-09-19 15:50:17,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:50:17" (1/1) ... [2018-09-19 15:50:17,582 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:50:17,819 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:50:17,839 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:50:17,854 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:50:17,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:17 WrapperNode [2018-09-19 15:50:17,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:50:17,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:50:17,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:50:17,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:50:17,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:17" (1/1) ... [2018-09-19 15:50:17,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:17" (1/1) ... [2018-09-19 15:50:17,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:17" (1/1) ... [2018-09-19 15:50:17,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:17" (1/1) ... [2018-09-19 15:50:17,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:17" (1/1) ... [2018-09-19 15:50:17,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:17" (1/1) ... [2018-09-19 15:50:17,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:17" (1/1) ... [2018-09-19 15:50:17,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:50:17,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:50:17,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:50:17,926 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:50:17,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:17" (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:50:18,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:50:18,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:50:18,005 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:50:18,005 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-09-19 15:50:18,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:50:18,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:50:18,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 15:50:18,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-19 15:50:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:50:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-09-19 15:50:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:50:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:50:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:50:28,171 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:50:28,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:50:28 BoogieIcfgContainer [2018-09-19 15:50:28,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:50:28,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:50:28,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:50:28,176 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:50:28,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:50:17" (1/3) ... [2018-09-19 15:50:28,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57359507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:50:28, skipping insertion in model container [2018-09-19 15:50:28,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:17" (2/3) ... [2018-09-19 15:50:28,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57359507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:50:28, skipping insertion in model container [2018-09-19 15:50:28,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:50:28" (3/3) ... [2018-09-19 15:50:28,180 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_biNewton_pseudoconstant_true-unreach-call.c [2018-09-19 15:50:28,190 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:50:28,199 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:50:28,244 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:50:28,245 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:50:28,245 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:50:28,246 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:50:28,246 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:50:28,246 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:50:28,247 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:50:28,247 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:50:28,247 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:50:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-09-19 15:50:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-19 15:50:28,272 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:50:28,273 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] [2018-09-19 15:50:28,276 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:50:28,282 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-09-19 15:50:28,287 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:50:28,287 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:50:28,301 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:50:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:50:29,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:50:29,970 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:50:29,970 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:50:30,005 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:50:30,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:50:30,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:50:30,022 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:50:30,023 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:50:30,028 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-09-19 15:50:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:50:30,052 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-09-19 15:50:30,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:50:30,054 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-09-19 15:50:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:50:30,064 INFO L225 Difference]: With dead ends: 56 [2018-09-19 15:50:30,065 INFO L226 Difference]: Without dead ends: 26 [2018-09-19 15:50:30,069 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:50:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-19 15:50:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-19 15:50:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-19 15:50:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-09-19 15:50:30,110 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-09-19 15:50:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:50:30,111 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-09-19 15:50:30,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:50:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-09-19 15:50:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-19 15:50:30,112 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:50:30,113 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:50:30,113 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:50:30,114 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-09-19 15:50:30,114 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:50:30,114 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:50:30,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:50:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:50:31,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:50:40,509 WARN L178 SmtUtils]: Spent 7.09 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-09-19 15:50:40,516 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:50:40,516 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:50:40,557 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:50:40,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 15:50:40,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 15:50:40,559 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 15:50:40,559 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 15:50:40,560 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-09-19 15:50:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:50:48,716 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-09-19 15:50:48,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 15:50:48,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-09-19 15:50:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:50:48,720 INFO L225 Difference]: With dead ends: 49 [2018-09-19 15:50:48,720 INFO L226 Difference]: Without dead ends: 29 [2018-09-19 15:50:48,721 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 15:50:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-19 15:50:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-19 15:50:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-19 15:50:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-09-19 15:50:48,730 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-09-19 15:50:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:50:48,730 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-09-19 15:50:48,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 15:50:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-09-19 15:50:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-19 15:50:48,731 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:50:48,731 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:50:48,732 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:50:48,732 INFO L82 PathProgramCache]: Analyzing trace with hash 502189223, now seen corresponding path program 1 times [2018-09-19 15:50:48,732 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:50:48,733 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:50:48,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:50:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:50:53,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:50:53,845 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-19 15:50:54,039 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 15:50:56,573 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (fp.div RNE .cse0 |c_SqrtR_#in~Input|) c_SqrtR_~xn~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)))) is different from false [2018-09-19 15:50:59,062 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (= (_ bv1 32) c_SqrtR_~cond~0)) (.cse4 (let ((.cse6 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse6) (fp.mul RNE c_~_EPS~0 .cse6)))) (.cse0 (= (fp.div RNE .cse5 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0)) (.cse1 (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0)) (.cse2 (not (fp.leq |c_SqrtR_#in~Input| .cse5)))) (or (and .cse0 .cse1 (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) v_prenex_2)) .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse2 .cse3) (and (not .cse4) .cse0 (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) SqrtR_~linf~0))) (= (_ bv0 32) c_SqrtR_~cond~0) .cse1 .cse2)))) is different from false [2018-09-19 15:51:01,172 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (= (_ bv1 32) c_SqrtR_~cond~0)) (.cse4 (let ((.cse6 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse6) (fp.mul RNE c_~_EPS~0 .cse6)))) (.cse0 (= (fp.div RNE .cse5 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0)) (.cse1 (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0)) (.cse2 (not (fp.leq |c_SqrtR_#in~Input| .cse5)))) (or (and .cse0 .cse1 (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) v_prenex_2)) .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse2 .cse3) (and (not .cse4) .cse0 (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) SqrtR_~linf~0))) (= (_ bv0 32) c_SqrtR_~cond~0) .cse1 .cse2)))) is different from true [2018-09-19 15:51:03,642 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (not (let ((.cse0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0)))) (= (fp.div RNE .cse1 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) SqrtR_~linf~0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse1)))) is different from false [2018-09-19 15:51:06,009 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (not (let ((.cse0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0)))) (= (fp.div RNE .cse1 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) SqrtR_~linf~0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse1)))) is different from true [2018-09-19 15:51:08,835 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 |c_SqrtR_#in~Input|))) (and (= (fp.div RNE .cse0 .cse1) |c_SqrtR_#res|) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (let ((.cse2 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) |c_SqrtR_#in~Input|))) (fp.add RNE .cse2 .cse2))) SqrtR_~linf~0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (not (let ((.cse3 (fp.add RNE .cse1 .cse1))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse3) (fp.mul RNE c_~_EPS~0 .cse3))))))) is different from false [2018-09-19 15:51:11,423 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 |c_SqrtR_#in~Input|))) (and (= (fp.div RNE .cse0 .cse1) |c_SqrtR_#res|) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (let ((.cse2 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) |c_SqrtR_#in~Input|))) (fp.add RNE .cse2 .cse2))) SqrtR_~linf~0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (not (let ((.cse3 (fp.add RNE .cse1 .cse1))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse3) (fp.mul RNE c_~_EPS~0 .cse3))))))) is different from true [2018-09-19 15:51:14,337 WARN L797 $PredicateComparison]: unable to prove that (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.div RNE .cse0 main_~dd~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse3 .cse3))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse1 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.leq main_~dd~0 .cse0)) (not (fp.lt .cse1 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse2)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse2)) (= |c_main_#t~ret3| (fp.div RNE .cse0 .cse3)) (not (fp.gt .cse1 (fp.mul RNE .cse4 .cse5))))))))) is different from false [2018-09-19 15:51:17,023 WARN L819 $PredicateComparison]: unable to prove that (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.div RNE .cse0 main_~dd~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse3 .cse3))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse1 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.leq main_~dd~0 .cse0)) (not (fp.lt .cse1 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse2)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse2)) (= |c_main_#t~ret3| (fp.div RNE .cse0 .cse3)) (not (fp.gt .cse1 (fp.mul RNE .cse4 .cse5))))))))) is different from true [2018-09-19 15:51:19,904 WARN L797 $PredicateComparison]: unable to prove that (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 main_~dd~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse3 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse2 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.leq main_~dd~0 .cse0)) (= (fp.div RNE .cse0 .cse1) c_main_~r~0) (not (fp.lt .cse2 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse3)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse3)) (not (fp.gt .cse2 (fp.mul RNE .cse4 .cse5))))))))) is different from false [2018-09-19 15:51:22,593 WARN L819 $PredicateComparison]: unable to prove that (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 main_~dd~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse3 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse2 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.leq main_~dd~0 .cse0)) (= (fp.div RNE .cse0 .cse1) c_main_~r~0) (not (fp.lt .cse2 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse3)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse3)) (not (fp.gt .cse2 (fp.mul RNE .cse4 .cse5))))))))) is different from true [2018-09-19 15:51:45,947 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and .cse0 (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.div RNE .cse1 main_~dd~0))) (let ((.cse5 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse6 (fp.add RNE .cse2 .cse2))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse5) .cse6))) (and (not (fp.leq (fp.div RNE .cse1 .cse2) ((_ to_fp 11 53) RNE 5.0))) (not (fp.leq main_~dd~0 .cse1)) (not (fp.lt .cse3 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse1 .cse4)) (fp.leq main_~dd~0 (fp.add RNE .cse1 .cse4)) (not (fp.gt .cse3 (fp.mul RNE .cse5 .cse6)))))))))) (and (exists ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse8 (fp.div RNE .cse7 v_prenex_4))) (let ((.cse11 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse12 (fp.add RNE .cse8 .cse8))) (let ((.cse9 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse10 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse11) .cse12))) (and (not (fp.geq (fp.div RNE .cse7 .cse8) ((_ to_fp 11 53) RNE (/ 9.0 10.0)))) (fp.geq v_prenex_4 (fp.sub RNE .cse7 .cse9)) (not (fp.gt .cse10 (fp.mul RNE .cse11 .cse12))) (fp.leq v_prenex_4 (fp.add RNE .cse7 .cse9)) (not (fp.lt .cse10 v_prenex_3)) (not (fp.leq v_prenex_4 .cse7)))))))) .cse0) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse19 (fp.div RNE .cse14 v_prenex_7))) (let ((.cse17 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse18 (fp.add RNE .cse19 .cse19))) (let ((.cse16 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse17) .cse18)) (.cse15 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse13 (fp.div RNE .cse14 .cse19))) (and (fp.leq .cse13 ((_ to_fp 11 53) RNE 5.0)) (not (fp.leq v_prenex_7 .cse14)) (fp.leq v_prenex_7 (fp.add RNE .cse14 .cse15)) (not (fp.lt .cse16 v_prenex_6)) (not (fp.gt .cse16 (fp.mul RNE .cse17 .cse18))) (fp.geq v_prenex_7 (fp.sub RNE .cse14 .cse15)) (fp.geq .cse13 ((_ to_fp 11 53) RNE (/ 9.0 10.0)))))))))))) is different from false [2018-09-19 15:52:06,450 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.div RNE .cse1 main_~dd~0))) (let ((.cse5 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse6 (fp.add RNE .cse2 .cse2))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse5) .cse6))) (and (not (fp.leq (fp.div RNE .cse1 .cse2) ((_ to_fp 11 53) RNE 5.0))) (not (fp.leq main_~dd~0 .cse1)) (not (fp.lt .cse3 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse1 .cse4)) (fp.leq main_~dd~0 (fp.add RNE .cse1 .cse4)) (not (fp.gt .cse3 (fp.mul RNE .cse5 .cse6)))))))))) (and (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse13 (fp.div RNE .cse8 v_prenex_7))) (let ((.cse11 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse12 (fp.add RNE .cse13 .cse13))) (let ((.cse10 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse11) .cse12)) (.cse9 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse7 (fp.div RNE .cse8 .cse13))) (and (fp.leq .cse7 ((_ to_fp 11 53) RNE 5.0)) (not (fp.leq v_prenex_7 .cse8)) (fp.leq v_prenex_7 (fp.add RNE .cse8 .cse9)) (not (fp.lt .cse10 v_prenex_6)) (not (fp.gt .cse10 (fp.mul RNE .cse11 .cse12))) (fp.geq v_prenex_7 (fp.sub RNE .cse8 .cse9)) (fp.geq .cse7 ((_ to_fp 11 53) RNE (/ 9.0 10.0))))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (exists ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse15 (fp.div RNE .cse14 v_prenex_4))) (let ((.cse18 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse19 (fp.add RNE .cse15 .cse15))) (let ((.cse16 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse17 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse18) .cse19))) (and (not (fp.geq (fp.div RNE .cse14 .cse15) ((_ to_fp 11 53) RNE (/ 9.0 10.0)))) (fp.geq v_prenex_4 (fp.sub RNE .cse14 .cse16)) (not (fp.gt .cse17 (fp.mul RNE .cse18 .cse19))) (fp.leq v_prenex_4 (fp.add RNE .cse14 .cse16)) (not (fp.lt .cse17 v_prenex_3)) (not (fp.leq v_prenex_4 .cse14))))))))))) is different from false [2018-09-19 15:52:21,187 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 v_prenex_4))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.geq (fp.div RNE .cse0 .cse1) ((_ to_fp 11 53) RNE (/ 9.0 10.0)))) (fp.geq v_prenex_4 (fp.sub RNE .cse0 .cse2)) (not (fp.gt .cse3 (fp.mul RNE .cse4 .cse5))) (fp.leq v_prenex_4 (fp.add RNE .cse0 .cse2)) (not (fp.lt .cse3 v_prenex_3)) (not (fp.leq v_prenex_4 .cse0)))))))) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse7 (fp.div RNE .cse6 main_~dd~0))) (let ((.cse10 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse11 (fp.add RNE .cse7 .cse7))) (let ((.cse9 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse8 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse10) .cse11))) (and (not (fp.leq (fp.div RNE .cse6 .cse7) ((_ to_fp 11 53) RNE 5.0))) (not (fp.leq main_~dd~0 .cse6)) (not (fp.lt .cse8 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse6 .cse9)) (fp.leq main_~dd~0 (fp.add RNE .cse6 .cse9)) (not (fp.gt .cse8 (fp.mul RNE .cse10 .cse11)))))))))) is different from false [2018-09-19 15:52:23,924 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 v_prenex_4))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.geq (fp.div RNE .cse0 .cse1) ((_ to_fp 11 53) RNE (/ 9.0 10.0)))) (fp.geq v_prenex_4 (fp.sub RNE .cse0 .cse2)) (not (fp.gt .cse3 (fp.mul RNE .cse4 .cse5))) (fp.leq v_prenex_4 (fp.add RNE .cse0 .cse2)) (not (fp.lt .cse3 v_prenex_3)) (not (fp.leq v_prenex_4 .cse0)))))))) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse7 (fp.div RNE .cse6 main_~dd~0))) (let ((.cse10 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse11 (fp.add RNE .cse7 .cse7))) (let ((.cse9 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse8 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse10) .cse11))) (and (not (fp.leq (fp.div RNE .cse6 .cse7) ((_ to_fp 11 53) RNE 5.0))) (not (fp.leq main_~dd~0 .cse6)) (not (fp.lt .cse8 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse6 .cse9)) (fp.leq main_~dd~0 (fp.add RNE .cse6 .cse9)) (not (fp.gt .cse8 (fp.mul RNE .cse10 .cse11)))))))))) is different from true [2018-09-19 15:52:23,936 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:52:23,937 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:52:23,983 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:52:23,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 15:52:23,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-19 15:52:23,984 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-19 15:52:23,985 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=21, Unknown=15, NotChecked=144, Total=210 [2018-09-19 15:52:23,985 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-09-19 15:52:25,301 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-19 15:52:29,628 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (fp.div RNE .cse0 |c_SqrtR_#in~Input|) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (not (fp.leq |c_SqrtR_#in~Input| .cse0)))) is different from false [2018-09-19 15:52:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:52:45,087 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-09-19 15:52:45,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 15:52:45,088 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-09-19 15:52:45,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:52:45,094 INFO L225 Difference]: With dead ends: 64 [2018-09-19 15:52:45,094 INFO L226 Difference]: Without dead ends: 62 [2018-09-19 15:52:45,095 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=37, Invalid=29, Unknown=16, NotChecked=190, Total=272 [2018-09-19 15:52:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-19 15:52:45,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-09-19 15:52:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-19 15:52:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-09-19 15:52:45,118 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 22 [2018-09-19 15:52:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:52:45,119 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-09-19 15:52:45,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-19 15:52:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-09-19 15:52:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-19 15:52:45,121 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:52:45,122 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:52:45,122 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:52:45,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1812175119, now seen corresponding path program 1 times [2018-09-19 15:52:45,123 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:52:45,123 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:52:45,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:53:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:53:18,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:53:21,368 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse2 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE c_SqrtR_~xnp1~0 .cse4))) (.cse3 (fp.mul RNE c_~_EPS~0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (let ((.cse1 (fp.lt .cse2 (fp.neg .cse3))) (.cse0 (fp.gt .cse2 .cse3))) (or (and (or .cse0 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0)) (and (not .cse1) (not .cse0) (= (_ bv0 32) c_SqrtR_~cond~0))))) (fp.leq |c_SqrtR_#in~Input| .cse4) (= c_SqrtR_~xnp1~0 (fp.add RNE .cse4 (fp.div RNE (fp.mul RNE .cse4 (let ((.cse5 (fp.sub RNE .cse4 (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse4) .cse4)))) (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE 8.0) .cse5) (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 6.0) .cse5) .cse5)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 5.0) .cse5) .cse5) .cse5)))) ((_ to_fp 11 53) RNE 16.0)))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))) is different from false [2018-09-19 15:53:23,506 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse2 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE c_SqrtR_~xnp1~0 .cse4))) (.cse3 (fp.mul RNE c_~_EPS~0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (let ((.cse1 (fp.lt .cse2 (fp.neg .cse3))) (.cse0 (fp.gt .cse2 .cse3))) (or (and (or .cse0 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0)) (and (not .cse1) (not .cse0) (= (_ bv0 32) c_SqrtR_~cond~0))))) (fp.leq |c_SqrtR_#in~Input| .cse4) (= c_SqrtR_~xnp1~0 (fp.add RNE .cse4 (fp.div RNE (fp.mul RNE .cse4 (let ((.cse5 (fp.sub RNE .cse4 (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse4) .cse4)))) (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE 8.0) .cse5) (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 6.0) .cse5) .cse5)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 5.0) .cse5) .cse5) .cse5)))) ((_ to_fp 11 53) RNE 16.0)))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))) is different from true [2018-09-19 15:53:25,856 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE c_SqrtR_~xnp1~0 .cse2))) (.cse1 (fp.mul RNE c_~_EPS~0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (fp.leq |c_SqrtR_#in~Input| .cse2) (= c_SqrtR_~xnp1~0 (fp.add RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (let ((.cse3 (fp.sub RNE .cse2 (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2)))) (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE 8.0) .cse3) (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 6.0) .cse3) .cse3)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 5.0) .cse3) .cse3) .cse3)))) ((_ to_fp 11 53) RNE 16.0)))) (not (fp.gt .cse0 .cse1)) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0)))) is different from false [2018-09-19 15:53:27,936 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE c_SqrtR_~xnp1~0 .cse2))) (.cse1 (fp.mul RNE c_~_EPS~0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (fp.leq |c_SqrtR_#in~Input| .cse2) (= c_SqrtR_~xnp1~0 (fp.add RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (let ((.cse3 (fp.sub RNE .cse2 (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2)))) (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE 8.0) .cse3) (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 6.0) .cse3) .cse3)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 5.0) .cse3) .cse3) .cse3)))) ((_ to_fp 11 53) RNE 16.0)))) (not (fp.gt .cse0 .cse1)) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0)))) is different from true [2018-09-19 15:53:30,667 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.add RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (let ((.cse4 (fp.sub RNE .cse0 (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0)))) (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE 8.0) .cse4) (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 6.0) .cse4) .cse4)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 5.0) .cse4) .cse4) .cse4)))) ((_ to_fp 11 53) RNE 16.0))))) (let ((.cse1 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse3 .cse0))) (.cse2 (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse3 .cse3)))) (and (fp.leq |c_SqrtR_#in~Input| .cse0) (not (fp.lt .cse1 (fp.neg .cse2))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= |c_SqrtR_#res| (fp.div RNE .cse0 .cse3)) (not (fp.gt .cse1 .cse2)))))) is different from false [2018-09-19 15:53:32,987 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.add RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (let ((.cse4 (fp.sub RNE .cse0 (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0)))) (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE 8.0) .cse4) (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 6.0) .cse4) .cse4)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 5.0) .cse4) .cse4) .cse4)))) ((_ to_fp 11 53) RNE 16.0))))) (let ((.cse1 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse3 .cse0))) (.cse2 (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse3 .cse3)))) (and (fp.leq |c_SqrtR_#in~Input| .cse0) (not (fp.lt .cse1 (fp.neg .cse2))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= |c_SqrtR_#res| (fp.div RNE .cse0 .cse3)) (not (fp.gt .cse1 .cse2)))))) is different from true [2018-09-19 15:53:35,769 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse4 (fp.add RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (let ((.cse5 (fp.sub RNE .cse0 (fp.mul RNE (fp.mul RNE main_~dd~0 .cse0) .cse0)))) (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE 8.0) .cse5) (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 6.0) .cse5) .cse5)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 5.0) .cse5) .cse5) .cse5)))) ((_ to_fp 11 53) RNE 16.0))))) (let ((.cse1 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse2 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse4 .cse0))) (.cse3 (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) (fp.add RNE .cse4 .cse4)))) (and (fp.leq main_~dd~0 .cse0) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse1)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse1)) (not (fp.lt .cse2 (fp.neg .cse3))) (= |c_main_#t~ret3| (fp.div RNE .cse0 .cse4)) (not (fp.gt .cse2 .cse3))))))) is different from false [2018-09-19 15:53:36,716 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-09-19 15:53:36,917 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2018-09-19 15:53:36,918 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:810) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:732) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:338) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:298) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-09-19 15:53:36,923 INFO L168 Benchmark]: Toolchain (without parser) took 199369.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -649.3 MB). Peak memory consumption was 95.2 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:36,924 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:53:36,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:36,926 INFO L168 Benchmark]: Boogie Preprocessor took 38.71 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:53:36,926 INFO L168 Benchmark]: RCFGBuilder took 10246.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:36,927 INFO L168 Benchmark]: TraceAbstraction took 188749.26 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 133.5 MB). Peak memory consumption was 133.5 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:36,931 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 328.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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.71 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 10246.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188749.26 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 133.5 MB). Peak memory consumption was 133.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...