java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_constant_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:49:16,118 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:49:16,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:49:16,145 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:49:16,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:49:16,148 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:49:16,150 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:49:16,154 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:49:16,158 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:49:16,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:49:16,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:49:16,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:49:16,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:49:16,173 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:49:16,174 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:49:16,175 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:49:16,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:49:16,183 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:49:16,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:49:16,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:49:16,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:49:16,195 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:49:16,197 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:49:16,197 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:49:16,197 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:49:16,198 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:49:16,199 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:49:16,200 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:49:16,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:49:16,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:49:16,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:49:16,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:49:16,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:49:16,203 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:49:16,204 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:49:16,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:49:16,205 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 15:49:16,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:49:16,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:49:16,221 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:49:16,221 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:49:16,222 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:49:16,222 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:49:16,222 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:49:16,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:49:16,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:49:16,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:49:16,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:49:16,223 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:49:16,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:49:16,224 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:49:16,224 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:49:16,224 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:49:16,224 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:49:16,225 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:49:16,225 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:49:16,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:49:16,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:49:16,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:49:16,226 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:49:16,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:49:16,226 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:49:16,226 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:49:16,226 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:49:16,227 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:49:16,227 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:49:16,227 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:49:16,227 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:49:16,227 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:49:16,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:49:16,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:49:16,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:49:16,295 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:49:16,295 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:49:16,296 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-09-19 15:49:16,684 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afd27d4c6/49ec6409bbca4867a7c7baa364345cb3/FLAG2f10f83ef [2018-09-19 15:49:16,882 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:49:16,882 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-09-19 15:49:16,888 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afd27d4c6/49ec6409bbca4867a7c7baa364345cb3/FLAG2f10f83ef [2018-09-19 15:49:16,902 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afd27d4c6/49ec6409bbca4867a7c7baa364345cb3 [2018-09-19 15:49:16,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:49:16,915 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:49:16,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:49:16,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:49:16,923 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:49:16,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:49:16" (1/1) ... [2018-09-19 15:49:16,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428e54a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:16, skipping insertion in model container [2018-09-19 15:49:16,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:49:16" (1/1) ... [2018-09-19 15:49:16,940 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:49:17,170 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:49:17,194 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:49:17,210 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:49:17,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:17 WrapperNode [2018-09-19 15:49:17,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:49:17,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:49:17,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:49:17,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:49:17,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:17" (1/1) ... [2018-09-19 15:49:17,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:17" (1/1) ... [2018-09-19 15:49:17,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:17" (1/1) ... [2018-09-19 15:49:17,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:17" (1/1) ... [2018-09-19 15:49:17,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:17" (1/1) ... [2018-09-19 15:49:17,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:17" (1/1) ... [2018-09-19 15:49:17,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:17" (1/1) ... [2018-09-19 15:49:17,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:49:17,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:49:17,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:49:17,301 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:49:17,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:49:17,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:49:17,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:49:17,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:49:17,395 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-09-19 15:49:17,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:49:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:49:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 15:49:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-19 15:49:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:49:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-09-19 15:49:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:49:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:49:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:49:27,179 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:49:27,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:49:27 BoogieIcfgContainer [2018-09-19 15:49:27,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:49:27,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:49:27,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:49:27,184 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:49:27,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:49:16" (1/3) ... [2018-09-19 15:49:27,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0a167e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:49:27, skipping insertion in model container [2018-09-19 15:49:27,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:17" (2/3) ... [2018-09-19 15:49:27,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0a167e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:49:27, skipping insertion in model container [2018-09-19 15:49:27,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:49:27" (3/3) ... [2018-09-19 15:49:27,189 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-09-19 15:49:27,199 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:49:27,208 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:49:27,258 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:49:27,259 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:49:27,259 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:49:27,260 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:49:27,260 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:49:27,260 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:49:27,260 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:49:27,261 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:49:27,261 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:49:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-09-19 15:49:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-19 15:49:27,290 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:49:27,292 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:49:27,295 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:49:27,300 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-09-19 15:49:27,306 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:49:27,307 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 15:49:27,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:49:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:49:28,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:49:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:49:28,827 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:49:28,863 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:49:28,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:49:28,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:49:28,881 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:49:28,883 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:49:28,886 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-09-19 15:49:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:49:28,912 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-09-19 15:49:28,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:49:28,914 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-09-19 15:49:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:49:28,924 INFO L225 Difference]: With dead ends: 56 [2018-09-19 15:49:28,924 INFO L226 Difference]: Without dead ends: 26 [2018-09-19 15:49:28,928 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:49:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-19 15:49:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-19 15:49:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-19 15:49:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-09-19 15:49:28,968 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-09-19 15:49:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:49:28,969 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-09-19 15:49:28,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:49:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-09-19 15:49:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-19 15:49:28,970 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:49:28,970 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:49:28,971 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:49:28,971 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-09-19 15:49:28,972 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:49:28,972 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 15:49:28,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:49:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:49:30,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:49:40,991 WARN L178 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-09-19 15:49:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:49:40,999 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:49:41,036 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:49:41,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 15:49:41,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 15:49:41,039 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 15:49:41,039 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 15:49:41,040 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-09-19 15:49:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:49:48,401 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-09-19 15:49:48,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 15:49:48,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-09-19 15:49:48,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:49:48,404 INFO L225 Difference]: With dead ends: 49 [2018-09-19 15:49:48,405 INFO L226 Difference]: Without dead ends: 29 [2018-09-19 15:49:48,407 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 15:49:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-19 15:49:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-19 15:49:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-19 15:49:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-09-19 15:49:48,414 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-09-19 15:49:48,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:49:48,414 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-09-19 15:49:48,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 15:49:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-09-19 15:49:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-19 15:49:48,416 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:49:48,416 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:49:48,417 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:49:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash 502189223, now seen corresponding path program 1 times [2018-09-19 15:49:48,417 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:49:48,417 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 15:49:48,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:49:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:49:50,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:49:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:49:50,891 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:49:50,926 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:49:50,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 15:49:50,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 15:49:50,927 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 15:49:50,928 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-19 15:49:50,928 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2018-09-19 15:49:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:49:59,421 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-09-19 15:49:59,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 15:49:59,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-09-19 15:49:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:49:59,428 INFO L225 Difference]: With dead ends: 63 [2018-09-19 15:49:59,428 INFO L226 Difference]: Without dead ends: 40 [2018-09-19 15:49:59,430 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-19 15:49:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-19 15:49:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-09-19 15:49:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-19 15:49:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-09-19 15:49:59,451 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 22 [2018-09-19 15:49:59,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:49:59,452 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-09-19 15:49:59,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 15:49:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-09-19 15:49:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-19 15:49:59,454 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:49:59,455 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:49:59,455 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:49:59,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1812175119, now seen corresponding path program 1 times [2018-09-19 15:49:59,456 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:49:59,456 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 15:49:59,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:50:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:50:03,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:50:05,858 WARN L797 $PredicateComparison]: unable to prove that (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xnp1~0) is different from false [2018-09-19 15:50:08,029 WARN L819 $PredicateComparison]: unable to prove that (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xnp1~0) is different from true [2018-09-19 15:50:10,582 WARN L797 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))))) is different from false [2018-09-19 15:50:13,180 WARN L819 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))))) is different from true [2018-09-19 15:50:13,561 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 5 [2018-09-19 15:50:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-09-19 15:50:13,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:50:37,739 WARN L178 SmtUtils]: Spent 23.81 s on a formula simplification that was a NOOP. DAG size: 33 [2018-09-19 15:50:56,041 WARN L178 SmtUtils]: Spent 18.30 s on a formula simplification that was a NOOP. DAG size: 31 [2018-09-19 15:51:21,977 WARN L178 SmtUtils]: Spent 25.93 s on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 15:51:47,951 WARN L178 SmtUtils]: Spent 25.97 s on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 15:51:50,538 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2018-09-19 15:51:53,149 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2018-09-19 15:51:55,730 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))) is different from false [2018-09-19 15:51:58,314 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))) is different from true [2018-09-19 15:52:01,308 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse3 .cse1) (fp.geq .cse3 .cse2)))))) is different from false [2018-09-19 15:52:04,314 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse3 .cse1) (fp.geq .cse3 .cse2)))))) is different from true [2018-09-19 15:52:07,970 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) is different from false [2018-09-19 15:52:11,339 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) is different from true [2018-09-19 15:52:14,517 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1)))))) is different from false [2018-09-19 15:52:17,633 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1)))))) is different from true [2018-09-19 15:52:20,201 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.div RNE .cse3 (fp.div RNE (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) RNE 8.0))))) (let ((.cse1 (fp.geq .cse2 .cse3)) (.cse0 (fp.leq .cse2 ((_ to_fp 11 53) RNE 5.0)))) (or (not .cse0) (not .cse1) (and .cse1 .cse0))))) is different from false [2018-09-19 15:52:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-09-19 15:52:20,333 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:52:20,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-09-19 15:52:20,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-19 15:52:20,334 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-19 15:52:20,337 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=128, Unknown=14, NotChecked=196, Total=380 [2018-09-19 15:52:20,338 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 20 states. [2018-09-19 15:52:22,989 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~d~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~d~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))))) (and (= .cse0 c_main_~d~0) (fp.leq .cse1 ((_ to_fp 11 53) RNE 5.0)) (fp.geq .cse1 .cse0)))) is different from true [2018-09-19 15:52:25,598 WARN L797 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1))))))) is different from false [2018-09-19 15:52:28,699 WARN L819 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1))))))) is different from true [2018-09-19 15:52:31,264 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (= .cse1 c_SqrtR_~xn~0))) is different from false [2018-09-19 15:52:34,786 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (= .cse1 c_SqrtR_~xn~0))) is different from true [2018-09-19 15:52:37,369 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) RNE 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse1 (fp.div RNE .cse3 .cse0)) (.cse2 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse3)) (let ((.cse4 (fp.div RNE .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse4 .cse2) (fp.geq .cse4 .cse3)))))))) is different from false [2018-09-19 15:52:40,362 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) RNE 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse1 (fp.div RNE .cse3 .cse0)) (.cse2 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse3)) (let ((.cse4 (fp.div RNE .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse4 .cse2) (fp.geq .cse4 .cse3)))))))) is different from true [2018-09-19 15:52:48,143 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0))))) (and (= |c_SqrtR_#res| .cse0) (let ((.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))))) is different from false [2018-09-19 15:52:50,723 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0))))) (and (= |c_SqrtR_#res| .cse0) (let ((.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))))) is different from true [2018-09-19 15:52:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:52:51,229 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-09-19 15:52:51,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 15:52:51,230 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-09-19 15:52:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:52:51,232 INFO L225 Difference]: With dead ends: 55 [2018-09-19 15:52:51,232 INFO L226 Difference]: Without dead ends: 53 [2018-09-19 15:52:51,233 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 68.1s TimeCoverageRelationStatistics Valid=58, Invalid=149, Unknown=23, NotChecked=420, Total=650 [2018-09-19 15:52:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-19 15:52:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-09-19 15:52:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-19 15:52:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-09-19 15:52:51,249 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 24 [2018-09-19 15:52:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:52:51,250 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-09-19 15:52:51,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-19 15:52:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-09-19 15:52:51,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-19 15:52:51,251 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:52:51,251 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:52:51,252 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:52:51,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1272086197, now seen corresponding path program 2 times [2018-09-19 15:52:51,253 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:52:51,253 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 15:52:51,257 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-19 15:52:57,439 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-19 15:52:57,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:52:58,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:53:00,352 WARN L797 $PredicateComparison]: unable to prove that (and (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from false [2018-09-19 15:53:02,487 WARN L819 $PredicateComparison]: unable to prove that (and (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from true [2018-09-19 15:53:04,994 WARN L797 $PredicateComparison]: unable to prove that (= (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse1 ((_ to_fp 11 53) RNE 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse3 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div RNE (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse4 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul RNE .cse0 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse0) .cse0))))))) .cse5)) c_SqrtR_~xnp1~0) is different from false [2018-09-19 15:53:07,495 WARN L819 $PredicateComparison]: unable to prove that (= (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse1 ((_ to_fp 11 53) RNE 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse3 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div RNE (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse4 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul RNE .cse0 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse0) .cse0))))))) .cse5)) c_SqrtR_~xnp1~0) is different from true [2018-09-19 15:53:10,419 WARN L797 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))))) is different from false [2018-09-19 15:53:13,296 WARN L819 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))))) is different from true [2018-09-19 15:53:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-09-19 15:53:13,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:53:48,696 WARN L178 SmtUtils]: Spent 35.07 s on a formula simplification that was a NOOP. DAG size: 46 [2018-09-19 15:53:53,140 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-09-19 15:53:53,341 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2018-09-19 15:53:53,343 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.push(DiffWrapperScript.java:93) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.push(WrapperScript.java:101) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UndoableWrapperScript.push(UndoableWrapperScript.java:52) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:149) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition(TransFormulaUtils.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeSummaryForInterproceduralTrace(IterativePredicateTransformer.java:563) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeProcedureSummary(IterativePredicateTransformer.java:483) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 46 more [2018-09-19 15:53:53,348 INFO L168 Benchmark]: Toolchain (without parser) took 276434.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.6 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -543.0 MB). Peak memory consumption was 171.6 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:53,349 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:53:53,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:53,351 INFO L168 Benchmark]: Boogie Preprocessor took 66.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:53:53,351 INFO L168 Benchmark]: RCFGBuilder took 9882.11 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -758.5 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:53,352 INFO L168 Benchmark]: TraceAbstraction took 266165.94 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 204.9 MB). Peak memory consumption was 204.9 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:53,357 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 314.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 9882.11 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -758.5 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 266165.94 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 204.9 MB). Peak memory consumption was 204.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...