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_poly_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:50:26,828 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:50:26,830 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:50:26,843 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:50:26,843 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:50:26,845 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:50:26,846 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:50:26,848 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:50:26,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:50:26,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:50:26,852 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:50:26,852 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:50:26,853 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:50:26,854 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:50:26,855 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:50:26,856 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:50:26,857 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:50:26,859 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:50:26,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:50:26,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:50:26,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:50:26,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:50:26,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:50:26,868 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:50:26,868 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:50:26,869 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:50:26,871 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:50:26,871 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:50:26,872 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:50:26,873 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:50:26,874 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:50:26,874 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:50:26,875 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:50:26,875 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:50:26,876 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:50:26,877 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:50:26,877 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 15:50:26,894 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:50:26,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:50:26,895 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:50:26,895 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:50:26,896 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:50:26,896 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:50:26,896 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:50:26,896 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:50:26,897 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:50:26,897 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:50:26,897 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:50:26,897 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:50:26,897 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:50:26,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:50:26,898 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:50:26,898 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:50:26,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:50:26,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:50:26,899 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:50:26,899 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:50:26,899 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:50:26,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:50:26,899 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:50:26,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:50:26,900 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:50:26,900 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:50:26,900 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:50:26,901 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:50:26,901 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:50:26,901 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:50:26,901 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:50:26,901 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:50:26,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:50:26,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:50:26,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:50:26,993 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:50:26,994 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:50:26,995 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_poly_true-unreach-call_true-termination.c [2018-09-19 15:50:27,378 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82bb95d3/768c91dd716f4b3790336f9e03497820/FLAGeeb44c9bc [2018-09-19 15:50:27,542 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:50:27,543 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_poly_true-unreach-call_true-termination.c [2018-09-19 15:50:27,550 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82bb95d3/768c91dd716f4b3790336f9e03497820/FLAGeeb44c9bc [2018-09-19 15:50:27,568 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82bb95d3/768c91dd716f4b3790336f9e03497820 [2018-09-19 15:50:27,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:50:27,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:50:27,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:50:27,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:50:27,592 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:50:27,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:50:27" (1/1) ... [2018-09-19 15:50:27,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463eb615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:27, skipping insertion in model container [2018-09-19 15:50:27,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:50:27" (1/1) ... [2018-09-19 15:50:27,608 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:50:27,848 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:50:27,872 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:50:27,881 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:50:27,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:27 WrapperNode [2018-09-19 15:50:27,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:50:27,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:50:27,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:50:27,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:50:27,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:27" (1/1) ... [2018-09-19 15:50:27,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:27" (1/1) ... [2018-09-19 15:50:27,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:27" (1/1) ... [2018-09-19 15:50:27,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:27" (1/1) ... [2018-09-19 15:50:27,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:27" (1/1) ... [2018-09-19 15:50:27,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:27" (1/1) ... [2018-09-19 15:50:27,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:27" (1/1) ... [2018-09-19 15:50:27,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:50:27,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:50:27,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:50:27,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:50:27,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:50:28,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:50:28,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:50:28,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:50:28,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:50:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:50:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 15:50:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-19 15:50:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:50:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:50:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:50:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:50:32,639 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:50:32,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:50:32 BoogieIcfgContainer [2018-09-19 15:50:32,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:50:32,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:50:32,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:50:32,656 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:50:32,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:50:27" (1/3) ... [2018-09-19 15:50:32,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3e5a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:50:32, skipping insertion in model container [2018-09-19 15:50:32,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:27" (2/3) ... [2018-09-19 15:50:32,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3e5a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:50:32, skipping insertion in model container [2018-09-19 15:50:32,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:50:32" (3/3) ... [2018-09-19 15:50:32,667 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_poly_true-unreach-call_true-termination.c [2018-09-19 15:50:32,680 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:50:32,692 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:50:32,798 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:50:32,799 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:50:32,799 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:50:32,799 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:50:32,799 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:50:32,799 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:50:32,807 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:50:32,807 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:50:32,807 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:50:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-09-19 15:50:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-19 15:50:32,837 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:50:32,838 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:50:32,840 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:50:32,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2111486095, now seen corresponding path program 1 times [2018-09-19 15:50:32,851 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:50:32,852 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:50:32,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:50:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:50:38,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:50:40,352 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 2.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq main_~I~0 .cse0) (fp.geq main_~I~0 .cse1) (fp.leq main_~I~0 ((_ to_fp 11 53) RNE 3.0)) (= (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse1 (let ((.cse2 (fp.sub RNE (fp.div RNE main_~I~0 .cse0) .cse1))) (fp.mul RNE .cse2 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse2)))))) c_main_~S~0)))) is different from false [2018-09-19 15:50:42,458 WARN L819 $PredicateComparison]: unable to prove that (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 2.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq main_~I~0 .cse0) (fp.geq main_~I~0 .cse1) (fp.leq main_~I~0 ((_ to_fp 11 53) RNE 3.0)) (= (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse1 (let ((.cse2 (fp.sub RNE (fp.div RNE main_~I~0 .cse0) .cse1))) (fp.mul RNE .cse2 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse2)))))) c_main_~S~0)))) is different from true [2018-09-19 15:50:59,724 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and .cse0 (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 2.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq v_prenex_1 .cse1) (fp.leq v_prenex_1 ((_ to_fp 11 53) RNE 3.0)) (not (fp.leq (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse2 (let ((.cse3 (fp.sub RNE (fp.div RNE v_prenex_1 .cse1) .cse2))) (fp.mul RNE .cse3 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse3)))))) .cse1)) (fp.geq v_prenex_1 .cse2))))) (and .cse0 (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE 2.0)) (.cse5 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq main_~I~0 .cse4) (fp.geq main_~I~0 .cse5) (not (fp.geq (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse5 (let ((.cse6 (fp.sub RNE (fp.div RNE main_~I~0 .cse4) .cse5))) (fp.mul RNE .cse6 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse6)))))) .cse5)) (fp.leq main_~I~0 ((_ to_fp 11 53) RNE 3.0)))))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) RNE 2.0)) (.cse7 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse9 (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse7 (let ((.cse10 (fp.sub RNE (fp.div RNE v_prenex_3 .cse8) .cse7))) (fp.mul RNE .cse10 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse10)))))))) (and (fp.geq v_prenex_3 .cse7) (fp.geq v_prenex_3 .cse8) (fp.leq .cse9 .cse8) (fp.geq .cse9 .cse7) (fp.leq v_prenex_3 ((_ to_fp 11 53) RNE 3.0))))))))) is different from false [2018-09-19 15:51:14,905 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 2.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq v_prenex_1 .cse1) (fp.leq v_prenex_1 ((_ to_fp 11 53) RNE 3.0)) (not (fp.leq (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse2 (let ((.cse3 (fp.sub RNE (fp.div RNE v_prenex_1 .cse1) .cse2))) (fp.mul RNE .cse3 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse3)))))) .cse1)) (fp.geq v_prenex_1 .cse2))))) (and (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) RNE 2.0)) (.cse4 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse6 (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse4 (let ((.cse7 (fp.sub RNE (fp.div RNE v_prenex_3 .cse5) .cse4))) (fp.mul RNE .cse7 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse7)))))))) (and (fp.geq v_prenex_3 .cse4) (fp.geq v_prenex_3 .cse5) (fp.leq .cse6 .cse5) (fp.geq .cse6 .cse4) (fp.leq v_prenex_3 ((_ to_fp 11 53) RNE 3.0)))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) RNE 2.0)) (.cse9 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq main_~I~0 .cse8) (fp.geq main_~I~0 .cse9) (not (fp.geq (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse9 (let ((.cse10 (fp.sub RNE (fp.div RNE main_~I~0 .cse8) .cse9))) (fp.mul RNE .cse10 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse10)))))) .cse9)) (fp.leq main_~I~0 ((_ to_fp 11 53) RNE 3.0)))))))) is different from false [2018-09-19 15:51:25,701 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 2.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq v_prenex_1 .cse0) (fp.leq v_prenex_1 ((_ to_fp 11 53) RNE 3.0)) (not (fp.leq (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse1 (let ((.cse2 (fp.sub RNE (fp.div RNE v_prenex_1 .cse0) .cse1))) (fp.mul RNE .cse2 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse2)))))) .cse0)) (fp.geq v_prenex_1 .cse1)))) (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 2.0)) (.cse4 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq main_~I~0 .cse3) (fp.geq main_~I~0 .cse4) (not (fp.geq (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse4 (let ((.cse5 (fp.sub RNE (fp.div RNE main_~I~0 .cse3) .cse4))) (fp.mul RNE .cse5 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse5)))))) .cse4)) (fp.leq main_~I~0 ((_ to_fp 11 53) RNE 3.0)))))) is different from false [2018-09-19 15:51:27,840 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 2.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq v_prenex_1 .cse0) (fp.leq v_prenex_1 ((_ to_fp 11 53) RNE 3.0)) (not (fp.leq (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse1 (let ((.cse2 (fp.sub RNE (fp.div RNE v_prenex_1 .cse0) .cse1))) (fp.mul RNE .cse2 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse2)))))) .cse0)) (fp.geq v_prenex_1 .cse1)))) (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 2.0)) (.cse4 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq main_~I~0 .cse3) (fp.geq main_~I~0 .cse4) (not (fp.geq (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse4 (let ((.cse5 (fp.sub RNE (fp.div RNE main_~I~0 .cse3) .cse4))) (fp.mul RNE .cse5 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse5)))))) .cse4)) (fp.leq main_~I~0 ((_ to_fp 11 53) RNE 3.0)))))) is different from true [2018-09-19 15:51:27,849 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:51:27,850 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:51:27,879 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:51:27,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-19 15:51:27,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 15:51:27,900 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 15:51:27,901 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=8, Unknown=6, NotChecked=28, Total=56 [2018-09-19 15:51:27,903 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 8 states. [2018-09-19 15:51:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:51:33,018 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-09-19 15:51:33,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 15:51:33,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-19 15:51:33,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:51:33,031 INFO L225 Difference]: With dead ends: 31 [2018-09-19 15:51:33,031 INFO L226 Difference]: Without dead ends: 12 [2018-09-19 15:51:33,035 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=14, Invalid=8, Unknown=6, NotChecked=28, Total=56 [2018-09-19 15:51:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-19 15:51:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-19 15:51:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-19 15:51:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2018-09-19 15:51:33,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 11 [2018-09-19 15:51:33,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:51:33,077 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2018-09-19 15:51:33,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 15:51:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2018-09-19 15:51:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-19 15:51:33,078 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:51:33,078 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:51:33,078 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:51:33,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2109639053, now seen corresponding path program 1 times [2018-09-19 15:51:33,079 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:51:33,079 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:51:33,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:51:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:51:39,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:51:41,760 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq main_~I~0 .cse0) (not (fp.geq main_~I~0 ((_ to_fp 11 53) RNE 2.0))) (= (fp.add RNE .cse0 (let ((.cse1 (fp.sub RNE main_~I~0 .cse0))) (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE .cse1 (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 8.0))) (fp.mul RNE .cse1 ((_ to_fp 11 53) RNE (/ 1.0 16.0))))))))) c_main_~S~0)))) is different from false [2018-09-19 15:51:43,904 WARN L819 $PredicateComparison]: unable to prove that (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq main_~I~0 .cse0) (not (fp.geq main_~I~0 ((_ to_fp 11 53) RNE 2.0))) (= (fp.add RNE .cse0 (let ((.cse1 (fp.sub RNE main_~I~0 .cse0))) (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE .cse1 (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 8.0))) (fp.mul RNE .cse1 ((_ to_fp 11 53) RNE (/ 1.0 16.0))))))))) c_main_~S~0)))) is different from true [2018-09-19 15:52:01,223 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and .cse0 (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0)) (.cse3 ((_ to_fp 11 53) RNE 2.0))) (and (not (fp.leq (fp.add RNE .cse1 (let ((.cse2 (fp.sub RNE main_~I~0 .cse1))) (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE .cse2 (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 8.0))) (fp.mul RNE .cse2 ((_ to_fp 11 53) RNE (/ 1.0 16.0))))))))) .cse3)) (fp.geq main_~I~0 .cse1) (not (fp.geq main_~I~0 .cse3)))))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_7 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse5 (fp.add RNE .cse4 (let ((.cse7 (fp.sub RNE v_prenex_7 .cse4))) (fp.mul RNE .cse7 (fp.add RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE .cse7 (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 8.0))) (fp.mul RNE .cse7 ((_ to_fp 11 53) RNE (/ 1.0 16.0)))))))))) (.cse6 ((_ to_fp 11 53) RNE 2.0))) (and (fp.geq v_prenex_7 .cse4) (fp.geq .cse5 .cse4) (fp.leq .cse5 .cse6) (not (fp.geq v_prenex_7 .cse6))))))) (and (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) RNE 1.0))) (and (not (fp.geq v_prenex_5 ((_ to_fp 11 53) RNE 2.0))) (not (fp.geq (fp.add RNE .cse8 (let ((.cse9 (fp.sub RNE v_prenex_5 .cse8))) (fp.mul RNE .cse9 (fp.add RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE .cse9 (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 8.0))) (fp.mul RNE .cse9 ((_ to_fp 11 53) RNE (/ 1.0 16.0))))))))) .cse8)) (fp.geq v_prenex_5 .cse8)))) .cse0))) is different from false [2018-09-19 15:52:14,110 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (not (fp.geq v_prenex_5 ((_ to_fp 11 53) RNE 2.0))) (not (fp.geq (fp.add RNE .cse1 (let ((.cse2 (fp.sub RNE v_prenex_5 .cse1))) (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE .cse2 (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 8.0))) (fp.mul RNE .cse2 ((_ to_fp 11 53) RNE (/ 1.0 16.0))))))))) .cse1)) (fp.geq v_prenex_5 .cse1))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (and .cse0 (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0)) (.cse5 ((_ to_fp 11 53) RNE 2.0))) (and (not (fp.leq (fp.add RNE .cse3 (let ((.cse4 (fp.sub RNE main_~I~0 .cse3))) (fp.mul RNE .cse4 (fp.add RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE .cse4 (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 8.0))) (fp.mul RNE .cse4 ((_ to_fp 11 53) RNE (/ 1.0 16.0))))))))) .cse5)) (fp.geq main_~I~0 .cse3) (not (fp.geq main_~I~0 .cse5)))))))) is different from false [2018-09-19 15:52:24,956 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (not (fp.geq v_prenex_5 ((_ to_fp 11 53) RNE 2.0))) (not (fp.geq (fp.add RNE .cse0 (let ((.cse1 (fp.sub RNE v_prenex_5 .cse0))) (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE .cse1 (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 8.0))) (fp.mul RNE .cse1 ((_ to_fp 11 53) RNE (/ 1.0 16.0))))))))) .cse0)) (fp.geq v_prenex_5 .cse0)))) (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse4 ((_ to_fp 11 53) RNE 2.0))) (and (not (fp.leq (fp.add RNE .cse2 (let ((.cse3 (fp.sub RNE main_~I~0 .cse2))) (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE .cse3 (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 8.0))) (fp.mul RNE .cse3 ((_ to_fp 11 53) RNE (/ 1.0 16.0))))))))) .cse4)) (fp.geq main_~I~0 .cse2) (not (fp.geq main_~I~0 .cse4)))))) is different from false [2018-09-19 15:52:27,085 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (not (fp.geq v_prenex_5 ((_ to_fp 11 53) RNE 2.0))) (not (fp.geq (fp.add RNE .cse0 (let ((.cse1 (fp.sub RNE v_prenex_5 .cse0))) (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE .cse1 (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 8.0))) (fp.mul RNE .cse1 ((_ to_fp 11 53) RNE (/ 1.0 16.0))))))))) .cse0)) (fp.geq v_prenex_5 .cse0)))) (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse4 ((_ to_fp 11 53) RNE 2.0))) (and (not (fp.leq (fp.add RNE .cse2 (let ((.cse3 (fp.sub RNE main_~I~0 .cse2))) (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE .cse3 (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 8.0))) (fp.mul RNE .cse3 ((_ to_fp 11 53) RNE (/ 1.0 16.0))))))))) .cse4)) (fp.geq main_~I~0 .cse2) (not (fp.geq main_~I~0 .cse4)))))) is different from true [2018-09-19 15:52:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:52:27,089 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:52:27,115 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:52:27,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 15:52:27,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-19 15:52:27,117 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-19 15:52:27,117 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=5, Unknown=6, NotChecked=20, Total=42 [2018-09-19 15:52:27,118 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand 7 states. [2018-09-19 15:52:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:52:29,421 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2018-09-19 15:52:29,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 15:52:29,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-19 15:52:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:52:29,564 INFO L225 Difference]: With dead ends: 12 [2018-09-19 15:52:29,564 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 15:52:29,565 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=11, Invalid=5, Unknown=6, NotChecked=20, Total=42 [2018-09-19 15:52:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 15:52:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 15:52:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 15:52:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 15:52:29,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-09-19 15:52:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:52:29,567 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 15:52:29,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-19 15:52:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 15:52:29,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 15:52:29,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 15:52:46,432 WARN L178 SmtUtils]: Spent 16.75 s on a formula simplification. DAG size of input: 154 DAG size of output: 1 [2018-09-19 15:53:01,519 WARN L178 SmtUtils]: Spent 15.08 s on a formula simplification that was a NOOP. DAG size: 46 [2018-09-19 15:53:01,521 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 15:53:01,522 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 15:53:01,522 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 15:53:01,522 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 15:53:01,522 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) ~sqrt2~0) [2018-09-19 15:53:01,522 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 15:53:01,522 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 15:53:01,523 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 15 27) the Hoare annotation is: true [2018-09-19 15:53:01,523 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 15 27) no Hoare annotation was computed. [2018-09-19 15:53:01,523 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-19 15:53:01,523 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 15 27) no Hoare annotation was computed. [2018-09-19 15:53:01,523 INFO L426 ceAbstractionStarter]: For program point L22(lines 22 23) no Hoare annotation was computed. [2018-09-19 15:53:01,524 INFO L422 ceAbstractionStarter]: At program point L22-2(lines 22 23) the Hoare annotation is: (or (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq main_~I~0 .cse0) (not (fp.geq main_~I~0 ((_ to_fp 11 53) RNE 2.0))) (= (fp.add RNE .cse0 (let ((.cse1 (fp.sub RNE main_~I~0 .cse0))) (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE .cse1 (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE (/ 1.0 8.0))) (fp.mul RNE .cse1 ((_ to_fp 11 53) RNE (/ 1.0 16.0))))))))) main_~S~0)))) (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 2.0)) (.cse3 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq main_~I~0 .cse2) (fp.geq main_~I~0 .cse3) (fp.leq main_~I~0 ((_ to_fp 11 53) RNE 3.0)) (= (fp.mul RNE ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) (fp.add RNE .cse3 (let ((.cse4 (fp.sub RNE (fp.div RNE main_~I~0 .cse2) .cse3))) (fp.mul RNE .cse4 (fp.sub RNE ((_ to_fp 11 53) RNE (/ 1.0 2.0)) (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 8.0)) .cse4)))))) main_~S~0)))) (not (= ((_ to_fp 11 53) RNE (/ 11863283.0 8388608.0)) ~sqrt2~0))) [2018-09-19 15:53:01,524 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2018-09-19 15:53:01,525 INFO L429 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 11) the Hoare annotation is: true [2018-09-19 15:53:01,525 INFO L426 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2018-09-19 15:53:01,525 INFO L426 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2018-09-19 15:53:01,525 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 11) no Hoare annotation was computed. [2018-09-19 15:53:01,525 INFO L426 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2018-09-19 15:53:01,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:53:01 BoogieIcfgContainer [2018-09-19 15:53:01,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:53:01,530 INFO L168 Benchmark]: Toolchain (without parser) took 153950.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -682.1 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:01,532 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:53:01,532 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.62 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:01,533 INFO L168 Benchmark]: Boogie Preprocessor took 43.17 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:01,534 INFO L168 Benchmark]: RCFGBuilder took 4695.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.5 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:01,535 INFO L168 Benchmark]: TraceAbstraction took 148887.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 90.8 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:01,539 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 316.62 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 43.17 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 4695.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.5 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 148887.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 90.8 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 148.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 31.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 2 SDslu, 62 SDs, 0 SdLazy, 4 SolverSat, 0 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 7 PreInvPairs, 8 NumberOfFragments, 137 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1034 FormulaSimplificationTreeSizeReductionInter, 31.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 11.5s SatisfiabilityAnalysisTime, 97.4s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 8 QuantifiedInterpolants, 13240 SizeOfPredicates, 7 NumberOfNonLiveVariables, 44 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...