java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:39:29,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:39:29,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:39:29,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:39:29,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:39:29,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:39:29,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:39:29,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:39:29,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:39:29,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:39:29,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:39:29,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:39:29,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:39:29,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:39:29,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:39:29,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:39:29,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:39:29,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:39:29,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:39:29,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:39:29,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:39:29,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:39:29,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:39:29,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:39:29,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:39:29,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:39:29,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:39:29,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:39:29,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:39:29,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:39:29,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:39:29,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:39:29,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:39:29,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:39:29,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:39:29,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:39:29,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:39:29,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:39:29,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:39:29,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:39:29,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:39:29,436 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:39:29,452 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:39:29,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:39:29,452 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:39:29,453 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:39:29,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:39:29,454 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:39:29,454 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:39:29,454 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:39:29,454 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:39:29,454 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:39:29,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:39:29,455 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:39:29,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:39:29,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:39:29,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:39:29,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:39:29,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:39:29,456 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:39:29,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:39:29,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:39:29,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:39:29,457 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:39:29,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:39:29,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:39:29,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:39:29,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:39:29,458 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:39:29,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:39:29,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:39:29,459 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:39:29,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:39:29,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:39:29,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:39:29,503 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:39:29,504 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:39:29,504 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c [2019-09-10 01:39:29,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd8411d3/c33d1eb172da424e90525bbee1dda8f1/FLAG2be8975ca [2019-09-10 01:39:30,036 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:39:30,036 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c [2019-09-10 01:39:30,043 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd8411d3/c33d1eb172da424e90525bbee1dda8f1/FLAG2be8975ca [2019-09-10 01:39:30,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd8411d3/c33d1eb172da424e90525bbee1dda8f1 [2019-09-10 01:39:30,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:39:30,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:39:30,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:39:30,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:39:30,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:39:30,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:39:30" (1/1) ... [2019-09-10 01:39:30,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84c5b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:30, skipping insertion in model container [2019-09-10 01:39:30,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:39:30" (1/1) ... [2019-09-10 01:39:30,428 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:39:30,447 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:39:30,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:39:30,620 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:39:30,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:39:30,658 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:39:30,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:30 WrapperNode [2019-09-10 01:39:30,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:39:30,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:39:30,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:39:30,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:39:30,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:30" (1/1) ... [2019-09-10 01:39:30,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:30" (1/1) ... [2019-09-10 01:39:30,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:30" (1/1) ... [2019-09-10 01:39:30,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:30" (1/1) ... [2019-09-10 01:39:30,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:30" (1/1) ... [2019-09-10 01:39:30,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:30" (1/1) ... [2019-09-10 01:39:30,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:30" (1/1) ... [2019-09-10 01:39:30,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:39:30,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:39:30,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:39:30,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:39:30,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:30" (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 [2019-09-10 01:39:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:39:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:39:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:39:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2019-09-10 01:39:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:39:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:39:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2019-09-10 01:39:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 01:39:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:39:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2019-09-10 01:39:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:39:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:39:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:39:31,076 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:39:31,076 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-10 01:39:31,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:39:31 BoogieIcfgContainer [2019-09-10 01:39:31,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:39:31,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:39:31,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:39:31,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:39:31,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:39:30" (1/3) ... [2019-09-10 01:39:31,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35aa05d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:39:31, skipping insertion in model container [2019-09-10 01:39:31,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:30" (2/3) ... [2019-09-10 01:39:31,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35aa05d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:39:31, skipping insertion in model container [2019-09-10 01:39:31,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:39:31" (3/3) ... [2019-09-10 01:39:31,086 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2019-09-10 01:39:31,099 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:39:31,116 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:39:31,166 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:39:31,228 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:39:31,229 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:39:31,229 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:39:31,229 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:39:31,229 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:39:31,229 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:39:31,229 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:39:31,230 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:39:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-10 01:39:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:39:31,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:31,259 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:31,261 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash -995072322, now seen corresponding path program 1 times [2019-09-10 01:39:31,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:31,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:31,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:31,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:31,362 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:39:31,362 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:39:31,362 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:39:31,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:31,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:39:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:31,398 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:39:31,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:31,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:31,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:31,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:31,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:39:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:31,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 01:39:31,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:31,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:31,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:39:31,627 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:32,903 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-10 01:39:32,999 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_SqrtR_~residu~0_7 Real) (v_SqrtR_~xnp1~0_8 Real) (v_SqrtR_~lsup~0_7 Real)) (let ((.cse0 (+ v_SqrtR_~xnp1~0_8 1.0))) (and (<= 1.0 v_SqrtR_~xnp1~0_8) (>= v_SqrtR_~residu~0_7 (* (* 2.0 c_~_EPS~0) .cse0)) (<= v_SqrtR_~residu~0_7 v_SqrtR_~lsup~0_7) (<= v_SqrtR_~lsup~0_7 (* c_~_EPS~0 .cse0))))) (forall ((v_SqrtR_~residu~0_8 Real) (v_SqrtR_~xnp1~0_9 Real) (v_SqrtR_~lsup~0_8 Real)) (let ((.cse1 (+ c_SqrtR_~xn~0 v_SqrtR_~xnp1~0_9))) (or (not (>= v_SqrtR_~residu~0_8 (* (* 2.0 c_~_EPS~0) .cse1))) (not (<= v_SqrtR_~lsup~0_8 (* c_~_EPS~0 .cse1))) (< v_SqrtR_~xnp1~0_9 c_SqrtR_~xn~0) (< v_SqrtR_~lsup~0_8 v_SqrtR_~residu~0_8))))) is different from false [2019-09-10 01:39:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:39:33,089 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:39:33,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [] total 9 [2019-09-10 01:39:33,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:39:33,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:39:33,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:39:33,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2019-09-10 01:39:33,116 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-09-10 01:39:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:33,221 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-09-10 01:39:33,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:39:33,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-10 01:39:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:33,236 INFO L225 Difference]: With dead ends: 31 [2019-09-10 01:39:33,237 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 01:39:33,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=29, Invalid=46, Unknown=1, NotChecked=14, Total=90 [2019-09-10 01:39:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 01:39:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-10 01:39:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:39:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-10 01:39:33,286 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2019-09-10 01:39:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:33,287 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-10 01:39:33,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:39:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-10 01:39:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:39:33,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:33,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:33,289 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:33,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:33,290 INFO L82 PathProgramCache]: Analyzing trace with hash -294007744, now seen corresponding path program 1 times [2019-09-10 01:39:33,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:33,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:33,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:33,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:33,306 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:39:33,306 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:39:33,306 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:39:33,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:33,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:39:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:33,345 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:39:33,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:33,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:33,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:33,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:33,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:39:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:33,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 01:39:33,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:33,402 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~_EPS~0 (/ 1.0 1000000.0)) (exists ((SqrtR_~Input Real)) (and (= (/ 1.0 SqrtR_~Input) c_SqrtR_~xn~0) (< 1.0 SqrtR_~Input)))) is different from false [2019-09-10 01:39:33,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:33,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:33,421 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 c_SqrtR_~cond~0)) (.cse0 (= c_~_EPS~0 (/ 1.0 1000000.0)))) (or (and .cse0 .cse1 (exists ((SqrtR_~lsup~0 Real) (SqrtR_~Input Real)) (let ((.cse2 (* (/ 1.0 SqrtR_~Input) 2.0))) (and (<= SqrtR_~lsup~0 (* c_~_EPS~0 .cse2)) (< SqrtR_~lsup~0 (* (* 2.0 c_~_EPS~0) .cse2)) (< 1.0 SqrtR_~Input))))) (and .cse0 .cse1 (exists ((SqrtR_~linf~0 Real) (SqrtR_~lsup~0 Real) (SqrtR_~Input Real)) (let ((.cse3 (* (/ 1.0 SqrtR_~Input) 2.0))) (and (<= SqrtR_~lsup~0 (* c_~_EPS~0 .cse3)) (<= 0.0 (+ SqrtR_~linf~0 SqrtR_~lsup~0)) (< 1.0 SqrtR_~Input) (< (* (* 2.0 c_~_EPS~0) .cse3) SqrtR_~linf~0))))) (and (= 0 c_SqrtR_~cond~0) .cse0 (exists ((SqrtR_~linf~0 Real) (SqrtR_~lsup~0 Real) (SqrtR_~Input Real)) (let ((.cse4 (* (/ 1.0 SqrtR_~Input) 2.0))) (let ((.cse5 (* (* 2.0 c_~_EPS~0) .cse4))) (and (<= SqrtR_~lsup~0 (* c_~_EPS~0 .cse4)) (not (< SqrtR_~lsup~0 .cse5)) (<= 0.0 (+ SqrtR_~linf~0 SqrtR_~lsup~0)) (< 1.0 SqrtR_~Input) (not (< .cse5 SqrtR_~linf~0))))))))) is different from false [2019-09-10 01:39:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:39:33,442 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:33,718 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 01:39:33,919 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 01:39:34,152 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 01:39:34,328 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 01:39:34,359 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_SqrtR_~lsup~0_12 Real) (v_SqrtR_~Input_10 Real) (v_SqrtR_~linf~0_12 Real)) (let ((.cse1 (let ((.cse2 (/ 1.0 v_SqrtR_~Input_10))) (+ .cse2 .cse2)))) (let ((.cse0 (* (* 2.0 c_~_EPS~0) .cse1))) (or (<= v_SqrtR_~Input_10 1.0) (< v_SqrtR_~lsup~0_12 .cse0) (< .cse0 v_SqrtR_~linf~0_12) (not (<= v_SqrtR_~lsup~0_12 (* c_~_EPS~0 .cse1))) (< (+ v_SqrtR_~lsup~0_12 v_SqrtR_~linf~0_12) 0.0))))) is different from true [2019-09-10 01:39:34,381 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_SqrtR_~lsup~0_12 Real) (v_SqrtR_~Input_10 Real) (v_SqrtR_~linf~0_12 Real)) (let ((.cse1 (let ((.cse2 (/ 1.0 v_SqrtR_~Input_10))) (+ .cse2 .cse2)))) (let ((.cse0 (* (* 2.0 c_~_EPS~0) .cse1))) (and (not (< .cse0 v_SqrtR_~linf~0_12)) (<= 0.0 (+ v_SqrtR_~lsup~0_12 v_SqrtR_~linf~0_12)) (not (< v_SqrtR_~lsup~0_12 .cse0)) (< 1.0 v_SqrtR_~Input_10) (<= v_SqrtR_~lsup~0_12 (* c_~_EPS~0 .cse1)))))) is different from false [2019-09-10 01:39:34,426 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_SqrtR_~lsup~0_12 Real) (v_SqrtR_~Input_10 Real) (v_SqrtR_~linf~0_12 Real)) (let ((.cse1 (let ((.cse2 (/ 1.0 v_SqrtR_~Input_10))) (+ .cse2 .cse2)))) (let ((.cse0 (* (* 2.0 c_~_EPS~0) .cse1))) (and (not (< .cse0 v_SqrtR_~linf~0_12)) (<= 0.0 (+ v_SqrtR_~lsup~0_12 v_SqrtR_~linf~0_12)) (not (< v_SqrtR_~lsup~0_12 .cse0)) (< 1.0 v_SqrtR_~Input_10) (<= v_SqrtR_~lsup~0_12 (* c_~_EPS~0 .cse1)))))) (forall ((v_SqrtR_~lsup~0_13 Real) (v_SqrtR_~linf~0_13 Real)) (let ((.cse3 (* 2.0 c_SqrtR_~xn~0))) (let ((.cse4 (* (* 2.0 c_~_EPS~0) .cse3))) (or (< (+ v_SqrtR_~lsup~0_13 v_SqrtR_~linf~0_13) 0.0) (not (<= v_SqrtR_~lsup~0_13 (* c_~_EPS~0 .cse3))) (< .cse4 v_SqrtR_~linf~0_13) (< v_SqrtR_~lsup~0_13 .cse4)))))) is different from false [2019-09-10 01:39:34,439 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_SqrtR_~lsup~0_13 Real) (SqrtR_~Input Real) (v_SqrtR_~linf~0_13 Real)) (let ((.cse0 (* (/ 1.0 SqrtR_~Input) 2.0))) (let ((.cse1 (* (* 2.0 c_~_EPS~0) .cse0))) (or (<= SqrtR_~Input 1.0) (< (+ v_SqrtR_~lsup~0_13 v_SqrtR_~linf~0_13) 0.0) (not (<= v_SqrtR_~lsup~0_13 (* c_~_EPS~0 .cse0))) (< v_SqrtR_~lsup~0_13 .cse1) (< .cse1 v_SqrtR_~linf~0_13))))) (exists ((v_SqrtR_~lsup~0_12 Real) (v_SqrtR_~Input_10 Real) (v_SqrtR_~linf~0_12 Real)) (let ((.cse3 (let ((.cse4 (/ 1.0 v_SqrtR_~Input_10))) (+ .cse4 .cse4)))) (let ((.cse2 (* (* 2.0 c_~_EPS~0) .cse3))) (and (not (< .cse2 v_SqrtR_~linf~0_12)) (<= 0.0 (+ v_SqrtR_~lsup~0_12 v_SqrtR_~linf~0_12)) (not (< v_SqrtR_~lsup~0_12 .cse2)) (< 1.0 v_SqrtR_~Input_10) (<= v_SqrtR_~lsup~0_12 (* c_~_EPS~0 .cse3))))))) is different from false [2019-09-10 01:39:34,442 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_SqrtR_~lsup~0_13 Real) (SqrtR_~Input Real) (v_SqrtR_~linf~0_13 Real)) (let ((.cse0 (* (/ 1.0 SqrtR_~Input) 2.0))) (let ((.cse1 (* (* 2.0 c_~_EPS~0) .cse0))) (or (<= SqrtR_~Input 1.0) (< (+ v_SqrtR_~lsup~0_13 v_SqrtR_~linf~0_13) 0.0) (not (<= v_SqrtR_~lsup~0_13 (* c_~_EPS~0 .cse0))) (< v_SqrtR_~lsup~0_13 .cse1) (< .cse1 v_SqrtR_~linf~0_13))))) (exists ((v_SqrtR_~lsup~0_12 Real) (v_SqrtR_~Input_10 Real) (v_SqrtR_~linf~0_12 Real)) (let ((.cse3 (let ((.cse4 (/ 1.0 v_SqrtR_~Input_10))) (+ .cse4 .cse4)))) (let ((.cse2 (* (* 2.0 c_~_EPS~0) .cse3))) (and (not (< .cse2 v_SqrtR_~linf~0_12)) (<= 0.0 (+ v_SqrtR_~lsup~0_12 v_SqrtR_~linf~0_12)) (not (< v_SqrtR_~lsup~0_12 .cse2)) (< 1.0 v_SqrtR_~Input_10) (<= v_SqrtR_~lsup~0_12 (* c_~_EPS~0 .cse3))))))) is different from true [2019-09-10 01:39:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:39:34,474 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:39:34,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 7] imperfect sequences [] total 10 [2019-09-10 01:39:34,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:39:34,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:39:34,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:39:34,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=12, Unknown=7, NotChecked=54, Total=90 [2019-09-10 01:39:34,477 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2019-09-10 01:39:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:34,489 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-10 01:39:34,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:39:34,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-10 01:39:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:34,491 INFO L225 Difference]: With dead ends: 27 [2019-09-10 01:39:34,491 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 01:39:34,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=12, Unknown=7, NotChecked=54, Total=90 [2019-09-10 01:39:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 01:39:34,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-09-10 01:39:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 01:39:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-10 01:39:34,497 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2019-09-10 01:39:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:34,497 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-10 01:39:34,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:39:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-10 01:39:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:39:34,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:34,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:34,499 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:34,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:34,499 INFO L82 PathProgramCache]: Analyzing trace with hash -224200478, now seen corresponding path program 1 times [2019-09-10 01:39:34,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:34,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:34,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:34,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:34,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:34,508 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:39:34,508 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:39:34,508 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 01:39:34,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:34,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:39:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:34,557 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2019-09-10 01:39:34,559 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [5], [9], [16], [18], [22], [23], [27], [35], [37], [46], [49], [51], [57], [58], [59], [61], [62], [63] [2019-09-10 01:39:34,597 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:39:34,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:39:34,671 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPLT has no precise implementation. [2019-09-10 01:39:34,672 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:39:34,792 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:39:34,795 INFO L272 AbstractInterpreter]: Visited 21 different actions 51 times. Merged at 6 different actions 22 times. Widened at 1 different actions 3 times. Performed 205 root evaluator evaluations with a maximum evaluation depth of 7. Performed 205 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 5 fixpoints after 2 different actions. Largest state had 13 variables. [2019-09-10 01:39:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:34,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:39:34,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:34,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:34,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:34,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:39:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:34,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 01:39:34,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:34,962 WARN L838 $PredicateComparison]: unable to prove that (exists ((main_~dd~0 Real)) (and (<= main_~dd~0 (/ 100000001.0 100000000.0)) (<= (/ 99999999.0 100000000.0) main_~dd~0) (= (/ 1.0 (+ (* (/ (- 1.0) 2.0) main_~dd~0) (* (/ 1.0 2.0) (to_real 1)) 1.0)) |c_main_#t~ret3|))) is different from false [2019-09-10 01:39:35,000 WARN L838 $PredicateComparison]: unable to prove that (exists ((main_~dd~0 Real)) (and (<= main_~dd~0 (/ 100000001.0 100000000.0)) (= (/ 1.0 (+ (* (/ (- 1.0) 2.0) main_~dd~0) (* (/ 1.0 2.0) (to_real 1)) 1.0)) c_main_~r~0) (<= (/ 99999999.0 100000000.0) main_~dd~0))) is different from false [2019-09-10 01:39:35,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:39:37,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:37,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:39:38,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 01:39:38,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-10 01:39:38,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:38,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 01:39:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 01:39:38,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=333, Unknown=4, NotChecked=74, Total=462 [2019-09-10 01:39:38,040 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 22 states. [2019-09-10 01:39:40,561 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((main_~dd~0 Real)) (and (<= main_~dd~0 (/ 100000001.0 100000000.0)) (<= (/ 99999999.0 100000000.0) main_~dd~0) (= (/ 1.0 (+ (* (/ (- 1.0) 2.0) main_~dd~0) (* (/ 1.0 2.0) (to_real 1)) 1.0)) |c_main_#t~ret3|))) (<= (/ 9.0 10.0) |c_main_#t~ret3|) (<= |c_main_#t~ret3| 5.0)) is different from false [2019-09-10 01:39:42,567 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((main_~dd~0 Real)) (and (<= main_~dd~0 (/ 100000001.0 100000000.0)) (= (/ 1.0 (+ (* (/ (- 1.0) 2.0) main_~dd~0) (* (/ 1.0 2.0) (to_real 1)) 1.0)) c_main_~r~0) (<= (/ 99999999.0 100000000.0) main_~dd~0))) (<= c_main_~r~0 5.0) (<= (/ 9.0 10.0) c_main_~r~0)) is different from false [2019-09-10 01:39:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:42,672 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-09-10 01:39:42,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 01:39:42,672 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-09-10 01:39:42,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:42,675 INFO L225 Difference]: With dead ends: 39 [2019-09-10 01:39:42,676 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 01:39:42,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=82, Invalid=480, Unknown=6, NotChecked=188, Total=756 [2019-09-10 01:39:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 01:39:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 01:39:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 01:39:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-09-10 01:39:42,697 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 21 [2019-09-10 01:39:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:42,698 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-09-10 01:39:42,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 01:39:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-09-10 01:39:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:39:42,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:42,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:42,703 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:42,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:42,704 INFO L82 PathProgramCache]: Analyzing trace with hash 33964960, now seen corresponding path program 1 times [2019-09-10 01:39:42,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:42,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:42,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:42,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:42,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:42,711 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:39:42,711 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:39:42,711 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:39:42,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:42,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:39:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:42,746 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2019-09-10 01:39:42,746 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [7], [9], [16], [18], [22], [23], [27], [35], [37], [46], [49], [51], [57], [58], [59], [61], [62], [63] [2019-09-10 01:39:42,749 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:39:42,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:39:42,754 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPLT has no precise implementation. [2019-09-10 01:39:42,755 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:39:42,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:39:42,834 INFO L272 AbstractInterpreter]: Visited 21 different actions 46 times. Merged at 4 different actions 20 times. Widened at 1 different actions 3 times. Performed 196 root evaluator evaluations with a maximum evaluation depth of 7. Performed 196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 6 fixpoints after 2 different actions. Largest state had 13 variables. [2019-09-10 01:39:42,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:42,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:39:42,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:42,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:39:42,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:42,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:42,885 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 01:39:42,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:43,036 WARN L838 $PredicateComparison]: unable to prove that (and (= c_SqrtR_~Input |c_SqrtR_#in~Input|) (= c_~_EPS~0 (/ 1.0 1000000.0)) (= (/ 1.0 c_SqrtR_~Input) c_SqrtR_~xn~0) (let ((.cse4 (* 2.0 c_SqrtR_~xn~0))) (let ((.cse3 (* c_~_EPS~0 .cse4)) (.cse2 (* (* 2.0 c_~_EPS~0) .cse4))) (let ((.cse0 (< .cse3 .cse2)) (.cse1 (< .cse2 (* .cse3 (- 1.0))))) (or (and (= 0 c_SqrtR_~cond~0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= 1 c_SqrtR_~cond~0)))))) (< 1.0 c_SqrtR_~Input)) is different from false [2019-09-10 01:39:43,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:43,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:43,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:43,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:43,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:43,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:43,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:43,072 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (= 0 c_SqrtR_~cond~0)) (.cse3 (= c_~_EPS~0 (/ 1.0 1000000.0))) (.cse4 (= 1 c_SqrtR_~cond~0)) (.cse5 (< 1.0 |c_SqrtR_#in~Input|))) (or (and (exists ((SqrtR_~residu~0 Real)) (let ((.cse0 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0)) (.cse2 (* 2.0 c_SqrtR_~xnp1~0))) (and (= .cse0 (/ 1.0 |c_SqrtR_#in~Input|)) (let ((.cse1 (+ (* (- 1.0) SqrtR_~residu~0) .cse2))) (< (* c_~_EPS~0 .cse1) (* (* 2.0 c_~_EPS~0) .cse1))) (= c_SqrtR_~xnp1~0 (+ .cse0 (/ (* .cse0 (+ (to_real 1) (- (* .cse0 (* .cse0 |c_SqrtR_#in~Input|))))) 2.0))) (< (* c_~_EPS~0 .cse2) SqrtR_~residu~0)))) .cse3 .cse4 .cse5) (and (exists ((SqrtR_~residu~0 Real)) (let ((.cse9 (* 2.0 c_SqrtR_~xnp1~0))) (let ((.cse7 (* c_~_EPS~0 .cse9)) (.cse6 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0))) (and (= .cse6 (/ 1.0 |c_SqrtR_#in~Input|)) (not (< (+ SqrtR_~residu~0 .cse7) 0.0)) (not (< .cse7 SqrtR_~residu~0)) (let ((.cse8 (+ (* (- 1.0) SqrtR_~residu~0) .cse9))) (< (* c_~_EPS~0 .cse8) (* (* 2.0 c_~_EPS~0) .cse8))) (= c_SqrtR_~xnp1~0 (+ .cse6 (/ (* .cse6 (+ (to_real 1) (- (* .cse6 (* .cse6 |c_SqrtR_#in~Input|))))) 2.0))))))) .cse10 .cse3 .cse5) (and (exists ((SqrtR_~residu~0 Real)) (let ((.cse14 (* 2.0 c_SqrtR_~xnp1~0))) (let ((.cse12 (* c_~_EPS~0 .cse14)) (.cse11 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0))) (and (= .cse11 (/ 1.0 |c_SqrtR_#in~Input|)) (not (< (+ SqrtR_~residu~0 .cse12) 0.0)) (not (< .cse12 SqrtR_~residu~0)) (= c_SqrtR_~xnp1~0 (+ .cse11 (/ (* .cse11 (+ (to_real 1) (- (* .cse11 (* .cse11 |c_SqrtR_#in~Input|))))) 2.0))) (let ((.cse13 (+ (* (- 1.0) SqrtR_~residu~0) .cse14))) (< (* (* 2.0 c_~_EPS~0) .cse13) (* (* c_~_EPS~0 .cse13) (- 1.0)))))))) .cse10 .cse3 .cse5) (and .cse3 .cse4 .cse5 (exists ((SqrtR_~residu~0 Real)) (let ((.cse15 (* 2.0 c_SqrtR_~xnp1~0)) (.cse16 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0))) (and (< (+ SqrtR_~residu~0 (* c_~_EPS~0 .cse15)) 0.0) (= .cse16 (/ 1.0 |c_SqrtR_#in~Input|)) (let ((.cse17 (+ (* (- 1.0) SqrtR_~residu~0) .cse15))) (< (* c_~_EPS~0 .cse17) (* (* 2.0 c_~_EPS~0) .cse17))) (= c_SqrtR_~xnp1~0 (+ .cse16 (/ (* .cse16 (+ (to_real 1) (- (* .cse16 (* .cse16 |c_SqrtR_#in~Input|))))) 2.0))))))) (and .cse3 .cse4 (exists ((SqrtR_~residu~0 Real)) (let ((.cse19 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0)) (.cse18 (* 2.0 c_SqrtR_~xnp1~0))) (and (< (+ SqrtR_~residu~0 (* c_~_EPS~0 .cse18)) 0.0) (= .cse19 (/ 1.0 |c_SqrtR_#in~Input|)) (= c_SqrtR_~xnp1~0 (+ .cse19 (/ (* .cse19 (+ (to_real 1) (- (* .cse19 (* .cse19 |c_SqrtR_#in~Input|))))) 2.0))) (let ((.cse20 (+ (* (- 1.0) SqrtR_~residu~0) .cse18))) (< (* (* 2.0 c_~_EPS~0) .cse20) (* (* c_~_EPS~0 .cse20) (- 1.0))))))) .cse5) (and .cse3 .cse4 (exists ((SqrtR_~residu~0 Real)) (let ((.cse21 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0)) (.cse23 (* 2.0 c_SqrtR_~xnp1~0))) (and (= .cse21 (/ 1.0 |c_SqrtR_#in~Input|)) (= c_SqrtR_~xnp1~0 (+ .cse21 (/ (* .cse21 (+ (to_real 1) (- (* .cse21 (* .cse21 |c_SqrtR_#in~Input|))))) 2.0))) (let ((.cse22 (+ (* (- 1.0) SqrtR_~residu~0) .cse23))) (< (* (* 2.0 c_~_EPS~0) .cse22) (* (* c_~_EPS~0 .cse22) (- 1.0)))) (< (* c_~_EPS~0 .cse23) SqrtR_~residu~0)))) .cse5))) is different from false [2019-09-10 01:39:43,088 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_~_EPS~0 (/ 1.0 1000000.0))) (.cse5 (< 1.0 |c_SqrtR_#in~Input|))) (or (and (exists ((SqrtR_~residu~0 Real)) (let ((.cse3 (* 2.0 c_SqrtR_~xnp1~0))) (let ((.cse1 (* c_~_EPS~0 .cse3)) (.cse0 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0))) (and (= .cse0 (/ 1.0 |c_SqrtR_#in~Input|)) (not (< (+ SqrtR_~residu~0 .cse1) 0.0)) (not (< .cse1 SqrtR_~residu~0)) (= c_SqrtR_~xnp1~0 (+ .cse0 (/ (* .cse0 (+ (to_real 1) (- (* .cse0 (* .cse0 |c_SqrtR_#in~Input|))))) 2.0))) (let ((.cse2 (+ (* (- 1.0) SqrtR_~residu~0) .cse3))) (< (* (* 2.0 c_~_EPS~0) .cse2) (* (* c_~_EPS~0 .cse2) (- 1.0)))))))) .cse4 .cse5) (and .cse4 (exists ((v_prenex_7 Real)) (let ((.cse9 (* 2.0 c_SqrtR_~xnp1~0))) (let ((.cse7 (+ c_SqrtR_~xnp1~0 (* (/ (- 1.0) 2.0) v_prenex_7))) (.cse6 (* c_~_EPS~0 .cse9))) (and (not (< .cse6 v_prenex_7)) (= c_SqrtR_~xnp1~0 (+ (/ (* (+ (to_real 1) (- (* .cse7 (* .cse7 |c_SqrtR_#in~Input|)))) .cse7) 2.0) .cse7)) (let ((.cse8 (+ .cse9 (* (- 1.0) v_prenex_7)))) (< (* c_~_EPS~0 .cse8) (* (* 2.0 c_~_EPS~0) .cse8))) (= .cse7 (/ 1.0 |c_SqrtR_#in~Input|)) (not (< (+ .cse6 v_prenex_7) 0.0)))))) .cse5))) is different from false [2019-09-10 01:39:43,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:43,104 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~_EPS~0 (/ 1.0 1000000.0))) (.cse5 (< 1.0 |c_SqrtR_#in~Input|))) (or (and .cse0 (exists ((SqrtR_~xnp1~0 Real) (v_prenex_7 Real)) (let ((.cse4 (* 2.0 SqrtR_~xnp1~0))) (let ((.cse2 (+ SqrtR_~xnp1~0 (* (/ (- 1.0) 2.0) v_prenex_7))) (.cse1 (* c_~_EPS~0 .cse4))) (and (not (< .cse1 v_prenex_7)) (= SqrtR_~xnp1~0 (+ (/ (* (+ (to_real 1) (- (* .cse2 (* .cse2 |c_SqrtR_#in~Input|)))) .cse2) 2.0) .cse2)) (let ((.cse3 (+ .cse4 (* (- 1.0) v_prenex_7)))) (< (* c_~_EPS~0 .cse3) (* (* 2.0 c_~_EPS~0) .cse3))) (= .cse2 (/ 1.0 |c_SqrtR_#in~Input|)) (= (/ 1.0 SqrtR_~xnp1~0) |c_SqrtR_#res|) (not (< (+ .cse1 v_prenex_7) 0.0)))))) .cse5) (and (exists ((SqrtR_~residu~0 Real) (SqrtR_~xnp1~0 Real)) (let ((.cse9 (* 2.0 SqrtR_~xnp1~0))) (let ((.cse7 (* c_~_EPS~0 .cse9)) (.cse6 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) SqrtR_~xnp1~0))) (and (= .cse6 (/ 1.0 |c_SqrtR_#in~Input|)) (not (< (+ SqrtR_~residu~0 .cse7) 0.0)) (not (< .cse7 SqrtR_~residu~0)) (= SqrtR_~xnp1~0 (+ .cse6 (/ (* .cse6 (+ (to_real 1) (- (* .cse6 (* .cse6 |c_SqrtR_#in~Input|))))) 2.0))) (= (/ 1.0 SqrtR_~xnp1~0) |c_SqrtR_#res|) (let ((.cse8 (+ (* (- 1.0) SqrtR_~residu~0) .cse9))) (< (* (* 2.0 c_~_EPS~0) .cse8) (* (* c_~_EPS~0 .cse8) (- 1.0)))))))) .cse0 .cse5))) is different from false [2019-09-10 01:39:43,118 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_~_EPS~0 (/ 1.0 1000000.0))) (.cse5 (< 1.0 |c_SqrtR_#in~Input|))) (or (and (exists ((SqrtR_~residu~0 Real) (v_prenex_8 Real)) (let ((.cse3 (* 2.0 v_prenex_8))) (let ((.cse0 (* c_~_EPS~0 .cse3)) (.cse1 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) v_prenex_8))) (and (not (< (+ SqrtR_~residu~0 .cse0) 0.0)) (= (+ .cse1 (/ (* (+ (to_real 1) (- (* .cse1 (* .cse1 |c_SqrtR_#in~Input|)))) .cse1) 2.0)) v_prenex_8) (let ((.cse2 (+ (* (- 1.0) SqrtR_~residu~0) .cse3))) (< (* (* 2.0 c_~_EPS~0) .cse2) (* (* .cse2 c_~_EPS~0) (- 1.0)))) (not (< .cse0 SqrtR_~residu~0)) (= (/ 1.0 v_prenex_8) |c_SqrtR_#res|) (= .cse1 (/ 1.0 |c_SqrtR_#in~Input|)))))) .cse4 .cse5) (and .cse4 (exists ((SqrtR_~xnp1~0 Real) (v_prenex_7 Real)) (let ((.cse9 (* 2.0 SqrtR_~xnp1~0))) (let ((.cse7 (+ SqrtR_~xnp1~0 (* (/ (- 1.0) 2.0) v_prenex_7))) (.cse6 (* c_~_EPS~0 .cse9))) (and (not (< .cse6 v_prenex_7)) (= SqrtR_~xnp1~0 (+ (/ (* (+ (to_real 1) (- (* .cse7 (* .cse7 |c_SqrtR_#in~Input|)))) .cse7) 2.0) .cse7)) (let ((.cse8 (+ .cse9 (* (- 1.0) v_prenex_7)))) (< (* c_~_EPS~0 .cse8) (* (* 2.0 c_~_EPS~0) .cse8))) (= .cse7 (/ 1.0 |c_SqrtR_#in~Input|)) (= (/ 1.0 SqrtR_~xnp1~0) |c_SqrtR_#res|) (not (< (+ .cse6 v_prenex_7) 0.0)))))) .cse5))) is different from false [2019-09-10 01:39:43,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:44,818 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((SqrtR_~residu~0 Real) (main_~dd~0 Real) (v_prenex_8 Real)) (let ((.cse0 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) v_prenex_8)) (.cse1 (* (/ 1.0 500000.0) v_prenex_8))) (and (<= main_~dd~0 (/ 100000001.0 100000000.0)) (= (+ .cse0 (/ (* .cse0 (+ (to_real 1) (- (* .cse0 (* .cse0 main_~dd~0))))) 2.0)) v_prenex_8) (<= SqrtR_~residu~0 .cse1) (< (* (/ 3.0 500000.0) v_prenex_8) (* (/ 3.0 1000000.0) SqrtR_~residu~0)) (= |c_main_#t~ret3| (/ 1.0 v_prenex_8)) (<= (/ 99999999.0 100000000.0) main_~dd~0) (= .cse0 (/ 1.0 main_~dd~0)) (<= 0.0 (+ SqrtR_~residu~0 .cse1)) (< 1.0 main_~dd~0)))) (exists ((SqrtR_~xnp1~0 Real) (main_~dd~0 Real) (v_prenex_7 Real)) (let ((.cse3 (+ SqrtR_~xnp1~0 (* (/ (- 1.0) 2.0) v_prenex_7))) (.cse2 (* (/ 1.0 500000.0) SqrtR_~xnp1~0))) (and (<= main_~dd~0 (/ 100000001.0 100000000.0)) (<= v_prenex_7 .cse2) (= .cse3 (/ 1.0 main_~dd~0)) (= SqrtR_~xnp1~0 (+ .cse3 (/ (* .cse3 (+ (to_real 1) (- (* .cse3 (* .cse3 main_~dd~0))))) 2.0))) (<= (/ 99999999.0 100000000.0) main_~dd~0) (= (/ 1.0 SqrtR_~xnp1~0) |c_main_#t~ret3|) (< (* (/ 1.0 1000000.0) v_prenex_7) .cse2) (< 1.0 main_~dd~0) (<= 0.0 (+ .cse2 v_prenex_7)))))) is different from false [2019-09-10 01:39:46,540 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((SqrtR_~xnp1~0 Real) (v_prenex_7 Real) (v_prenex_9 Real)) (let ((.cse0 (+ SqrtR_~xnp1~0 (* (/ (- 1.0) 2.0) v_prenex_7))) (.cse1 (* (/ 1.0 500000.0) SqrtR_~xnp1~0))) (and (= SqrtR_~xnp1~0 (+ (/ (* (+ (- (* .cse0 (* .cse0 v_prenex_9))) (to_real 1)) .cse0) 2.0) .cse0)) (<= (/ 99999999.0 100000000.0) v_prenex_9) (= (/ 1.0 SqrtR_~xnp1~0) c_main_~r~0) (<= v_prenex_7 .cse1) (< 1.0 v_prenex_9) (= .cse0 (/ 1.0 v_prenex_9)) (< (* (/ 1.0 1000000.0) v_prenex_7) .cse1) (<= v_prenex_9 (/ 100000001.0 100000000.0)) (<= 0.0 (+ .cse1 v_prenex_7))))) (exists ((SqrtR_~residu~0 Real) (main_~dd~0 Real) (v_prenex_8 Real)) (let ((.cse2 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) v_prenex_8)) (.cse3 (* (/ 1.0 500000.0) v_prenex_8))) (and (<= main_~dd~0 (/ 100000001.0 100000000.0)) (= (+ .cse2 (/ (* .cse2 (+ (to_real 1) (- (* .cse2 (* .cse2 main_~dd~0))))) 2.0)) v_prenex_8) (<= SqrtR_~residu~0 .cse3) (< (* (/ 3.0 500000.0) v_prenex_8) (* (/ 3.0 1000000.0) SqrtR_~residu~0)) (= c_main_~r~0 (/ 1.0 v_prenex_8)) (<= (/ 99999999.0 100000000.0) main_~dd~0) (= .cse2 (/ 1.0 main_~dd~0)) (<= 0.0 (+ SqrtR_~residu~0 .cse3)) (< 1.0 main_~dd~0))))) is different from false [2019-09-10 01:39:46,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-09-10 01:39:46,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:51,553 WARN L188 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-10 01:39:56,071 WARN L188 SmtUtils]: Spent 4.52 s on a formula simplification that was a NOOP. DAG size: 47 [2019-09-10 01:40:00,237 WARN L188 SmtUtils]: Spent 4.16 s on a formula simplification that was a NOOP. DAG size: 51 [2019-09-10 01:40:04,502 WARN L188 SmtUtils]: Spent 4.26 s on a formula simplification that was a NOOP. DAG size: 51 [2019-09-10 01:40:04,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:04,521 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (<= c_main_~dd~0 1.0))) (and (or (forall ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse0 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse1 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (or (< (+ v_SqrtR_~residu~0_27 .cse0) 0.0) (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32)) (not (= .cse1 (/ 1.0 c_main_~dd~0))) (< .cse0 v_SqrtR_~residu~0_27) (not (= v_SqrtR_~xn~0_32 (+ .cse1 (/ (* .cse1 (+ (to_real 1) (- (* (* .cse1 c_main_~dd~0) .cse1)))) 2.0))))))) .cse2) (or (forall ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse3 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse4 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (or (< (+ v_SqrtR_~residu~0_27 .cse3) 0.0) (not (= .cse4 (/ 1.0 c_main_~dd~0))) (< .cse3 v_SqrtR_~residu~0_27) (not (= v_SqrtR_~xn~0_32 (+ .cse4 (/ (* .cse4 (+ (to_real 1) (- (* (* .cse4 c_main_~dd~0) .cse4)))) 2.0)))) (<= (/ 1.0 v_SqrtR_~xn~0_32) 5.0)))) .cse2))) is different from true [2019-09-10 01:40:04,642 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (< 1.0 |c_SqrtR_#in~Input|))) (or (let ((.cse0 (/ 1.0 c_SqrtR_~xnp1~0))) (and (<= .cse0 5.0) (<= (/ 9.0 10.0) .cse0))) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse2 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse1 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse1 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse2 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse2 (/ (* .cse2 (+ (to_real 1) (- (* .cse2 (* .cse2 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse1 v_prenex_10) 0.0))))) .cse3) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse5 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse4 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse4 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse5 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse5) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse4 (/ (* .cse4 (+ (to_real 1) (- (* (* .cse4 |c_SqrtR_#in~Input|) .cse4)))) 2.0)))))) .cse3))) is different from false [2019-09-10 01:40:04,653 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (< 1.0 |c_SqrtR_#in~Input|))) (or (let ((.cse0 (/ 1.0 c_SqrtR_~xnp1~0))) (and (<= .cse0 5.0) (<= (/ 9.0 10.0) .cse0))) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse2 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse1 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse1 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse2 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse2 (/ (* .cse2 (+ (to_real 1) (- (* .cse2 (* .cse2 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse1 v_prenex_10) 0.0))))) .cse3) (not (= 0 c_SqrtR_~cond~0)) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse5 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse4 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse4 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse5 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse5) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse4 (/ (* .cse4 (+ (to_real 1) (- (* (* .cse4 |c_SqrtR_#in~Input|) .cse4)))) 2.0)))))) .cse3))) is different from false [2019-09-10 01:40:04,665 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_SqrtR_~xn~0 (/ (* c_SqrtR_~xn~0 (+ (to_real 1) (- (* c_SqrtR_~xn~0 (* c_SqrtR_~xn~0 c_SqrtR_~Input))))) 2.0)))) (let ((.cse3 (* (+ .cse1 .cse1) c_~_EPS~0)) (.cse2 (+ (* 2.0 .cse1) (* (- 2.0) c_SqrtR_~xn~0))) (.cse6 (< 1.0 |c_SqrtR_#in~Input|))) (or (let ((.cse0 (/ 1.0 .cse1))) (and (<= (/ 9.0 10.0) .cse0) (<= .cse0 5.0))) (< .cse2 (* (- 1.0) .cse3)) (= 0 c_SqrtR_~cond~0) (< .cse3 .cse2) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse5 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse4 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse4 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse5 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse5 (/ (* .cse5 (+ (to_real 1) (- (* .cse5 (* .cse5 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse4 v_prenex_10) 0.0))))) .cse6) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse8 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse7 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse7 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse8 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse8) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse7 (/ (* .cse7 (+ (to_real 1) (- (* (* .cse7 |c_SqrtR_#in~Input|) .cse7)))) 2.0)))))) .cse6)))) is different from false [2019-09-10 01:40:04,670 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_SqrtR_~xn~0 (/ (* c_SqrtR_~xn~0 (+ (to_real 1) (- (* c_SqrtR_~xn~0 (* c_SqrtR_~xn~0 c_SqrtR_~Input))))) 2.0)))) (let ((.cse3 (* (+ .cse1 .cse1) c_~_EPS~0)) (.cse2 (+ (* 2.0 .cse1) (* (- 2.0) c_SqrtR_~xn~0))) (.cse6 (< 1.0 |c_SqrtR_#in~Input|))) (or (let ((.cse0 (/ 1.0 .cse1))) (and (<= (/ 9.0 10.0) .cse0) (<= .cse0 5.0))) (< .cse2 (* (- 1.0) .cse3)) (= 0 c_SqrtR_~cond~0) (< .cse3 .cse2) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse5 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse4 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse4 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse5 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse5 (/ (* .cse5 (+ (to_real 1) (- (* .cse5 (* .cse5 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse4 v_prenex_10) 0.0))))) .cse6) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse8 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse7 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse7 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse8 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse8) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse7 (/ (* .cse7 (+ (to_real 1) (- (* (* .cse7 |c_SqrtR_#in~Input|) .cse7)))) 2.0)))))) .cse6)))) is different from true [2019-09-10 01:40:04,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:04,680 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_SqrtR_~xn~0 (/ (* c_SqrtR_~xn~0 (+ (to_real 1) (- (* c_SqrtR_~xn~0 (* c_SqrtR_~xn~0 c_SqrtR_~Input))))) 2.0)))) (let ((.cse3 (* (+ .cse1 .cse1) c_~_EPS~0)) (.cse2 (+ (* 2.0 .cse1) (* (- 2.0) c_SqrtR_~xn~0))) (.cse9 (< 1.0 |c_SqrtR_#in~Input|))) (or (let ((.cse0 (/ 1.0 .cse1))) (and (<= (/ 9.0 10.0) .cse0) (<= .cse0 5.0))) (< .cse2 (* (- 1.0) .cse3)) (let ((.cse6 (* 2.0 c_SqrtR_~xn~0))) (let ((.cse5 (* (* 2.0 c_~_EPS~0) .cse6)) (.cse4 (* c_~_EPS~0 .cse6))) (and (not (< .cse4 .cse5)) (not (< .cse5 (* .cse4 (- 1.0))))))) (< .cse3 .cse2) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse8 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse7 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse7 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse8 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse8 (/ (* .cse8 (+ (to_real 1) (- (* .cse8 (* .cse8 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse7 v_prenex_10) 0.0))))) .cse9) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse11 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse10 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse10 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse11 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse11) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse10 (/ (* .cse10 (+ (to_real 1) (- (* (* .cse10 |c_SqrtR_#in~Input|) .cse10)))) 2.0)))))) .cse9)))) is different from false [2019-09-10 01:40:04,685 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_SqrtR_~xn~0 (/ (* c_SqrtR_~xn~0 (+ (to_real 1) (- (* c_SqrtR_~xn~0 (* c_SqrtR_~xn~0 c_SqrtR_~Input))))) 2.0)))) (let ((.cse3 (* (+ .cse1 .cse1) c_~_EPS~0)) (.cse2 (+ (* 2.0 .cse1) (* (- 2.0) c_SqrtR_~xn~0))) (.cse9 (< 1.0 |c_SqrtR_#in~Input|))) (or (let ((.cse0 (/ 1.0 .cse1))) (and (<= (/ 9.0 10.0) .cse0) (<= .cse0 5.0))) (< .cse2 (* (- 1.0) .cse3)) (let ((.cse6 (* 2.0 c_SqrtR_~xn~0))) (let ((.cse5 (* (* 2.0 c_~_EPS~0) .cse6)) (.cse4 (* c_~_EPS~0 .cse6))) (and (not (< .cse4 .cse5)) (not (< .cse5 (* .cse4 (- 1.0))))))) (< .cse3 .cse2) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse8 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse7 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse7 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse8 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse8 (/ (* .cse8 (+ (to_real 1) (- (* .cse8 (* .cse8 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse7 v_prenex_10) 0.0))))) .cse9) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse11 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse10 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse10 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse11 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse11) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse10 (/ (* .cse10 (+ (to_real 1) (- (* (* .cse10 |c_SqrtR_#in~Input|) .cse10)))) 2.0)))))) .cse9)))) is different from true [2019-09-10 01:40:04,695 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (/ 1.0 c_SqrtR_~Input))) (let ((.cse10 (+ .cse3 (/ (* (+ (to_real 1) (- (* .cse3 (* .cse3 c_SqrtR_~Input)))) .cse3) 2.0)))) (let ((.cse5 (* c_~_EPS~0 (+ .cse10 .cse10))) (.cse4 (+ (* .cse3 (- 2.0)) (* .cse10 2.0))) (.cse8 (< 1.0 |c_SqrtR_#in~Input|))) (or (let ((.cse2 (* .cse3 2.0))) (let ((.cse1 (* c_~_EPS~0 .cse2)) (.cse0 (* (* 2.0 c_~_EPS~0) .cse2))) (and (not (< .cse0 (* (- 1.0) .cse1))) (not (< .cse1 .cse0))))) (<= c_SqrtR_~Input 1.0) (< .cse4 (* .cse5 (- 1.0))) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse7 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse6 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse6 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse7 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse7 (/ (* .cse7 (+ (to_real 1) (- (* .cse7 (* .cse7 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse6 v_prenex_10) 0.0))))) .cse8) (< .cse5 .cse4) (let ((.cse9 (/ 1.0 .cse10))) (and (<= .cse9 5.0) (<= (/ 9.0 10.0) .cse9))) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse12 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse11 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse11 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse12 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse12) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse11 (/ (* .cse11 (+ (to_real 1) (- (* (* .cse11 |c_SqrtR_#in~Input|) .cse11)))) 2.0)))))) .cse8))))) is different from false [2019-09-10 01:40:04,704 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (/ 1.0 c_SqrtR_~Input))) (let ((.cse10 (+ .cse3 (/ (* (+ (to_real 1) (- (* .cse3 (* .cse3 c_SqrtR_~Input)))) .cse3) 2.0)))) (let ((.cse5 (* c_~_EPS~0 (+ .cse10 .cse10))) (.cse4 (+ (* .cse3 (- 2.0)) (* .cse10 2.0))) (.cse8 (< 1.0 |c_SqrtR_#in~Input|))) (or (let ((.cse2 (* .cse3 2.0))) (let ((.cse1 (* c_~_EPS~0 .cse2)) (.cse0 (* (* 2.0 c_~_EPS~0) .cse2))) (and (not (< .cse0 (* (- 1.0) .cse1))) (not (< .cse1 .cse0))))) (<= c_SqrtR_~Input 1.0) (< .cse4 (* .cse5 (- 1.0))) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse7 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse6 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse6 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse7 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse7 (/ (* .cse7 (+ (to_real 1) (- (* .cse7 (* .cse7 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse6 v_prenex_10) 0.0))))) .cse8) (< .cse5 .cse4) (let ((.cse9 (/ 1.0 .cse10))) (and (<= .cse9 5.0) (<= (/ 9.0 10.0) .cse9))) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse12 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse11 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse11 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse12 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse12) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse11 (/ (* .cse11 (+ (to_real 1) (- (* (* .cse11 |c_SqrtR_#in~Input|) .cse11)))) 2.0)))))) .cse8))))) is different from true [2019-09-10 01:40:04,713 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (/ 1.0 |c_SqrtR_#in~Input|))) (let ((.cse3 (+ (/ (* .cse10 (+ (to_real 1) (- (* .cse10 (* .cse10 |c_SqrtR_#in~Input|))))) 2.0) .cse10))) (let ((.cse1 (* c_~_EPS~0 (+ .cse3 .cse3))) (.cse0 (+ (* .cse10 (- 2.0)) (* .cse3 2.0))) (.cse6 (< 1.0 |c_SqrtR_#in~Input|))) (or (< .cse0 (* .cse1 (- 1.0))) (let ((.cse2 (/ 1.0 .cse3))) (and (<= .cse2 5.0) (<= (/ 9.0 10.0) .cse2))) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse5 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse4 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse4 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse5 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse5 (/ (* .cse5 (+ (to_real 1) (- (* .cse5 (* .cse5 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse4 v_prenex_10) 0.0))))) .cse6) (< .cse1 .cse0) (let ((.cse9 (* .cse10 2.0))) (let ((.cse8 (* (* 2.0 c_~_EPS~0) .cse9)) (.cse7 (* c_~_EPS~0 .cse9))) (and (not (< .cse7 .cse8)) (not (< .cse8 (* .cse7 (- 1.0))))))) (<= |c_SqrtR_#in~Input| 1.0) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse12 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse11 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse11 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse12 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse12) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse11 (/ (* .cse11 (+ (to_real 1) (- (* (* .cse11 |c_SqrtR_#in~Input|) .cse11)))) 2.0)))))) .cse6))))) is different from false [2019-09-10 01:40:04,727 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (/ 1.0 |c_SqrtR_#in~Input|))) (let ((.cse3 (+ (/ (* .cse10 (+ (to_real 1) (- (* .cse10 (* .cse10 |c_SqrtR_#in~Input|))))) 2.0) .cse10))) (let ((.cse1 (* c_~_EPS~0 (+ .cse3 .cse3))) (.cse0 (+ (* .cse10 (- 2.0)) (* .cse3 2.0))) (.cse6 (< 1.0 |c_SqrtR_#in~Input|))) (or (< .cse0 (* .cse1 (- 1.0))) (let ((.cse2 (/ 1.0 .cse3))) (and (<= .cse2 5.0) (<= (/ 9.0 10.0) .cse2))) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse5 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse4 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse4 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse5 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse5 (/ (* .cse5 (+ (to_real 1) (- (* .cse5 (* .cse5 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse4 v_prenex_10) 0.0))))) .cse6) (< .cse1 .cse0) (let ((.cse9 (* .cse10 2.0))) (let ((.cse8 (* (* 2.0 c_~_EPS~0) .cse9)) (.cse7 (* c_~_EPS~0 .cse9))) (and (not (< .cse7 .cse8)) (not (< .cse8 (* .cse7 (- 1.0))))))) (<= |c_SqrtR_#in~Input| 1.0) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse12 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse11 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse11 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse12 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse12) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse11 (/ (* .cse11 (+ (to_real 1) (- (* (* .cse11 |c_SqrtR_#in~Input|) .cse11)))) 2.0)))))) .cse6))))) is different from true [2019-09-10 01:40:04,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:04,742 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_13 Real) (v_prenex_12 Real) (v_main_~dd~0_13 Real)) (let ((.cse0 (+ v_prenex_13 (* (/ (- 1.0) 2.0) v_prenex_12))) (.cse1 (* c_~_EPS~0 (* 2.0 v_prenex_13)))) (or (not (= (+ (/ (* (+ (to_real 1) (- (* (* .cse0 v_main_~dd~0_13) .cse0))) .cse0) 2.0) .cse0) v_prenex_13)) (<= v_main_~dd~0_13 1.0) (< (+ c_main_~epsilon~0 v_main_~dd~0_13) c_main_~d~0) (not (= .cse0 (/ 1.0 v_main_~dd~0_13))) (< (+ .cse1 v_prenex_12) 0.0) (< .cse1 v_prenex_12) (< (+ c_main_~epsilon~0 c_main_~d~0) v_main_~dd~0_13) (<= (/ 9.0 10.0) (/ 1.0 v_prenex_13))))) (forall ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real) (v_main_~dd~0_13 Real)) (let ((.cse2 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse3 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (or (< (+ v_SqrtR_~residu~0_27 .cse2) 0.0) (<= v_main_~dd~0_13 1.0) (< (+ c_main_~epsilon~0 v_main_~dd~0_13) c_main_~d~0) (< .cse2 v_SqrtR_~residu~0_27) (< (+ c_main_~epsilon~0 c_main_~d~0) v_main_~dd~0_13) (<= (/ 1.0 v_SqrtR_~xn~0_32) 5.0) (not (= .cse3 (/ 1.0 v_main_~dd~0_13))) (not (= v_SqrtR_~xn~0_32 (+ .cse3 (/ (* .cse3 (+ (to_real 1) (- (* (* .cse3 v_main_~dd~0_13) .cse3)))) 2.0)))))))) is different from true [2019-09-10 01:40:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-09-10 01:40:04,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 01:40:04,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2019-09-10 01:40:04,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:40:04,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 01:40:04,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 01:40:04,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=32, NotChecked=570, Total=812 [2019-09-10 01:40:04,777 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 29 states. [2019-09-10 01:40:04,908 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~_EPS~0 (/ 1.0 1000000.0)) (let ((.cse10 (/ 1.0 |c_SqrtR_#in~Input|))) (let ((.cse3 (+ (/ (* .cse10 (+ (to_real 1) (- (* .cse10 (* .cse10 |c_SqrtR_#in~Input|))))) 2.0) .cse10))) (let ((.cse1 (* c_~_EPS~0 (+ .cse3 .cse3))) (.cse0 (+ (* .cse10 (- 2.0)) (* .cse3 2.0))) (.cse6 (< 1.0 |c_SqrtR_#in~Input|))) (or (< .cse0 (* .cse1 (- 1.0))) (let ((.cse2 (/ 1.0 .cse3))) (and (<= .cse2 5.0) (<= (/ 9.0 10.0) .cse2))) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse5 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse4 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse4 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse5 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse5 (/ (* .cse5 (+ (to_real 1) (- (* .cse5 (* .cse5 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse4 v_prenex_10) 0.0))))) .cse6) (< .cse1 .cse0) (let ((.cse9 (* .cse10 2.0))) (let ((.cse8 (* (* 2.0 c_~_EPS~0) .cse9)) (.cse7 (* c_~_EPS~0 .cse9))) (and (not (< .cse7 .cse8)) (not (< .cse8 (* .cse7 (- 1.0))))))) (<= |c_SqrtR_#in~Input| 1.0) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse12 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse11 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse11 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse12 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse12) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse11 (/ (* .cse11 (+ (to_real 1) (- (* (* .cse11 |c_SqrtR_#in~Input|) .cse11)))) 2.0)))))) .cse6)))))) is different from false [2019-09-10 01:40:04,919 WARN L838 $PredicateComparison]: unable to prove that (and (= c_SqrtR_~Input |c_SqrtR_#in~Input|) (= c_~_EPS~0 (/ 1.0 1000000.0)) (let ((.cse3 (/ 1.0 c_SqrtR_~Input))) (let ((.cse10 (+ .cse3 (/ (* (+ (to_real 1) (- (* .cse3 (* .cse3 c_SqrtR_~Input)))) .cse3) 2.0)))) (let ((.cse5 (* c_~_EPS~0 (+ .cse10 .cse10))) (.cse4 (+ (* .cse3 (- 2.0)) (* .cse10 2.0))) (.cse8 (< 1.0 |c_SqrtR_#in~Input|))) (or (let ((.cse2 (* .cse3 2.0))) (let ((.cse1 (* c_~_EPS~0 .cse2)) (.cse0 (* (* 2.0 c_~_EPS~0) .cse2))) (and (not (< .cse0 (* (- 1.0) .cse1))) (not (< .cse1 .cse0))))) (<= c_SqrtR_~Input 1.0) (< .cse4 (* .cse5 (- 1.0))) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse7 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse6 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse6 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse7 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse7 (/ (* .cse7 (+ (to_real 1) (- (* .cse7 (* .cse7 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse6 v_prenex_10) 0.0))))) .cse8) (< .cse5 .cse4) (let ((.cse9 (/ 1.0 .cse10))) (and (<= .cse9 5.0) (<= (/ 9.0 10.0) .cse9))) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse12 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse11 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse11 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse12 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse12) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse11 (/ (* .cse11 (+ (to_real 1) (- (* (* .cse11 |c_SqrtR_#in~Input|) .cse11)))) 2.0)))))) .cse8)))))) is different from false [2019-09-10 01:40:04,932 WARN L838 $PredicateComparison]: unable to prove that (and (= c_SqrtR_~Input |c_SqrtR_#in~Input|) (let ((.cse1 (+ c_SqrtR_~xn~0 (/ (* c_SqrtR_~xn~0 (+ (to_real 1) (- (* c_SqrtR_~xn~0 (* c_SqrtR_~xn~0 c_SqrtR_~Input))))) 2.0)))) (let ((.cse3 (* (+ .cse1 .cse1) c_~_EPS~0)) (.cse2 (+ (* 2.0 .cse1) (* (- 2.0) c_SqrtR_~xn~0))) (.cse9 (< 1.0 |c_SqrtR_#in~Input|))) (or (let ((.cse0 (/ 1.0 .cse1))) (and (<= (/ 9.0 10.0) .cse0) (<= .cse0 5.0))) (< .cse2 (* (- 1.0) .cse3)) (let ((.cse6 (* 2.0 c_SqrtR_~xn~0))) (let ((.cse5 (* (* 2.0 c_~_EPS~0) .cse6)) (.cse4 (* c_~_EPS~0 .cse6))) (and (not (< .cse4 .cse5)) (not (< .cse5 (* .cse4 (- 1.0))))))) (< .cse3 .cse2) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse8 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse7 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse7 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse8 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse8 (/ (* .cse8 (+ (to_real 1) (- (* .cse8 (* .cse8 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse7 v_prenex_10) 0.0))))) .cse9) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse11 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse10 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse10 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse11 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse11) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse10 (/ (* .cse10 (+ (to_real 1) (- (* (* .cse10 |c_SqrtR_#in~Input|) .cse10)))) 2.0)))))) .cse9)))) (= c_~_EPS~0 (/ 1.0 1000000.0)) (= (/ 1.0 c_SqrtR_~Input) c_SqrtR_~xn~0) (< 1.0 c_SqrtR_~Input)) is different from false [2019-09-10 01:40:04,949 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= 0 c_SqrtR_~cond~0))) (and (= c_SqrtR_~Input |c_SqrtR_#in~Input|) (let ((.cse1 (+ c_SqrtR_~xn~0 (/ (* c_SqrtR_~xn~0 (+ (to_real 1) (- (* c_SqrtR_~xn~0 (* c_SqrtR_~xn~0 c_SqrtR_~Input))))) 2.0)))) (let ((.cse3 (* (+ .cse1 .cse1) c_~_EPS~0)) (.cse2 (+ (* 2.0 .cse1) (* (- 2.0) c_SqrtR_~xn~0))) (.cse7 (< 1.0 |c_SqrtR_#in~Input|))) (or (let ((.cse0 (/ 1.0 .cse1))) (and (<= (/ 9.0 10.0) .cse0) (<= .cse0 5.0))) (< .cse2 (* (- 1.0) .cse3)) .cse4 (< .cse3 .cse2) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse6 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse5 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse5 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse6 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse6 (/ (* .cse6 (+ (to_real 1) (- (* .cse6 (* .cse6 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse5 v_prenex_10) 0.0))))) .cse7) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse9 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse8 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse8 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse9 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse9) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse8 (/ (* .cse8 (+ (to_real 1) (- (* (* .cse8 |c_SqrtR_#in~Input|) .cse8)))) 2.0)))))) .cse7)))) (= c_~_EPS~0 (/ 1.0 1000000.0)) (= (/ 1.0 c_SqrtR_~Input) c_SqrtR_~xn~0) (let ((.cse14 (* 2.0 c_SqrtR_~xn~0))) (let ((.cse13 (* c_~_EPS~0 .cse14)) (.cse12 (* (* 2.0 c_~_EPS~0) .cse14))) (let ((.cse10 (< .cse13 .cse12)) (.cse11 (< .cse12 (* .cse13 (- 1.0))))) (or (and .cse4 (not .cse10) (not .cse11)) (and (or .cse10 .cse11) (= 1 c_SqrtR_~cond~0)))))) (< 1.0 c_SqrtR_~Input))) is different from false [2019-09-10 01:40:04,974 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= 0 c_SqrtR_~cond~0)) (.cse3 (< 1.0 |c_SqrtR_#in~Input|))) (and (or (let ((.cse0 (/ 1.0 c_SqrtR_~xnp1~0))) (and (<= .cse0 5.0) (<= (/ 9.0 10.0) .cse0))) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse2 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse1 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse1 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse2 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse2 (/ (* .cse2 (+ (to_real 1) (- (* .cse2 (* .cse2 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse1 v_prenex_10) 0.0))))) .cse3) (not .cse4) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse6 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse5 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse5 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse6 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse6) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse5 (/ (* .cse5 (+ (to_real 1) (- (* (* .cse5 |c_SqrtR_#in~Input|) .cse5)))) 2.0)))))) .cse3)) (let ((.cse10 (= c_~_EPS~0 (/ 1.0 1000000.0))) (.cse11 (= 1 c_SqrtR_~cond~0))) (or (and (exists ((SqrtR_~residu~0 Real)) (let ((.cse7 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0)) (.cse9 (* 2.0 c_SqrtR_~xnp1~0))) (and (= .cse7 (/ 1.0 |c_SqrtR_#in~Input|)) (let ((.cse8 (+ (* (- 1.0) SqrtR_~residu~0) .cse9))) (< (* c_~_EPS~0 .cse8) (* (* 2.0 c_~_EPS~0) .cse8))) (= c_SqrtR_~xnp1~0 (+ .cse7 (/ (* .cse7 (+ (to_real 1) (- (* .cse7 (* .cse7 |c_SqrtR_#in~Input|))))) 2.0))) (< (* c_~_EPS~0 .cse9) SqrtR_~residu~0)))) .cse10 .cse11 .cse3) (and (exists ((SqrtR_~residu~0 Real)) (let ((.cse15 (* 2.0 c_SqrtR_~xnp1~0))) (let ((.cse13 (* c_~_EPS~0 .cse15)) (.cse12 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0))) (and (= .cse12 (/ 1.0 |c_SqrtR_#in~Input|)) (not (< (+ SqrtR_~residu~0 .cse13) 0.0)) (not (< .cse13 SqrtR_~residu~0)) (let ((.cse14 (+ (* (- 1.0) SqrtR_~residu~0) .cse15))) (< (* c_~_EPS~0 .cse14) (* (* 2.0 c_~_EPS~0) .cse14))) (= c_SqrtR_~xnp1~0 (+ .cse12 (/ (* .cse12 (+ (to_real 1) (- (* .cse12 (* .cse12 |c_SqrtR_#in~Input|))))) 2.0))))))) .cse4 .cse10 .cse3) (and (exists ((SqrtR_~residu~0 Real)) (let ((.cse19 (* 2.0 c_SqrtR_~xnp1~0))) (let ((.cse17 (* c_~_EPS~0 .cse19)) (.cse16 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0))) (and (= .cse16 (/ 1.0 |c_SqrtR_#in~Input|)) (not (< (+ SqrtR_~residu~0 .cse17) 0.0)) (not (< .cse17 SqrtR_~residu~0)) (= c_SqrtR_~xnp1~0 (+ .cse16 (/ (* .cse16 (+ (to_real 1) (- (* .cse16 (* .cse16 |c_SqrtR_#in~Input|))))) 2.0))) (let ((.cse18 (+ (* (- 1.0) SqrtR_~residu~0) .cse19))) (< (* (* 2.0 c_~_EPS~0) .cse18) (* (* c_~_EPS~0 .cse18) (- 1.0)))))))) .cse4 .cse10 .cse3) (and .cse10 .cse11 .cse3 (exists ((SqrtR_~residu~0 Real)) (let ((.cse20 (* 2.0 c_SqrtR_~xnp1~0)) (.cse21 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0))) (and (< (+ SqrtR_~residu~0 (* c_~_EPS~0 .cse20)) 0.0) (= .cse21 (/ 1.0 |c_SqrtR_#in~Input|)) (let ((.cse22 (+ (* (- 1.0) SqrtR_~residu~0) .cse20))) (< (* c_~_EPS~0 .cse22) (* (* 2.0 c_~_EPS~0) .cse22))) (= c_SqrtR_~xnp1~0 (+ .cse21 (/ (* .cse21 (+ (to_real 1) (- (* .cse21 (* .cse21 |c_SqrtR_#in~Input|))))) 2.0))))))) (and .cse10 .cse11 (exists ((SqrtR_~residu~0 Real)) (let ((.cse24 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0)) (.cse23 (* 2.0 c_SqrtR_~xnp1~0))) (and (< (+ SqrtR_~residu~0 (* c_~_EPS~0 .cse23)) 0.0) (= .cse24 (/ 1.0 |c_SqrtR_#in~Input|)) (= c_SqrtR_~xnp1~0 (+ .cse24 (/ (* .cse24 (+ (to_real 1) (- (* .cse24 (* .cse24 |c_SqrtR_#in~Input|))))) 2.0))) (let ((.cse25 (+ (* (- 1.0) SqrtR_~residu~0) .cse23))) (< (* (* 2.0 c_~_EPS~0) .cse25) (* (* c_~_EPS~0 .cse25) (- 1.0))))))) .cse3) (and .cse10 .cse11 (exists ((SqrtR_~residu~0 Real)) (let ((.cse26 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0)) (.cse28 (* 2.0 c_SqrtR_~xnp1~0))) (and (= .cse26 (/ 1.0 |c_SqrtR_#in~Input|)) (= c_SqrtR_~xnp1~0 (+ .cse26 (/ (* .cse26 (+ (to_real 1) (- (* .cse26 (* .cse26 |c_SqrtR_#in~Input|))))) 2.0))) (let ((.cse27 (+ (* (- 1.0) SqrtR_~residu~0) .cse28))) (< (* (* 2.0 c_~_EPS~0) .cse27) (* (* c_~_EPS~0 .cse27) (- 1.0)))) (< (* c_~_EPS~0 .cse28) SqrtR_~residu~0)))) .cse3))))) is different from false [2019-09-10 01:40:05,010 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (< 1.0 |c_SqrtR_#in~Input|))) (and (let ((.cse4 (= c_~_EPS~0 (/ 1.0 1000000.0)))) (or (and (exists ((SqrtR_~residu~0 Real)) (let ((.cse3 (* 2.0 c_SqrtR_~xnp1~0))) (let ((.cse1 (* c_~_EPS~0 .cse3)) (.cse0 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) c_SqrtR_~xnp1~0))) (and (= .cse0 (/ 1.0 |c_SqrtR_#in~Input|)) (not (< (+ SqrtR_~residu~0 .cse1) 0.0)) (not (< .cse1 SqrtR_~residu~0)) (= c_SqrtR_~xnp1~0 (+ .cse0 (/ (* .cse0 (+ (to_real 1) (- (* .cse0 (* .cse0 |c_SqrtR_#in~Input|))))) 2.0))) (let ((.cse2 (+ (* (- 1.0) SqrtR_~residu~0) .cse3))) (< (* (* 2.0 c_~_EPS~0) .cse2) (* (* c_~_EPS~0 .cse2) (- 1.0)))))))) .cse4 .cse5) (and .cse4 (exists ((v_prenex_7 Real)) (let ((.cse9 (* 2.0 c_SqrtR_~xnp1~0))) (let ((.cse7 (+ c_SqrtR_~xnp1~0 (* (/ (- 1.0) 2.0) v_prenex_7))) (.cse6 (* c_~_EPS~0 .cse9))) (and (not (< .cse6 v_prenex_7)) (= c_SqrtR_~xnp1~0 (+ (/ (* (+ (to_real 1) (- (* .cse7 (* .cse7 |c_SqrtR_#in~Input|)))) .cse7) 2.0) .cse7)) (let ((.cse8 (+ .cse9 (* (- 1.0) v_prenex_7)))) (< (* c_~_EPS~0 .cse8) (* (* 2.0 c_~_EPS~0) .cse8))) (= .cse7 (/ 1.0 |c_SqrtR_#in~Input|)) (not (< (+ .cse6 v_prenex_7) 0.0)))))) .cse5))) (or (let ((.cse10 (/ 1.0 c_SqrtR_~xnp1~0))) (and (<= .cse10 5.0) (<= (/ 9.0 10.0) .cse10))) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse12 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse11 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse11 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse12 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse12 (/ (* .cse12 (+ (to_real 1) (- (* .cse12 (* .cse12 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse11 v_prenex_10) 0.0))))) .cse5) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse14 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse13 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse13 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse14 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse14) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse13 (/ (* .cse13 (+ (to_real 1) (- (* (* .cse13 |c_SqrtR_#in~Input|) .cse13)))) 2.0)))))) .cse5)))) is different from false [2019-09-10 01:40:05,038 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< 1.0 |c_SqrtR_#in~Input|))) (and (or (and (<= |c_SqrtR_#res| 5.0) (<= (/ 9.0 10.0) |c_SqrtR_#res|)) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse1 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse0 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse0 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse1 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse1 (/ (* .cse1 (+ (to_real 1) (- (* .cse1 (* .cse1 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse0 v_prenex_10) 0.0))))) .cse2) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse4 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse3 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse3 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse4 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse4) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse3 (/ (* .cse3 (+ (to_real 1) (- (* (* .cse3 |c_SqrtR_#in~Input|) .cse3)))) 2.0)))))) .cse2)) (let ((.cse5 (= c_~_EPS~0 (/ 1.0 1000000.0)))) (or (and .cse5 (exists ((SqrtR_~xnp1~0 Real) (v_prenex_7 Real)) (let ((.cse9 (* 2.0 SqrtR_~xnp1~0))) (let ((.cse7 (+ SqrtR_~xnp1~0 (* (/ (- 1.0) 2.0) v_prenex_7))) (.cse6 (* c_~_EPS~0 .cse9))) (and (not (< .cse6 v_prenex_7)) (= SqrtR_~xnp1~0 (+ (/ (* (+ (to_real 1) (- (* .cse7 (* .cse7 |c_SqrtR_#in~Input|)))) .cse7) 2.0) .cse7)) (let ((.cse8 (+ .cse9 (* (- 1.0) v_prenex_7)))) (< (* c_~_EPS~0 .cse8) (* (* 2.0 c_~_EPS~0) .cse8))) (= .cse7 (/ 1.0 |c_SqrtR_#in~Input|)) (= (/ 1.0 SqrtR_~xnp1~0) |c_SqrtR_#res|) (not (< (+ .cse6 v_prenex_7) 0.0)))))) .cse2) (and (exists ((SqrtR_~residu~0 Real) (SqrtR_~xnp1~0 Real)) (let ((.cse13 (* 2.0 SqrtR_~xnp1~0))) (let ((.cse11 (* c_~_EPS~0 .cse13)) (.cse10 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) SqrtR_~xnp1~0))) (and (= .cse10 (/ 1.0 |c_SqrtR_#in~Input|)) (not (< (+ SqrtR_~residu~0 .cse11) 0.0)) (not (< .cse11 SqrtR_~residu~0)) (= SqrtR_~xnp1~0 (+ .cse10 (/ (* .cse10 (+ (to_real 1) (- (* .cse10 (* .cse10 |c_SqrtR_#in~Input|))))) 2.0))) (= (/ 1.0 SqrtR_~xnp1~0) |c_SqrtR_#res|) (let ((.cse12 (+ (* (- 1.0) SqrtR_~residu~0) .cse13))) (< (* (* 2.0 c_~_EPS~0) .cse12) (* (* c_~_EPS~0 .cse12) (- 1.0)))))))) .cse5 .cse2))))) is different from false [2019-09-10 01:40:05,067 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< 1.0 |c_SqrtR_#in~Input|))) (and (or (and (<= |c_SqrtR_#res| 5.0) (<= (/ 9.0 10.0) |c_SqrtR_#res|)) (and (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse1 (+ v_prenex_11 (* (/ (- 1.0) 2.0) v_prenex_10))) (.cse0 (* c_~_EPS~0 (* 2.0 v_prenex_11)))) (and (not (< .cse0 v_prenex_10)) (not (<= (/ 1.0 v_prenex_11) 5.0)) (= .cse1 (/ 1.0 |c_SqrtR_#in~Input|)) (= (+ .cse1 (/ (* .cse1 (+ (to_real 1) (- (* .cse1 (* .cse1 |c_SqrtR_#in~Input|))))) 2.0)) v_prenex_11) (not (< (+ .cse0 v_prenex_10) 0.0))))) .cse2) (and (exists ((v_SqrtR_~residu~0_27 Real) (v_SqrtR_~xn~0_32 Real)) (let ((.cse4 (* c_~_EPS~0 (* 2.0 v_SqrtR_~xn~0_32))) (.cse3 (+ (* (/ (- 1.0) 2.0) v_SqrtR_~residu~0_27) v_SqrtR_~xn~0_32))) (and (= .cse3 (/ 1.0 |c_SqrtR_#in~Input|)) (not (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xn~0_32))) (not (< .cse4 v_SqrtR_~residu~0_27)) (not (< (+ v_SqrtR_~residu~0_27 .cse4) 0.0)) (= v_SqrtR_~xn~0_32 (+ .cse3 (/ (* .cse3 (+ (to_real 1) (- (* (* .cse3 |c_SqrtR_#in~Input|) .cse3)))) 2.0)))))) .cse2)) (let ((.cse9 (= c_~_EPS~0 (/ 1.0 1000000.0)))) (or (and (exists ((SqrtR_~residu~0 Real) (v_prenex_8 Real)) (let ((.cse8 (* 2.0 v_prenex_8))) (let ((.cse5 (* c_~_EPS~0 .cse8)) (.cse6 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) v_prenex_8))) (and (not (< (+ SqrtR_~residu~0 .cse5) 0.0)) (= (+ .cse6 (/ (* (+ (to_real 1) (- (* .cse6 (* .cse6 |c_SqrtR_#in~Input|)))) .cse6) 2.0)) v_prenex_8) (let ((.cse7 (+ (* (- 1.0) SqrtR_~residu~0) .cse8))) (< (* (* 2.0 c_~_EPS~0) .cse7) (* (* .cse7 c_~_EPS~0) (- 1.0)))) (not (< .cse5 SqrtR_~residu~0)) (= (/ 1.0 v_prenex_8) |c_SqrtR_#res|) (= .cse6 (/ 1.0 |c_SqrtR_#in~Input|)))))) .cse9 .cse2) (and .cse9 (exists ((SqrtR_~xnp1~0 Real) (v_prenex_7 Real)) (let ((.cse13 (* 2.0 SqrtR_~xnp1~0))) (let ((.cse11 (+ SqrtR_~xnp1~0 (* (/ (- 1.0) 2.0) v_prenex_7))) (.cse10 (* c_~_EPS~0 .cse13))) (and (not (< .cse10 v_prenex_7)) (= SqrtR_~xnp1~0 (+ (/ (* (+ (to_real 1) (- (* .cse11 (* .cse11 |c_SqrtR_#in~Input|)))) .cse11) 2.0) .cse11)) (let ((.cse12 (+ .cse13 (* (- 1.0) v_prenex_7)))) (< (* c_~_EPS~0 .cse12) (* (* 2.0 c_~_EPS~0) .cse12))) (= .cse11 (/ 1.0 |c_SqrtR_#in~Input|)) (= (/ 1.0 SqrtR_~xnp1~0) |c_SqrtR_#res|) (not (< (+ .cse10 v_prenex_7) 0.0)))))) .cse2))))) is different from false [2019-09-10 01:40:05,092 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_main_~dd~0 (/ 100000001.0 100000000.0)) (or (exists ((SqrtR_~residu~0 Real) (main_~dd~0 Real) (v_prenex_8 Real)) (let ((.cse0 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) v_prenex_8)) (.cse1 (* (/ 1.0 500000.0) v_prenex_8))) (and (<= main_~dd~0 (/ 100000001.0 100000000.0)) (= (+ .cse0 (/ (* .cse0 (+ (to_real 1) (- (* .cse0 (* .cse0 main_~dd~0))))) 2.0)) v_prenex_8) (<= SqrtR_~residu~0 .cse1) (< (* (/ 3.0 500000.0) v_prenex_8) (* (/ 3.0 1000000.0) SqrtR_~residu~0)) (= |c_main_#t~ret3| (/ 1.0 v_prenex_8)) (<= (/ 99999999.0 100000000.0) main_~dd~0) (= .cse0 (/ 1.0 main_~dd~0)) (<= 0.0 (+ SqrtR_~residu~0 .cse1)) (< 1.0 main_~dd~0)))) (exists ((SqrtR_~xnp1~0 Real) (main_~dd~0 Real) (v_prenex_7 Real)) (let ((.cse3 (+ SqrtR_~xnp1~0 (* (/ (- 1.0) 2.0) v_prenex_7))) (.cse2 (* (/ 1.0 500000.0) SqrtR_~xnp1~0))) (and (<= main_~dd~0 (/ 100000001.0 100000000.0)) (<= v_prenex_7 .cse2) (= .cse3 (/ 1.0 main_~dd~0)) (= SqrtR_~xnp1~0 (+ .cse3 (/ (* .cse3 (+ (to_real 1) (- (* .cse3 (* .cse3 main_~dd~0))))) 2.0))) (<= (/ 99999999.0 100000000.0) main_~dd~0) (= (/ 1.0 SqrtR_~xnp1~0) |c_main_#t~ret3|) (< (* (/ 1.0 1000000.0) v_prenex_7) .cse2) (< 1.0 main_~dd~0) (<= 0.0 (+ .cse2 v_prenex_7)))))) (= c_main_~epsilon~0 (/ 1.0 100000000.0)) (= c_~_EPS~0 (/ 1.0 1000000.0)) (<= (/ 9.0 10.0) |c_main_#t~ret3|) (<= (/ 99999999.0 100000000.0) c_main_~dd~0) (<= |c_main_#t~ret3| 5.0) (= c_main_~d~0 1.0)) is different from false [2019-09-10 01:40:05,107 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_main_~r~0 5.0) (<= (/ 9.0 10.0) c_main_~r~0) (or (exists ((SqrtR_~xnp1~0 Real) (v_prenex_7 Real) (v_prenex_9 Real)) (let ((.cse0 (+ SqrtR_~xnp1~0 (* (/ (- 1.0) 2.0) v_prenex_7))) (.cse1 (* (/ 1.0 500000.0) SqrtR_~xnp1~0))) (and (= SqrtR_~xnp1~0 (+ (/ (* (+ (- (* .cse0 (* .cse0 v_prenex_9))) (to_real 1)) .cse0) 2.0) .cse0)) (<= (/ 99999999.0 100000000.0) v_prenex_9) (= (/ 1.0 SqrtR_~xnp1~0) c_main_~r~0) (<= v_prenex_7 .cse1) (< 1.0 v_prenex_9) (= .cse0 (/ 1.0 v_prenex_9)) (< (* (/ 1.0 1000000.0) v_prenex_7) .cse1) (<= v_prenex_9 (/ 100000001.0 100000000.0)) (<= 0.0 (+ .cse1 v_prenex_7))))) (exists ((SqrtR_~residu~0 Real) (main_~dd~0 Real) (v_prenex_8 Real)) (let ((.cse2 (+ (* (/ (- 1.0) 2.0) SqrtR_~residu~0) v_prenex_8)) (.cse3 (* (/ 1.0 500000.0) v_prenex_8))) (and (<= main_~dd~0 (/ 100000001.0 100000000.0)) (= (+ .cse2 (/ (* .cse2 (+ (to_real 1) (- (* .cse2 (* .cse2 main_~dd~0))))) 2.0)) v_prenex_8) (<= SqrtR_~residu~0 .cse3) (< (* (/ 3.0 500000.0) v_prenex_8) (* (/ 3.0 1000000.0) SqrtR_~residu~0)) (= c_main_~r~0 (/ 1.0 v_prenex_8)) (<= (/ 99999999.0 100000000.0) main_~dd~0) (= .cse2 (/ 1.0 main_~dd~0)) (<= 0.0 (+ SqrtR_~residu~0 .cse3)) (< 1.0 main_~dd~0)))))) is different from false [2019-09-10 01:40:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:40:05,286 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2019-09-10 01:40:05,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 01:40:05,287 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 21 [2019-09-10 01:40:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:40:05,290 INFO L225 Difference]: With dead ends: 78 [2019-09-10 01:40:05,290 INFO L226 Difference]: Without dead ends: 78 [2019-09-10 01:40:05,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=97, Invalid=232, Unknown=43, NotChecked=1350, Total=1722 [2019-09-10 01:40:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-10 01:40:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2019-09-10 01:40:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 01:40:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-09-10 01:40:05,305 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 21 [2019-09-10 01:40:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:40:05,306 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-09-10 01:40:05,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 01:40:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-09-10 01:40:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:40:05,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:40:05,307 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:40:05,307 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:40:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:40:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2096977090, now seen corresponding path program 2 times [2019-09-10 01:40:05,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:40:05,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:40:05,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:40:05,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:40:05,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:40:05,315 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:40:05,315 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:40:05,316 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:40:05,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:40:05,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:40:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:40:05,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:40:05,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:40:05,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:40:05,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:40:05,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:40:05,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:40:05,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 01:40:05,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:40:05,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 01:40:05,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:40:05,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:05,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:11,532 WARN L188 SmtUtils]: Spent 6.09 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-10 01:40:11,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 01:40:27,642 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 38 [2019-09-10 01:40:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:40:27,664 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:40:27,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:27,920 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_19 Real) (v_prenex_20 Real)) (let ((.cse0 (to_real 1))) (let ((.cse1 (* (/ 1.0 2.0) .cse0))) (and (< (+ v_prenex_19 |c_SqrtR_#in~Input|) .cse0) (>= v_prenex_19 (* c_~_EPS~0 (+ .cse1 v_prenex_20 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0))) (<= (+ .cse1 1.0) (+ (* (/ 1.0 2.0) |c_SqrtR_#in~Input|) v_prenex_20)))))) (exists ((v_SqrtR_~lsup~0_37 Real) (v_SqrtR_~xn~0_44 Real)) (let ((.cse3 (to_real 1))) (let ((.cse2 (* (/ 1.0 2.0) .cse3))) (and (<= (+ .cse2 1.0) (+ (* (/ 1.0 2.0) |c_SqrtR_#in~Input|) v_SqrtR_~xn~0_44)) (>= v_SqrtR_~lsup~0_37 (* c_~_EPS~0 (+ .cse2 v_SqrtR_~xn~0_44 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0))) (< (+ v_SqrtR_~lsup~0_37 .cse3) |c_SqrtR_#in~Input|)))))) is different from true [2019-09-10 01:40:27,932 WARN L860 $PredicateComparison]: unable to prove that (or (= 0 c_SqrtR_~cond~0) (exists ((v_prenex_19 Real) (v_prenex_20 Real)) (let ((.cse0 (to_real 1))) (let ((.cse1 (* (/ 1.0 2.0) .cse0))) (and (< (+ v_prenex_19 |c_SqrtR_#in~Input|) .cse0) (>= v_prenex_19 (* c_~_EPS~0 (+ .cse1 v_prenex_20 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0))) (<= (+ .cse1 1.0) (+ (* (/ 1.0 2.0) |c_SqrtR_#in~Input|) v_prenex_20)))))) (exists ((v_SqrtR_~lsup~0_37 Real) (v_SqrtR_~xn~0_44 Real)) (let ((.cse3 (to_real 1))) (let ((.cse2 (* (/ 1.0 2.0) .cse3))) (and (<= (+ .cse2 1.0) (+ (* (/ 1.0 2.0) |c_SqrtR_#in~Input|) v_SqrtR_~xn~0_44)) (>= v_SqrtR_~lsup~0_37 (* c_~_EPS~0 (+ .cse2 v_SqrtR_~xn~0_44 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0))) (< (+ v_SqrtR_~lsup~0_37 .cse3) |c_SqrtR_#in~Input|)))))) is different from true [2019-09-10 01:40:27,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:27,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:27,942 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2019-09-10 01:40:27,958 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_19 Real) (v_prenex_20 Real)) (let ((.cse0 (to_real 1))) (let ((.cse1 (* (/ 1.0 2.0) .cse0))) (and (< (+ v_prenex_19 |c_SqrtR_#in~Input|) .cse0) (>= v_prenex_19 (* c_~_EPS~0 (+ .cse1 v_prenex_20 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0))) (<= (+ .cse1 1.0) (+ (* (/ 1.0 2.0) |c_SqrtR_#in~Input|) v_prenex_20)))))) (and (forall ((v_prenex_23 Real) (v_prenex_22 Real) (v_prenex_21 Real)) (let ((.cse3 (* (/ 1.0 2.0) v_prenex_22))) (let ((.cse2 (+ .cse3 c_SqrtR_~xn~0))) (or (< v_prenex_21 .cse2) (not (= .cse2 (+ c_SqrtR_~xn~0 (/ (* c_SqrtR_~xn~0 (+ (to_real 1) (- (* c_SqrtR_~xn~0 (* c_SqrtR_~xn~0 c_SqrtR_~Input))))) 2.0)))) (not (>= v_prenex_23 (* (+ .cse3 c_SqrtR_~xn~0 v_prenex_21) c_~_EPS~0))) (<= 0.0 (+ v_prenex_23 v_prenex_22)))))) (forall ((v_SqrtR_~xn~0_46 Real) (v_SqrtR_~residu~0_38 Real) (v_SqrtR_~lsup~0_40 Real)) (let ((.cse4 (* (/ 1.0 2.0) v_SqrtR_~residu~0_38))) (or (not (= (+ c_SqrtR_~xn~0 .cse4) (+ c_SqrtR_~xn~0 (/ (* c_SqrtR_~xn~0 (+ (to_real 1) (- (* c_SqrtR_~xn~0 (* c_SqrtR_~xn~0 c_SqrtR_~Input))))) 2.0)))) (<= v_SqrtR_~residu~0_38 v_SqrtR_~lsup~0_40) (< v_SqrtR_~xn~0_46 (+ .cse4 c_SqrtR_~xn~0)) (not (>= v_SqrtR_~lsup~0_40 (* c_~_EPS~0 (+ v_SqrtR_~xn~0_46 c_SqrtR_~xn~0 .cse4)))))))) (exists ((v_SqrtR_~lsup~0_37 Real) (v_SqrtR_~xn~0_44 Real)) (let ((.cse6 (to_real 1))) (let ((.cse5 (* (/ 1.0 2.0) .cse6))) (and (<= (+ .cse5 1.0) (+ (* (/ 1.0 2.0) |c_SqrtR_#in~Input|) v_SqrtR_~xn~0_44)) (>= v_SqrtR_~lsup~0_37 (* c_~_EPS~0 (+ .cse5 v_SqrtR_~xn~0_44 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0))) (< (+ v_SqrtR_~lsup~0_37 .cse6) |c_SqrtR_#in~Input|)))))) is different from true [2019-09-10 01:40:27,966 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2019-09-10 01:40:27,978 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2019-09-10 01:40:27,987 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_19 Real) (v_prenex_20 Real)) (let ((.cse0 (to_real 1))) (let ((.cse1 (* (/ 1.0 2.0) .cse0))) (and (< (+ v_prenex_19 |c_SqrtR_#in~Input|) .cse0) (>= v_prenex_19 (* c_~_EPS~0 (+ .cse1 v_prenex_20 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0))) (<= (+ .cse1 1.0) (+ (* (/ 1.0 2.0) |c_SqrtR_#in~Input|) v_prenex_20)))))) (exists ((v_SqrtR_~lsup~0_37 Real) (v_SqrtR_~xn~0_44 Real)) (let ((.cse3 (to_real 1))) (let ((.cse2 (* (/ 1.0 2.0) .cse3))) (and (<= (+ .cse2 1.0) (+ (* (/ 1.0 2.0) |c_SqrtR_#in~Input|) v_SqrtR_~xn~0_44)) (>= v_SqrtR_~lsup~0_37 (* c_~_EPS~0 (+ .cse2 v_SqrtR_~xn~0_44 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0))) (< (+ v_SqrtR_~lsup~0_37 .cse3) |c_SqrtR_#in~Input|))))) (and (forall ((v_SqrtR_~xn~0_46 Real) (v_SqrtR_~lsup~0_40 Real)) (let ((.cse5 (to_real 1))) (let ((.cse4 (* (/ 1.0 2.0) .cse5))) (or (not (>= v_SqrtR_~lsup~0_40 (* c_~_EPS~0 (+ v_SqrtR_~xn~0_46 .cse4 (* (/ (- 1.0) 2.0) c_SqrtR_~Input) 1.0)))) (<= .cse5 (+ v_SqrtR_~lsup~0_40 c_SqrtR_~Input)) (< (+ v_SqrtR_~xn~0_46 (* (/ 1.0 2.0) c_SqrtR_~Input)) (+ .cse4 1.0)))))) (forall ((v_prenex_23 Real) (v_prenex_21 Real)) (let ((.cse6 (to_real 1))) (let ((.cse7 (* (/ 1.0 2.0) .cse6))) (or (<= c_SqrtR_~Input (+ v_prenex_23 .cse6)) (not (>= v_prenex_23 (* c_~_EPS~0 (+ .cse7 v_prenex_21 (* (/ (- 1.0) 2.0) c_SqrtR_~Input) 1.0)))) (< (+ v_prenex_21 (* (/ 1.0 2.0) c_SqrtR_~Input)) (+ .cse7 1.0)))))))) is different from true [2019-09-10 01:40:27,991 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-09-10 01:40:27,997 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((v_prenex_19 Real) (v_prenex_20 Real)) (let ((.cse8 (to_real 1))) (let ((.cse9 (* (/ 1.0 2.0) .cse8))) (and (< (+ v_prenex_19 |c_SqrtR_#in~Input|) .cse8) (>= v_prenex_19 (* c_~_EPS~0 (+ .cse9 v_prenex_20 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0))) (<= (+ .cse9 1.0) (+ (* (/ 1.0 2.0) |c_SqrtR_#in~Input|) v_prenex_20))))))) (.cse3 (exists ((v_SqrtR_~lsup~0_37 Real) (v_SqrtR_~xn~0_44 Real)) (let ((.cse7 (to_real 1))) (let ((.cse6 (* (/ 1.0 2.0) .cse7))) (and (<= (+ .cse6 1.0) (+ (* (/ 1.0 2.0) |c_SqrtR_#in~Input|) v_SqrtR_~xn~0_44)) (>= v_SqrtR_~lsup~0_37 (* c_~_EPS~0 (+ .cse6 v_SqrtR_~xn~0_44 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0))) (< (+ v_SqrtR_~lsup~0_37 .cse7) |c_SqrtR_#in~Input|))))))) (and (or (forall ((v_SqrtR_~xn~0_46 Real) (v_SqrtR_~lsup~0_40 Real)) (let ((.cse1 (to_real 1))) (let ((.cse0 (* (/ 1.0 2.0) .cse1))) (or (not (>= v_SqrtR_~lsup~0_40 (* c_~_EPS~0 (+ v_SqrtR_~xn~0_46 .cse0 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0)))) (< (+ v_SqrtR_~xn~0_46 (* (/ 1.0 2.0) |c_SqrtR_#in~Input|)) (+ .cse0 1.0)) (<= .cse1 (+ v_SqrtR_~lsup~0_40 |c_SqrtR_#in~Input|)))))) .cse2 .cse3) (or (forall ((v_prenex_23 Real) (v_prenex_21 Real)) (let ((.cse5 (to_real 1))) (let ((.cse4 (* (/ 1.0 2.0) .cse5))) (or (< (+ v_prenex_21 (* (/ 1.0 2.0) |c_SqrtR_#in~Input|)) (+ .cse4 1.0)) (not (>= v_prenex_23 (* c_~_EPS~0 (+ .cse4 v_prenex_21 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0)))) (<= |c_SqrtR_#in~Input| (+ v_prenex_23 .cse5)))))) .cse2 .cse3))) is different from false [2019-09-10 01:40:28,002 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((v_prenex_19 Real) (v_prenex_20 Real)) (let ((.cse8 (to_real 1))) (let ((.cse9 (* (/ 1.0 2.0) .cse8))) (and (< (+ v_prenex_19 |c_SqrtR_#in~Input|) .cse8) (>= v_prenex_19 (* c_~_EPS~0 (+ .cse9 v_prenex_20 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0))) (<= (+ .cse9 1.0) (+ (* (/ 1.0 2.0) |c_SqrtR_#in~Input|) v_prenex_20))))))) (.cse3 (exists ((v_SqrtR_~lsup~0_37 Real) (v_SqrtR_~xn~0_44 Real)) (let ((.cse7 (to_real 1))) (let ((.cse6 (* (/ 1.0 2.0) .cse7))) (and (<= (+ .cse6 1.0) (+ (* (/ 1.0 2.0) |c_SqrtR_#in~Input|) v_SqrtR_~xn~0_44)) (>= v_SqrtR_~lsup~0_37 (* c_~_EPS~0 (+ .cse6 v_SqrtR_~xn~0_44 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0))) (< (+ v_SqrtR_~lsup~0_37 .cse7) |c_SqrtR_#in~Input|))))))) (and (or (forall ((v_SqrtR_~xn~0_46 Real) (v_SqrtR_~lsup~0_40 Real)) (let ((.cse1 (to_real 1))) (let ((.cse0 (* (/ 1.0 2.0) .cse1))) (or (not (>= v_SqrtR_~lsup~0_40 (* c_~_EPS~0 (+ v_SqrtR_~xn~0_46 .cse0 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0)))) (< (+ v_SqrtR_~xn~0_46 (* (/ 1.0 2.0) |c_SqrtR_#in~Input|)) (+ .cse0 1.0)) (<= .cse1 (+ v_SqrtR_~lsup~0_40 |c_SqrtR_#in~Input|)))))) .cse2 .cse3) (or (forall ((v_prenex_23 Real) (v_prenex_21 Real)) (let ((.cse5 (to_real 1))) (let ((.cse4 (* (/ 1.0 2.0) .cse5))) (or (< (+ v_prenex_21 (* (/ 1.0 2.0) |c_SqrtR_#in~Input|)) (+ .cse4 1.0)) (not (>= v_prenex_23 (* c_~_EPS~0 (+ .cse4 v_prenex_21 (* (/ (- 1.0) 2.0) |c_SqrtR_#in~Input|) 1.0)))) (<= |c_SqrtR_#in~Input| (+ v_prenex_23 .cse5)))))) .cse2 .cse3))) is different from true [2019-09-10 01:40:28,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:28,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:28,061 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_main_~dd~0_16 Real) (v_SqrtR_~lsup~0_37 Real) (v_SqrtR_~xn~0_44 Real)) (let ((.cse1 (to_real 1))) (let ((.cse0 (* (/ 1.0 2.0) .cse1))) (or (< (+ (* (/ 1.0 2.0) v_main_~dd~0_16) v_SqrtR_~xn~0_44) (+ .cse0 1.0)) (< (/ 100000001.0 100000000.0) v_main_~dd~0_16) (not (>= v_SqrtR_~lsup~0_37 (* c_~_EPS~0 (+ (* (/ (- 1.0) 2.0) v_main_~dd~0_16) .cse0 v_SqrtR_~xn~0_44 1.0)))) (<= v_main_~dd~0_16 (+ v_SqrtR_~lsup~0_37 .cse1)) (< v_main_~dd~0_16 (/ 99999999.0 100000000.0)))))) (forall ((v_prenex_24 Real) (v_prenex_19 Real) (v_prenex_20 Real)) (let ((.cse3 (to_real 1))) (let ((.cse2 (* (/ 1.0 2.0) .cse3))) (or (not (>= v_prenex_19 (* c_~_EPS~0 (+ (* (/ (- 1.0) 2.0) v_prenex_24) .cse2 v_prenex_20 1.0)))) (< (/ 100000001.0 100000000.0) v_prenex_24) (< (+ (* (/ 1.0 2.0) v_prenex_24) v_prenex_20) (+ .cse2 1.0)) (<= .cse3 (+ v_prenex_24 v_prenex_19)) (< v_prenex_24 (/ 99999999.0 100000000.0))))))) is different from true [2019-09-10 01:40:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:40:28,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 01:40:28,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2019-09-10 01:40:28,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:40:28,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 01:40:28,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 01:40:28,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=76, Unknown=18, NotChecked=138, Total=272 [2019-09-10 01:40:28,115 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 17 states. [2019-09-10 01:41:03,155 WARN L188 SmtUtils]: Spent 14.51 s on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 01:41:35,759 WARN L188 SmtUtils]: Spent 26.38 s on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2019-09-10 01:42:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:42:14,547 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2019-09-10 01:42:14,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:42:14,548 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2019-09-10 01:42:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:42:14,550 INFO L225 Difference]: With dead ends: 80 [2019-09-10 01:42:14,550 INFO L226 Difference]: Without dead ends: 80 [2019-09-10 01:42:14,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 71.5s TimeCoverageRelationStatistics Valid=57, Invalid=128, Unknown=21, NotChecked=174, Total=380 [2019-09-10 01:42:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-10 01:42:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2019-09-10 01:42:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-10 01:42:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2019-09-10 01:42:14,577 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 22 [2019-09-10 01:42:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:42:14,577 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2019-09-10 01:42:14,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 01:42:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2019-09-10 01:42:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:42:14,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:42:14,579 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:42:14,579 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:42:14,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:42:14,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1611184192, now seen corresponding path program 2 times [2019-09-10 01:42:14,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:42:14,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:42:14,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:42:14,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:42:14,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:42:14,586 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:42:14,586 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:42:14,586 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:42:14,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:42:14,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:42:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-10 01:42:14,760 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2019-09-10 01:42:14,760 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 01:42:14,777 WARN L226 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-09-10 01:42:14,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:42:14 BoogieIcfgContainer [2019-09-10 01:42:14,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:42:14,781 INFO L168 Benchmark]: Toolchain (without parser) took 164370.03 ms. Allocated memory was 138.4 MB in the beginning and 285.2 MB in the end (delta: 146.8 MB). Free memory was 88.6 MB in the beginning and 206.8 MB in the end (delta: -118.2 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2019-09-10 01:42:14,782 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:42:14,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.11 ms. Allocated memory is still 138.4 MB. Free memory was 88.3 MB in the beginning and 77.9 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-09-10 01:42:14,784 INFO L168 Benchmark]: Boogie Preprocessor took 132.36 ms. Allocated memory was 138.4 MB in the beginning and 200.3 MB in the end (delta: 61.9 MB). Free memory was 77.9 MB in the beginning and 177.3 MB in the end (delta: -99.4 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-09-10 01:42:14,784 INFO L168 Benchmark]: RCFGBuilder took 284.97 ms. Allocated memory is still 200.3 MB. Free memory was 177.3 MB in the beginning and 163.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-09-10 01:42:14,785 INFO L168 Benchmark]: TraceAbstraction took 163698.97 ms. Allocated memory was 200.3 MB in the beginning and 285.2 MB in the end (delta: 84.9 MB). Free memory was 163.3 MB in the beginning and 206.8 MB in the end (delta: -43.5 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-09-10 01:42:14,789 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 249.11 ms. Allocated memory is still 138.4 MB. Free memory was 88.3 MB in the beginning and 77.9 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.36 ms. Allocated memory was 138.4 MB in the beginning and 200.3 MB in the end (delta: 61.9 MB). Free memory was 77.9 MB in the beginning and 177.3 MB in the end (delta: -99.4 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 284.97 ms. Allocated memory is still 200.3 MB. Free memory was 177.3 MB in the beginning and 163.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 163698.97 ms. Allocated memory was 200.3 MB in the beginning and 285.2 MB in the end (delta: 84.9 MB). Free memory was 163.3 MB in the beginning and 206.8 MB in the end (delta: -43.5 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 8]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L10] double _EPS = 1e-6; [L37] double d, dd, r; [L38] double epsilon = 1e-8; [L40] d = 1. [L40] COND TRUE d <= 20. [L42] dd = __VERIFIER_nondet_double() [L45] CALL, EXPR SqrtR(dd) [L14] double xn, xnp1, residu, lsup, linf; [L15] int i, cond; [L16] COND FALSE !(Input <= 1.0) [L16] xn = 1.0/Input [L17] xnp1 = xn [L18] residu = 2.0*_EPS*(xn+xnp1) [L19] lsup = _EPS * (xn+xnp1) [L20] linf = -lsup [L21] cond = ((residu > lsup) || (residu < linf)) [L22] i = 0 [L23] COND TRUE \read(cond) [L24] xnp1 = xn + xn*(1-Input*xn*xn) / 2.0 [L25] residu = 2.0*(xnp1-xn) [L26] xn = xnp1 [L27] lsup = _EPS * (xn+xnp1) [L28] linf = -lsup [L29] cond = ((residu > lsup) || (residu < linf)) [L30] i++ [L23] COND TRUE \read(cond) [L24] xnp1 = xn + xn*(1-Input*xn*xn) / 2.0 [L25] residu = 2.0*(xnp1-xn) [L26] xn = xnp1 [L27] lsup = _EPS * (xn+xnp1) [L28] linf = -lsup [L29] cond = ((residu > lsup) || (residu < linf)) [L30] i++ [L23] COND FALSE !(\read(cond)) [L32] return 1.0 / xnp1; [L45] RET, EXPR SqrtR(dd) [L45] r = SqrtR(dd) [L47] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) [L8] COND TRUE !(cond) [L8] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. UNKNOWN Result, 163.5s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 111.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 119 SDslu, 735 SDs, 0 SdLazy, 328 SolverSat, 28 SolverUnsat, 68 SolverUnknown, 0 SolverNotchecked, 57.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 123 SyntacticMatches, 13 SemanticMatches, 100 ConstructedPredicates, 42 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 82.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 50.5s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 198 ConstructedInterpolants, 65 QuantifiedInterpolants, 157489 SizeOfPredicates, 59 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 0/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...