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_biNewton_pseudoconstant.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:39:30,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:39:30,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:39:30,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:39:30,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:39:30,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:39:30,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:39:30,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:39:30,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:39:30,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:39:30,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:39:30,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:39:30,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:39:30,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:39:30,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:39:30,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:39:30,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:39:30,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:39:30,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:39:30,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:39:30,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:39:30,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:39:30,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:39:30,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:39:30,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:39:30,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:39:30,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:39:30,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:39:30,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:39:30,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:39:30,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:39:30,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:39:30,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:39:30,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:39:30,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:39:30,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:39:30,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:39:30,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:39:30,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:39:30,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:39:30,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:39:30,778 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:30,792 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:39:30,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:39:30,794 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:39:30,795 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:39:30,795 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:39:30,795 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:39:30,796 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:39:30,796 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:39:30,796 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:39:30,796 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:39:30,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:39:30,797 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:39:30,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:39:30,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:39:30,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:39:30,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:39:30,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:39:30,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:39:30,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:39:30,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:39:30,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:39:30,799 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:39:30,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:39:30,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:39:30,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:39:30,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:39:30,800 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:39:30,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:39:30,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:39:30,801 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:39:30,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:39:30,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:39:30,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:39:30,851 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:39:30,851 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:39:30,852 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant.c [2019-09-10 01:39:30,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fd01a0d/a21cea8c16a04950b9df080e896840c2/FLAG3690ddf81 [2019-09-10 01:39:31,414 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:39:31,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_biNewton_pseudoconstant.c [2019-09-10 01:39:31,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fd01a0d/a21cea8c16a04950b9df080e896840c2/FLAG3690ddf81 [2019-09-10 01:39:31,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fd01a0d/a21cea8c16a04950b9df080e896840c2 [2019-09-10 01:39:31,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:39:31,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:39:31,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:39:31,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:39:31,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:39:31,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:39:31" (1/1) ... [2019-09-10 01:39:31,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb25d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:31, skipping insertion in model container [2019-09-10 01:39:31,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:39:31" (1/1) ... [2019-09-10 01:39:31,840 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:39:31,857 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:39:32,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:39:32,026 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:39:32,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:39:32,157 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:39:32,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:32 WrapperNode [2019-09-10 01:39:32,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:39:32,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:39:32,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:39:32,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:39:32,173 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:32" (1/1) ... [2019-09-10 01:39:32,173 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:32" (1/1) ... [2019-09-10 01:39:32,178 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:32" (1/1) ... [2019-09-10 01:39:32,178 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:32" (1/1) ... [2019-09-10 01:39:32,182 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:32" (1/1) ... [2019-09-10 01:39:32,187 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:32" (1/1) ... [2019-09-10 01:39:32,189 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:32" (1/1) ... [2019-09-10 01:39:32,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:39:32,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:39:32,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:39:32,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:39:32,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:32" (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:32,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:39:32,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:39:32,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:39:32,254 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2019-09-10 01:39:32,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:39:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:39:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2019-09-10 01:39:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 01:39:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:39:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2019-09-10 01:39:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:39:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:39:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:39:32,485 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:39:32,486 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-10 01:39:32,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:39:32 BoogieIcfgContainer [2019-09-10 01:39:32,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:39:32,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:39:32,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:39:32,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:39:32,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:39:31" (1/3) ... [2019-09-10 01:39:32,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fd4946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:39:32, skipping insertion in model container [2019-09-10 01:39:32,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:32" (2/3) ... [2019-09-10 01:39:32,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fd4946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:39:32, skipping insertion in model container [2019-09-10 01:39:32,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:39:32" (3/3) ... [2019-09-10 01:39:32,517 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_biNewton_pseudoconstant.c [2019-09-10 01:39:32,542 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:39:32,552 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:39:32,573 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:39:32,601 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:39:32,602 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:39:32,602 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:39:32,602 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:39:32,602 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:39:32,602 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:39:32,603 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:39:32,603 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:39:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-10 01:39:32,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:39:32,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:32,629 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:32,632 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:32,636 INFO L82 PathProgramCache]: Analyzing trace with hash -995072322, now seen corresponding path program 1 times [2019-09-10 01:39:32,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:32,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:32,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:32,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:32,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:32,722 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:39:32,722 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:39:32,723 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:32,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:32,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:39:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:32,766 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:39:32,768 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:32,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:32,768 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:32,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:32,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:39:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:32,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 01:39:32,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:32,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:32,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:32,996 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:32,997 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:35,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((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))) (or (not (<= v_SqrtR_~lsup~0_7 (* c_~_EPS~0 .cse0))) (not (>= v_SqrtR_~residu~0_7 (* (* 2.0 c_~_EPS~0) .cse0))) (< v_SqrtR_~xnp1~0_8 1.0) (< v_SqrtR_~lsup~0_7 v_SqrtR_~residu~0_7)))) is different from false [2019-09-10 01:39:36,273 WARN L860 $PredicateComparison]: unable to prove that (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))))) is different from true [2019-09-10 01:39:37,508 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 21 [2019-09-10 01:39:37,528 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:37,580 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:37,587 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:39:37,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [] total 9 [2019-09-10 01:39:37,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:39:37,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:39:37,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:39:37,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=21, Unknown=3, NotChecked=30, Total=72 [2019-09-10 01:39:37,609 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-09-10 01:39:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:37,695 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-10 01:39:37,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:39:37,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-10 01:39:37,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:37,710 INFO L225 Difference]: With dead ends: 35 [2019-09-10 01:39:37,710 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 01:39:37,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=24, Invalid=27, Unknown=3, NotChecked=36, Total=90 [2019-09-10 01:39:37,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 01:39:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-09-10 01:39:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:39:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-10 01:39:37,753 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2019-09-10 01:39:37,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:37,754 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-10 01:39:37,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:39:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-10 01:39:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:39:37,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:37,756 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:37,756 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash -294007744, now seen corresponding path program 1 times [2019-09-10 01:39:37,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:37,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:37,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:37,766 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:39:37,766 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:39:37,767 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) [2019-09-10 01:39:37,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:37,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:39:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:37,801 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:39:37,802 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:37,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:37,802 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) [2019-09-10 01:39:37,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:37,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:37,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 01:39:37,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:37,862 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:37,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:37,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:37,881 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:37,900 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:37,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:38,107 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 01:39:38,289 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 01:39:38,485 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 01:39:38,643 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 01:39:38,661 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:38,667 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:38,709 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:39,057 WARN L860 $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 true [2019-09-10 01:39:39,068 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:39,071 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:39,110 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:39,114 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:39:39,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 7] imperfect sequences [] total 10 [2019-09-10 01:39:39,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:39:39,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:39:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:39:39,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=11, Unknown=8, NotChecked=54, Total=90 [2019-09-10 01:39:39,118 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2019-09-10 01:39:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:39,147 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-10 01:39:39,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:39:39,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-10 01:39:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:39,149 INFO L225 Difference]: With dead ends: 27 [2019-09-10 01:39:39,149 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 01:39:39,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=11, Unknown=8, NotChecked=54, Total=90 [2019-09-10 01:39:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 01:39:39,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-09-10 01:39:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 01:39:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-10 01:39:39,158 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2019-09-10 01:39:39,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:39,158 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-10 01:39:39,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:39:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-10 01:39:39,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:39:39,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:39,160 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:39,160 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:39,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:39,161 INFO L82 PathProgramCache]: Analyzing trace with hash -224200478, now seen corresponding path program 1 times [2019-09-10 01:39:39,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:39,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:39,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:39,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:39,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:39,175 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:39:39,175 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:39:39,176 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:39,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:39,190 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:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:39,217 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2019-09-10 01:39:39,219 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:39,252 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:39:39,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:39:39,319 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPLT has no precise implementation. [2019-09-10 01:39:39,320 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:39:39,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:39:39,450 INFO L272 AbstractInterpreter]: Visited 21 different actions 61 times. Merged at 6 different actions 30 times. Widened at 1 different actions 5 times. Performed 286 root evaluator evaluations with a maximum evaluation depth of 7. Performed 286 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 7 fixpoints after 2 different actions. Largest state had 14 variables. [2019-09-10 01:39:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:39,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:39:39,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:39,455 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) [2019-09-10 01:39:39,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:39,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:39,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 01:39:39,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:39,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:39,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:39,617 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~_EPS~0 (/ 1.0 1000000.0)) (exists ((SqrtR_~xnp1~0 Real) (SqrtR_~linf~0 Real)) (let ((.cse1 (* 2.0 SqrtR_~xnp1~0))) (let ((.cse0 (* c_~_EPS~0 .cse1))) (and (<= 0.0 (+ SqrtR_~linf~0 .cse0)) (not (< (+ .cse0 2.0) .cse1)) (= (/ 1.0 SqrtR_~xnp1~0) |c_SqrtR_#res|) (<= (+ SqrtR_~linf~0 2.0) .cse1)))))) is different from false [2019-09-10 01:39:39,632 WARN L838 $PredicateComparison]: unable to prove that (exists ((SqrtR_~xnp1~0 Real)) (and (<= 2.0 (* (/ 1000001.0 500000.0) SqrtR_~xnp1~0)) (= (/ 1.0 SqrtR_~xnp1~0) |c_main_#t~ret3|) (<= (* (/ 999999.0 500000.0) SqrtR_~xnp1~0) 2.0))) is different from false [2019-09-10 01:39:39,638 WARN L838 $PredicateComparison]: unable to prove that (exists ((SqrtR_~xnp1~0 Real)) (and (= (/ 1.0 SqrtR_~xnp1~0) c_main_~r~0) (<= 2.0 (* (/ 1000001.0 500000.0) SqrtR_~xnp1~0)) (<= (* (/ 999999.0 500000.0) SqrtR_~xnp1~0) 2.0))) is different from false [2019-09-10 01:39:39,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:39,671 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:39,672 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:39,896 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-09-10 01:39:40,020 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-09-10 01:39:40,224 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 01:39:40,344 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 01:39:40,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:40,359 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_SqrtR_~linf~0_19 Real) (v_SqrtR_~xnp1~0_20 Real)) (let ((.cse0 (* 2.0 v_SqrtR_~xnp1~0_20))) (let ((.cse1 (* c_~_EPS~0 .cse0))) (or (< .cse0 (+ v_SqrtR_~linf~0_19 2.0)) (<= (/ 9.0 10.0) (/ 1.0 v_SqrtR_~xnp1~0_20)) (not (<= 0.0 (+ v_SqrtR_~linf~0_19 .cse1))) (< (+ 2.0 .cse1) .cse0))))) (forall ((v_SqrtR_~linf~0_19 Real) (v_SqrtR_~xnp1~0_20 Real)) (let ((.cse2 (* 2.0 v_SqrtR_~xnp1~0_20))) (let ((.cse3 (* c_~_EPS~0 .cse2))) (or (<= (/ 1.0 v_SqrtR_~xnp1~0_20) 5.0) (< .cse2 (+ v_SqrtR_~linf~0_19 2.0)) (not (<= 0.0 (+ v_SqrtR_~linf~0_19 .cse3))) (< (+ 2.0 .cse3) .cse2)))))) is different from true [2019-09-10 01:39:40,365 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_SqrtR_~linf~0_19 Real) (v_SqrtR_~xnp1~0_20 Real)) (let ((.cse1 (* 2.0 v_SqrtR_~xnp1~0_20))) (let ((.cse0 (* c_~_EPS~0 .cse1))) (and (<= 0.0 (+ v_SqrtR_~linf~0_19 .cse0)) (not (<= (/ 1.0 v_SqrtR_~xnp1~0_20) 5.0)) (not (< (+ 2.0 .cse0) .cse1)) (<= (+ v_SqrtR_~linf~0_19 2.0) .cse1))))) (and (<= |c_SqrtR_#res| 5.0) (<= (/ 9.0 10.0) |c_SqrtR_#res|)) (exists ((v_prenex_7 Real) (v_prenex_8 Real)) (let ((.cse3 (* 2.0 v_prenex_8))) (let ((.cse2 (* c_~_EPS~0 .cse3))) (and (<= 0.0 (+ .cse2 v_prenex_7)) (<= (+ v_prenex_7 2.0) .cse3) (not (< (+ .cse2 2.0) .cse3)) (not (<= (/ 9.0 10.0) (/ 1.0 v_prenex_8)))))))) is different from false [2019-09-10 01:39:40,384 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_SqrtR_~linf~0_19 Real) (v_SqrtR_~xnp1~0_20 Real)) (let ((.cse1 (* 2.0 v_SqrtR_~xnp1~0_20))) (let ((.cse0 (* c_~_EPS~0 .cse1))) (and (<= 0.0 (+ v_SqrtR_~linf~0_19 .cse0)) (not (<= (/ 1.0 v_SqrtR_~xnp1~0_20) 5.0)) (not (< (+ 2.0 .cse0) .cse1)) (<= (+ v_SqrtR_~linf~0_19 2.0) .cse1))))) (exists ((v_prenex_7 Real) (v_prenex_8 Real)) (let ((.cse3 (* 2.0 v_prenex_8))) (let ((.cse2 (* c_~_EPS~0 .cse3))) (and (<= 0.0 (+ .cse2 v_prenex_7)) (<= (+ v_prenex_7 2.0) .cse3) (not (< (+ .cse2 2.0) .cse3)) (not (<= (/ 9.0 10.0) (/ 1.0 v_prenex_8))))))) (let ((.cse4 (/ 1.0 c_SqrtR_~xnp1~0))) (and (<= .cse4 5.0) (<= (/ 9.0 10.0) .cse4)))) is different from false [2019-09-10 01:39:40,399 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_SqrtR_~linf~0_19 Real) (v_SqrtR_~xnp1~0_20 Real)) (let ((.cse1 (* 2.0 v_SqrtR_~xnp1~0_20))) (let ((.cse0 (* c_~_EPS~0 .cse1))) (and (<= 0.0 (+ v_SqrtR_~linf~0_19 .cse0)) (not (<= (/ 1.0 v_SqrtR_~xnp1~0_20) 5.0)) (not (< (+ 2.0 .cse0) .cse1)) (<= (+ v_SqrtR_~linf~0_19 2.0) .cse1))))) (exists ((v_prenex_7 Real) (v_prenex_8 Real)) (let ((.cse3 (* 2.0 v_prenex_8))) (let ((.cse2 (* c_~_EPS~0 .cse3))) (and (<= 0.0 (+ .cse2 v_prenex_7)) (<= (+ v_prenex_7 2.0) .cse3) (not (< (+ .cse2 2.0) .cse3)) (not (<= (/ 9.0 10.0) (/ 1.0 v_prenex_8))))))) (let ((.cse4 (/ 1.0 c_SqrtR_~xnp1~0))) (and (<= .cse4 5.0) (<= (/ 9.0 10.0) .cse4))) (not (= 0 c_SqrtR_~cond~0))) is different from false [2019-09-10 01:39:40,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:40,413 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_SqrtR_~linf~0_19 Real) (v_SqrtR_~xnp1~0_20 Real)) (let ((.cse7 (* 2.0 v_SqrtR_~xnp1~0_20))) (let ((.cse6 (* c_~_EPS~0 .cse7))) (and (<= 0.0 (+ v_SqrtR_~linf~0_19 .cse6)) (not (<= (/ 1.0 v_SqrtR_~xnp1~0_20) 5.0)) (not (< (+ 2.0 .cse6) .cse7)) (<= (+ v_SqrtR_~linf~0_19 2.0) .cse7)))))) (.cse2 (exists ((v_prenex_7 Real) (v_prenex_8 Real)) (let ((.cse5 (* 2.0 v_prenex_8))) (let ((.cse4 (* c_~_EPS~0 .cse5))) (and (<= 0.0 (+ .cse4 v_prenex_7)) (<= (+ v_prenex_7 2.0) .cse5) (not (< (+ .cse4 2.0) .cse5)) (not (<= (/ 9.0 10.0) (/ 1.0 v_prenex_8))))))))) (and (or .cse0 (forall ((v_SqrtR_~linf~0_20 Real) (v_SqrtR_~residu~0_20 Real)) (let ((.cse1 (* c_~_EPS~0 (+ (* 2.0 c_SqrtR_~xn~0) v_SqrtR_~residu~0_20)))) (or (not (<= 0.0 (+ v_SqrtR_~linf~0_20 .cse1))) (<= (/ 9.0 10.0) (/ 1.0 (+ c_SqrtR_~xn~0 (* (/ 1.0 2.0) v_SqrtR_~residu~0_20)))) (< .cse1 v_SqrtR_~residu~0_20) (< v_SqrtR_~residu~0_20 v_SqrtR_~linf~0_20)))) .cse2) (or .cse0 (forall ((v_SqrtR_~linf~0_20 Real) (v_SqrtR_~residu~0_20 Real)) (let ((.cse3 (* c_~_EPS~0 (+ (* 2.0 c_SqrtR_~xn~0) v_SqrtR_~residu~0_20)))) (or (not (<= 0.0 (+ v_SqrtR_~linf~0_20 .cse3))) (< .cse3 v_SqrtR_~residu~0_20) (< v_SqrtR_~residu~0_20 v_SqrtR_~linf~0_20) (<= (/ 1.0 (+ c_SqrtR_~xn~0 (* (/ 1.0 2.0) v_SqrtR_~residu~0_20))) 5.0)))) .cse2))) is different from false [2019-09-10 01:39:40,429 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 32 [2019-09-10 01:39:40,677 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5086 conjuctions. This might take some time... [2019-09-10 01:39:40,742 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 9 conjuctions. [2019-09-10 01:39:40,757 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((v_SqrtR_~linf~0_19 Real) (v_SqrtR_~xnp1~0_20 Real)) (let ((.cse15 (* 2.0 v_SqrtR_~xnp1~0_20))) (let ((.cse14 (* c_~_EPS~0 .cse15))) (and (<= 0.0 (+ v_SqrtR_~linf~0_19 .cse14)) (not (<= (/ 1.0 v_SqrtR_~xnp1~0_20) 5.0)) (not (< (+ 2.0 .cse14) .cse15)) (<= (+ v_SqrtR_~linf~0_19 2.0) .cse15)))))) (.cse3 (forall ((v_prenex_14 Real) (v_prenex_13 Real)) (let ((.cse13 (* c_~_EPS~0 (+ v_prenex_14 (* 2.0 c_SqrtR_~xn~0))))) (or (not (<= 0.0 (+ v_prenex_13 .cse13))) (< v_prenex_14 v_prenex_13) (< .cse13 v_prenex_14) (<= (/ 1.0 (+ (* (/ 1.0 2.0) v_prenex_14) c_SqrtR_~xn~0)) 5.0))))) (.cse1 (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse12 (* 2.0 v_prenex_11))) (let ((.cse11 (* c_~_EPS~0 .cse12))) (and (<= 0.0 (+ .cse11 v_prenex_10)) (not (<= (/ 9.0 10.0) (/ 1.0 v_prenex_11))) (<= (+ v_prenex_10 2.0) .cse12) (not (< (+ .cse11 2.0) .cse12))))))) (.cse5 (exists ((v_prenex_7 Real) (v_prenex_8 Real)) (let ((.cse10 (* 2.0 v_prenex_8))) (let ((.cse9 (* c_~_EPS~0 .cse10))) (and (<= 0.0 (+ .cse9 v_prenex_7)) (<= (+ v_prenex_7 2.0) .cse10) (not (< (+ .cse9 2.0) .cse10)) (not (<= (/ 9.0 10.0) (/ 1.0 v_prenex_8)))))))) (.cse0 (forall ((v_SqrtR_~linf~0_20 Real) (v_SqrtR_~residu~0_20 Real)) (let ((.cse8 (* c_~_EPS~0 (+ (* 2.0 c_SqrtR_~xn~0) v_SqrtR_~residu~0_20)))) (or (not (<= 0.0 (+ v_SqrtR_~linf~0_20 .cse8))) (<= (/ 9.0 10.0) (/ 1.0 (+ c_SqrtR_~xn~0 (* (/ 1.0 2.0) v_SqrtR_~residu~0_20)))) (< .cse8 v_SqrtR_~residu~0_20) (< v_SqrtR_~residu~0_20 v_SqrtR_~linf~0_20))))) (.cse4 (exists ((v_prenex_12 Real) (v_prenex_9 Real)) (let ((.cse7 (* 2.0 v_prenex_12))) (let ((.cse6 (* c_~_EPS~0 .cse7))) (and (not (< (+ 2.0 .cse6) .cse7)) (<= 0.0 (+ .cse6 v_prenex_9)) (not (<= (/ 1.0 v_prenex_12) 5.0)) (<= (+ v_prenex_9 2.0) .cse7))))))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse2 .cse4) (and .cse3 .cse5) (and .cse2 .cse1) (and .cse0 .cse3) (and .cse5 .cse1) (and .cse5 .cse4) (and .cse0 .cse4))) is different from false [2019-09-10 01:39:40,762 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((v_SqrtR_~linf~0_19 Real) (v_SqrtR_~xnp1~0_20 Real)) (let ((.cse15 (* 2.0 v_SqrtR_~xnp1~0_20))) (let ((.cse14 (* c_~_EPS~0 .cse15))) (and (<= 0.0 (+ v_SqrtR_~linf~0_19 .cse14)) (not (<= (/ 1.0 v_SqrtR_~xnp1~0_20) 5.0)) (not (< (+ 2.0 .cse14) .cse15)) (<= (+ v_SqrtR_~linf~0_19 2.0) .cse15)))))) (.cse3 (forall ((v_prenex_14 Real) (v_prenex_13 Real)) (let ((.cse13 (* c_~_EPS~0 (+ v_prenex_14 (* 2.0 c_SqrtR_~xn~0))))) (or (not (<= 0.0 (+ v_prenex_13 .cse13))) (< v_prenex_14 v_prenex_13) (< .cse13 v_prenex_14) (<= (/ 1.0 (+ (* (/ 1.0 2.0) v_prenex_14) c_SqrtR_~xn~0)) 5.0))))) (.cse1 (exists ((v_prenex_11 Real) (v_prenex_10 Real)) (let ((.cse12 (* 2.0 v_prenex_11))) (let ((.cse11 (* c_~_EPS~0 .cse12))) (and (<= 0.0 (+ .cse11 v_prenex_10)) (not (<= (/ 9.0 10.0) (/ 1.0 v_prenex_11))) (<= (+ v_prenex_10 2.0) .cse12) (not (< (+ .cse11 2.0) .cse12))))))) (.cse5 (exists ((v_prenex_7 Real) (v_prenex_8 Real)) (let ((.cse10 (* 2.0 v_prenex_8))) (let ((.cse9 (* c_~_EPS~0 .cse10))) (and (<= 0.0 (+ .cse9 v_prenex_7)) (<= (+ v_prenex_7 2.0) .cse10) (not (< (+ .cse9 2.0) .cse10)) (not (<= (/ 9.0 10.0) (/ 1.0 v_prenex_8)))))))) (.cse0 (forall ((v_SqrtR_~linf~0_20 Real) (v_SqrtR_~residu~0_20 Real)) (let ((.cse8 (* c_~_EPS~0 (+ (* 2.0 c_SqrtR_~xn~0) v_SqrtR_~residu~0_20)))) (or (not (<= 0.0 (+ v_SqrtR_~linf~0_20 .cse8))) (<= (/ 9.0 10.0) (/ 1.0 (+ c_SqrtR_~xn~0 (* (/ 1.0 2.0) v_SqrtR_~residu~0_20)))) (< .cse8 v_SqrtR_~residu~0_20) (< v_SqrtR_~residu~0_20 v_SqrtR_~linf~0_20))))) (.cse4 (exists ((v_prenex_12 Real) (v_prenex_9 Real)) (let ((.cse7 (* 2.0 v_prenex_12))) (let ((.cse6 (* c_~_EPS~0 .cse7))) (and (not (< (+ 2.0 .cse6) .cse7)) (<= 0.0 (+ .cse6 v_prenex_9)) (not (<= (/ 1.0 v_prenex_12) 5.0)) (<= (+ v_prenex_9 2.0) .cse7))))))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse2 .cse4) (and .cse3 .cse5) (and .cse2 .cse1) (and .cse0 .cse3) (and .cse5 .cse1) (and .cse5 .cse4) (and .cse0 .cse4))) is different from true [2019-09-10 01:39:40,772 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-09-10 01:40:41,708 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 5120000 disjunctions. This might take some time...