./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 ................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:18:34,034 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:18:34,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:18:34,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:18:34,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:18:34,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:18:34,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:18:34,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:18:34,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:18:34,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:18:34,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:18:34,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:18:34,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:18:34,048 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:18:34,049 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:18:34,049 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:18:34,050 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:18:34,051 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:18:34,052 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:18:34,053 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:18:34,054 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:18:34,055 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:18:34,056 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:18:34,057 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:18:34,057 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:18:34,058 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:18:34,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:18:34,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:18:34,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:18:34,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:18:34,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:18:34,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:18:34,060 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:18:34,060 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:18:34,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:18:34,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:18:34,061 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 11:18:34,073 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:18:34,073 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:18:34,074 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:18:34,074 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 11:18:34,074 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 11:18:34,074 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 11:18:34,074 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 11:18:34,074 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 11:18:34,075 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 11:18:34,075 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 11:18:34,075 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 11:18:34,075 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 11:18:34,075 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 11:18:34,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:18:34,076 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:18:34,076 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:18:34,076 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:18:34,076 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:18:34,076 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:18:34,077 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:18:34,077 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:18:34,077 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:18:34,077 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:18:34,077 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:18:34,077 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:18:34,077 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:18:34,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:18:34,078 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:18:34,078 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:18:34,078 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:18:34,078 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:18:34,078 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:18:34,078 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:18:34,079 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 11:18:34,079 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:18:34,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:18:34,079 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 11:18:34,079 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2018-11-18 11:18:34,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:18:34,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:18:34,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:18:34,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:18:34,121 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:18:34,122 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-18 11:18:34,171 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/data/774b3a688/4ca6b6e2dfad402191a600d8875965e0/FLAG536202d05 [2018-11-18 11:18:34,511 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:18:34,511 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-18 11:18:34,517 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/data/774b3a688/4ca6b6e2dfad402191a600d8875965e0/FLAG536202d05 [2018-11-18 11:18:34,933 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/data/774b3a688/4ca6b6e2dfad402191a600d8875965e0 [2018-11-18 11:18:34,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:18:34,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:18:34,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:18:34,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:18:34,939 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:18:34,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:18:34" (1/1) ... [2018-11-18 11:18:34,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5639ae20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:34, skipping insertion in model container [2018-11-18 11:18:34,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:18:34" (1/1) ... [2018-11-18 11:18:34,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:18:34,963 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:18:35,078 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:18:35,082 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:18:35,094 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:18:35,103 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:18:35,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:35 WrapperNode [2018-11-18 11:18:35,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:18:35,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:18:35,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:18:35,104 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:18:35,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:35" (1/1) ... [2018-11-18 11:18:35,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:35" (1/1) ... [2018-11-18 11:18:35,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:18:35,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:18:35,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:18:35,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:18:35,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:35" (1/1) ... [2018-11-18 11:18:35,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:35" (1/1) ... [2018-11-18 11:18:35,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:35" (1/1) ... [2018-11-18 11:18:35,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:35" (1/1) ... [2018-11-18 11:18:35,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:35" (1/1) ... [2018-11-18 11:18:35,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:35" (1/1) ... [2018-11-18 11:18:35,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:35" (1/1) ... [2018-11-18 11:18:35,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:18:35,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:18:35,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:18:35,133 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:18:35,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/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-11-18 11:18:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:18:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:18:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-18 11:18:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-18 11:18:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:18:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:18:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:18:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:18:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 11:18:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 11:18:35,338 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:18:35,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:18:35 BoogieIcfgContainer [2018-11-18 11:18:35,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:18:35,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:18:35,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:18:35,342 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:18:35,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:18:34" (1/3) ... [2018-11-18 11:18:35,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:18:35, skipping insertion in model container [2018-11-18 11:18:35,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:35" (2/3) ... [2018-11-18 11:18:35,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:18:35, skipping insertion in model container [2018-11-18 11:18:35,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:18:35" (3/3) ... [2018-11-18 11:18:35,346 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-11-18 11:18:35,355 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:18:35,362 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:18:35,375 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:18:35,404 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:18:35,404 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:18:35,404 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:18:35,404 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:18:35,404 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:18:35,404 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:18:35,405 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:18:35,405 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:18:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-18 11:18:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 11:18:35,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:18:35,426 INFO L375 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-11-18 11:18:35,427 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:18:35,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:18:35,431 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-11-18 11:18:35,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:18:35,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:18:35,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:18:35,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:18:35,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:18:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:18:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:18:35,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:18:35,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:18:35,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:18:35,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 11:18:35,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:18:35,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:18:35,538 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-18 11:18:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:18:35,551 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-18 11:18:35,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:18:35,553 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-18 11:18:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:18:35,558 INFO L225 Difference]: With dead ends: 56 [2018-11-18 11:18:35,558 INFO L226 Difference]: Without dead ends: 26 [2018-11-18 11:18:35,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11-18 11:18:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-18 11:18:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-18 11:18:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 11:18:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-18 11:18:35,588 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-11-18 11:18:35,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:18:35,588 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-18 11:18:35,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 11:18:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-18 11:18:35,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:18:35,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:18:35,589 INFO L375 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-11-18 11:18:35,590 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:18:35,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:18:35,590 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-11-18 11:18:35,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:18:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:18:35,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:18:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:18:35,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:18:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:18:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:18:35,625 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 11:18:35,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:18:35 BoogieIcfgContainer [2018-11-18 11:18:35,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:18:35,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:18:35,646 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:18:35,646 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:18:35,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:18:35" (3/4) ... [2018-11-18 11:18:35,649 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:18:35,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:18:35,650 INFO L168 Benchmark]: Toolchain (without parser) took 714.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -139.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:18:35,651 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:18:35,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.74 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:18:35,652 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.57 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:18:35,653 INFO L168 Benchmark]: Boogie Preprocessor took 14.63 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:18:35,653 INFO L168 Benchmark]: RCFGBuilder took 205.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:18:35,654 INFO L168 Benchmark]: TraceAbstraction took 306.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:18:35,654 INFO L168 Benchmark]: Witness Printer took 3.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:18:35,657 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.74 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.57 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.63 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 205.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 306.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 15]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L17] double _EPS = 1e-6; VAL [\old(_EPS)=2, _EPS=1/1000000] [L44] double d, r; [L46] d = 1. VAL [_EPS=1/1000000, d=1] [L46] COND TRUE d <= 20. VAL [_EPS=1/1000000, d=1] [L48] CALL, EXPR SqrtR(d) VAL [\old(Input)=1, _EPS=1/1000000] [L21] double xn, xnp1, residu, lsup, linf; [L22] int i, cond; VAL [\old(Input)=1, _EPS=1/1000000, Input=1] [L23] COND TRUE Input <= 1.0 [L23] xn = 1.0 VAL [\old(Input)=1, _EPS=1/1000000, Input=1, xn=1] [L24] xnp1 = xn [L25] residu = 2.0*_EPS*(xn+xnp1) [L26] lsup = _EPS * (xn+xnp1) [L27] linf = -lsup [L28] cond = ((residu > lsup) || (residu < linf)) [L29] i = 0 VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L30] COND FALSE !(\read(cond)) VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L39] RET return 1.0 / xnp1; VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L48] EXPR SqrtR(d) VAL [_EPS=1/1000000, d=1, SqrtR(d)=3] [L48] r = SqrtR(d) [L50] CALL __VERIFIER_assert(r >= 1.0 && r <= 5.0) VAL [\old(cond)=0, _EPS=1/1000000] [L15] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L15] __VERIFIER_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 11:18:37,173 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:18:37,174 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:18:37,184 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:18:37,185 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:18:37,186 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:18:37,187 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:18:37,188 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:18:37,193 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:18:37,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:18:37,195 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:18:37,195 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:18:37,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:18:37,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:18:37,198 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:18:37,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:18:37,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:18:37,200 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:18:37,202 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:18:37,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:18:37,204 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:18:37,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:18:37,207 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:18:37,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:18:37,208 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:18:37,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:18:37,210 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:18:37,210 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:18:37,211 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:18:37,212 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:18:37,212 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:18:37,213 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:18:37,213 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:18:37,213 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:18:37,214 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:18:37,215 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:18:37,215 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 11:18:37,227 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:18:37,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:18:37,228 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:18:37,228 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 11:18:37,228 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 11:18:37,228 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 11:18:37,228 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 11:18:37,228 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 11:18:37,229 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 11:18:37,229 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 11:18:37,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:18:37,229 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:18:37,230 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:18:37,230 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:18:37,230 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:18:37,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:18:37,230 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:18:37,230 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 11:18:37,230 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 11:18:37,231 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:18:37,231 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:18:37,231 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:18:37,231 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:18:37,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:18:37,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:18:37,232 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:18:37,232 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:18:37,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:18:37,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:18:37,232 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:18:37,232 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:18:37,232 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 11:18:37,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:18:37,235 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 11:18:37,235 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 11:18:37,235 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2018-11-18 11:18:37,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:18:37,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:18:37,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:18:37,284 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:18:37,285 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:18:37,285 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-18 11:18:37,331 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/data/8925fb89b/ee0394768af34f1ca8c317048bf5445e/FLAGd9d7ce988 [2018-11-18 11:18:37,673 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:18:37,673 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-18 11:18:37,677 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/data/8925fb89b/ee0394768af34f1ca8c317048bf5445e/FLAGd9d7ce988 [2018-11-18 11:18:37,690 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/data/8925fb89b/ee0394768af34f1ca8c317048bf5445e [2018-11-18 11:18:37,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:18:37,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:18:37,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:18:37,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:18:37,697 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:18:37,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:18:37" (1/1) ... [2018-11-18 11:18:37,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150a44a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37, skipping insertion in model container [2018-11-18 11:18:37,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:18:37" (1/1) ... [2018-11-18 11:18:37,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:18:37,729 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:18:37,860 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:18:37,865 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:18:37,883 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:18:37,895 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:18:37,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37 WrapperNode [2018-11-18 11:18:37,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:18:37,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:18:37,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:18:37,896 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:18:37,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37" (1/1) ... [2018-11-18 11:18:37,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37" (1/1) ... [2018-11-18 11:18:37,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:18:37,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:18:37,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:18:37,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:18:37,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37" (1/1) ... [2018-11-18 11:18:37,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37" (1/1) ... [2018-11-18 11:18:37,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37" (1/1) ... [2018-11-18 11:18:37,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37" (1/1) ... [2018-11-18 11:18:37,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37" (1/1) ... [2018-11-18 11:18:37,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37" (1/1) ... [2018-11-18 11:18:37,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37" (1/1) ... [2018-11-18 11:18:37,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:18:37,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:18:37,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:18:37,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:18:37,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/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-11-18 11:18:38,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:18:38,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:18:38,029 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-18 11:18:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-18 11:18:38,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:18:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:18:38,029 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:18:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:18:38,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 11:18:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 11:18:46,366 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:18:46,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:18:46 BoogieIcfgContainer [2018-11-18 11:18:46,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:18:46,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:18:46,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:18:46,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:18:46,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:18:37" (1/3) ... [2018-11-18 11:18:46,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b5fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:18:46, skipping insertion in model container [2018-11-18 11:18:46,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:37" (2/3) ... [2018-11-18 11:18:46,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b5fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:18:46, skipping insertion in model container [2018-11-18 11:18:46,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:18:46" (3/3) ... [2018-11-18 11:18:46,374 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-11-18 11:18:46,383 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:18:46,390 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:18:46,406 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:18:46,428 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:18:46,428 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:18:46,428 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:18:46,428 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:18:46,429 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:18:46,429 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:18:46,429 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:18:46,429 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:18:46,429 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:18:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-18 11:18:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 11:18:46,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:18:46,446 INFO L375 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-11-18 11:18:46,448 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:18:46,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:18:46,452 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-11-18 11:18:46,454 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 11:18:46,454 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/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-11-18 11:18:46,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:18:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:18:47,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:18:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:18:47,785 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:18:47,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:18:47,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:18:47,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 11:18:47,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:18:47,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:18:47,835 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-18 11:18:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:18:47,852 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-18 11:18:47,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:18:47,854 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-18 11:18:47,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:18:47,859 INFO L225 Difference]: With dead ends: 56 [2018-11-18 11:18:47,859 INFO L226 Difference]: Without dead ends: 26 [2018-11-18 11:18:47,862 INFO L604 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-11-18 11:18:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-18 11:18:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-18 11:18:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 11:18:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-18 11:18:47,888 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-11-18 11:18:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:18:47,888 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-18 11:18:47,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 11:18:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-18 11:18:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:18:47,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:18:47,890 INFO L375 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-11-18 11:18:47,890 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:18:47,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:18:47,890 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-11-18 11:18:47,891 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 11:18:47,891 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/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-11-18 11:18:47,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:18:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:18:49,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:18:57,108 WARN L180 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-11-18 11:18:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:18:57,113 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:18:57,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:18:57,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:18:57,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:18:57,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:18:57,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:18:57,139 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-18 11:19:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:19:07,465 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-18 11:19:07,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:19:07,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 11:19:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:19:07,468 INFO L225 Difference]: With dead ends: 54 [2018-11-18 11:19:07,468 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 11:19:07,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:19:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 11:19:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-11-18 11:19:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 11:19:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-18 11:19:07,475 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-11-18 11:19:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:19:07,475 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 11:19:07,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:19:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-18 11:19:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:19:07,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:19:07,476 INFO L375 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-11-18 11:19:07,476 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:19:07,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:07,476 INFO L82 PathProgramCache]: Analyzing trace with hash 502189223, now seen corresponding path program 1 times [2018-11-18 11:19:07,476 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 11:19:07,476 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/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-11-18 11:19:07,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:19:09,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:19:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:19:09,582 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:19:09,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:19:09,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:19:09,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:19:09,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:19:09,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:19:09,614 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2018-11-18 11:19:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:19:14,001 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-18 11:19:14,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:19:14,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 11:19:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:19:14,004 INFO L225 Difference]: With dead ends: 63 [2018-11-18 11:19:14,005 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 11:19:14,005 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:19:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 11:19:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-18 11:19:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 11:19:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-18 11:19:14,015 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 22 [2018-11-18 11:19:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:19:14,015 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-18 11:19:14,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:19:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-18 11:19:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:19:14,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:19:14,017 INFO L375 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-11-18 11:19:14,017 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:19:14,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:14,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1812175119, now seen corresponding path program 1 times [2018-11-18 11:19:14,018 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 11:19:14,018 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/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-11-18 11:19:14,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:19:17,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:19:20,108 WARN L832 $PredicateComparison]: unable to prove that (= (fp.div roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xnp1~0) is different from false [2018-11-18 11:19:22,239 WARN L854 $PredicateComparison]: unable to prove that (= (fp.div roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xnp1~0) is different from true [2018-11-18 11:19:24,668 WARN L832 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) |c_SqrtR_#res|) is different from false [2018-11-18 11:19:27,108 WARN L854 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) |c_SqrtR_#res|) is different from true [2018-11-18 11:19:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 11:19:27,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:19:50,010 WARN L180 SmtUtils]: Spent 22.60 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 11:20:06,990 WARN L180 SmtUtils]: Spent 16.98 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-18 11:20:33,225 WARN L180 SmtUtils]: Spent 26.23 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 11:20:59,438 WARN L180 SmtUtils]: Spent 26.21 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 11:21:01,944 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2018-11-18 11:21:04,427 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2018-11-18 11:21:06,948 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (or (not (fp.leq .cse0 .cse1)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2)) (not (fp.geq .cse0 .cse2))))) is different from false [2018-11-18 11:21:09,447 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (or (not (fp.leq .cse0 .cse1)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2)) (not (fp.geq .cse0 .cse2))))) is different from true [2018-11-18 11:21:12,249 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse3 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse3 .cse1)) (not (fp.geq .cse3 .cse2))))) is different from false [2018-11-18 11:21:15,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse3 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse3 .cse1)) (not (fp.geq .cse3 .cse2))))) is different from true [2018-11-18 11:21:18,051 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse7 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse6)))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse7 .cse1)) (not (fp.geq .cse7 .cse2))))) is different from false [2018-11-18 11:21:21,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse7 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse6)))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse7 .cse1)) (not (fp.geq .cse7 .cse2))))) is different from true [2018-11-18 11:21:23,942 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |c_SqrtR_#in~Input|) .cse3) .cse3))))) .cse7)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_SqrtR_~Input) .cse3) .cse3))))) .cse7)))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))) (not (fp.geq .cse0 .cse3))))) is different from false [2018-11-18 11:21:26,875 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |c_SqrtR_#in~Input|) .cse3) .cse3))))) .cse7)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_SqrtR_~Input) .cse3) .cse3))))) .cse7)))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))) (not (fp.geq .cse0 .cse3))))) is different from true [2018-11-18 11:21:29,384 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (let ((.cse1 (fp.geq .cse2 .cse3)) (.cse0 (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)))) (or (not .cse0) (not .cse1) (and .cse1 .cse0))))) is different from false [2018-11-18 11:21:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 11:21:29,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:29,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:21:29,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-18 11:21:43,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:21:43,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-18 11:21:43,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 11:21:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 11:21:43,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=128, Unknown=14, NotChecked=196, Total=380 [2018-11-18 11:21:43,860 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 20 states. [2018-11-18 11:21:46,350 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (= .cse1 c_main_~d~0) (fp.geq .cse0 .cse1)))) is different from false [2018-11-18 11:21:48,851 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (= .cse1 c_main_~d~0) (fp.geq .cse0 .cse1)))) is different from true [2018-11-18 11:21:51,379 WARN L832 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |c_SqrtR_#in~Input|) .cse3) .cse3))))) .cse7)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_SqrtR_~Input) .cse3) .cse3))))) .cse7)))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))) (not (fp.geq .cse0 .cse3)))))) is different from false [2018-11-18 11:21:54,319 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |c_SqrtR_#in~Input|) .cse3) .cse3))))) .cse7)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_SqrtR_~Input) .cse3) .cse3))))) .cse7)))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))) (not (fp.geq .cse0 .cse3)))))) is different from true [2018-11-18 11:21:56,804 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse7 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse6)))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse7 .cse1)) (not (fp.geq .cse7 .cse2))))) (= .cse2 c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input))) is different from false [2018-11-18 11:21:59,841 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse7 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse6)))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse7 .cse1)) (not (fp.geq .cse7 .cse2))))) (= .cse2 c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input))) is different from true [2018-11-18 11:22:02,321 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse4 (fp.div roundNearestTiesToEven .cse3 .cse0))) (or (let ((.cse1 (fp.div roundNearestTiesToEven .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3))) (not (fp.leq .cse4 .cse2)) (not (fp.geq .cse4 .cse3))))))) is different from false [2018-11-18 11:22:05,121 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse4 (fp.div roundNearestTiesToEven .cse3 .cse0))) (or (let ((.cse1 (fp.div roundNearestTiesToEven .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3))) (not (fp.leq .cse4 .cse2)) (not (fp.geq .cse4 .cse3))))))) is different from true [2018-11-18 11:22:12,559 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (= .cse0 |c_SqrtR_#res|) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (or (not (fp.leq .cse0 .cse1)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2)) (not (fp.geq .cse0 .cse2))))))) is different from false [2018-11-18 11:22:15,042 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (= .cse0 |c_SqrtR_#res|) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (or (not (fp.leq .cse0 .cse1)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2)) (not (fp.geq .cse0 .cse2))))))) is different from true [2018-11-18 11:22:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:22:15,354 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-18 11:22:15,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:22:15,355 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-11-18 11:22:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:22:15,356 INFO L225 Difference]: With dead ends: 55 [2018-11-18 11:22:15,356 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 11:22:15,357 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 65.9s TimeCoverageRelationStatistics Valid=58, Invalid=148, Unknown=24, NotChecked=420, Total=650 [2018-11-18 11:22:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 11:22:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-11-18 11:22:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 11:22:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-18 11:22:15,368 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 24 [2018-11-18 11:22:15,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:22:15,368 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-18 11:22:15,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 11:22:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-18 11:22:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:22:15,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:22:15,369 INFO L375 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-11-18 11:22:15,370 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:22:15,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:22:15,370 INFO L82 PathProgramCache]: Analyzing trace with hash 801057869, now seen corresponding path program 1 times [2018-11-18 11:22:15,370 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 11:22:15,371 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-18 11:22:15,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:22:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:22:20,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:22:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 11:22:20,350 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:22:20,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:22:20,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:22:20,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:22:20,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:22:20,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:22:20,406 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-11-18 11:22:24,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:22:24,714 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2018-11-18 11:22:24,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:22:24,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-18 11:22:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:22:24,716 INFO L225 Difference]: With dead ends: 89 [2018-11-18 11:22:24,716 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 11:22:24,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:22:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 11:22:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-11-18 11:22:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 11:22:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-18 11:22:24,726 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 24 [2018-11-18 11:22:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:22:24,726 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-18 11:22:24,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:22:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-18 11:22:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:22:24,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:22:24,728 INFO L375 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-11-18 11:22:24,728 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:22:24,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:22:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1272086197, now seen corresponding path program 2 times [2018-11-18 11:22:24,729 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 11:22:24,729 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7e3f4c4-dfd3-467f-9faa-f662ce96ddd8/bin-2019/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-18 11:22:24,732 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 11:22:31,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 11:22:31,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:22:31,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:22:33,793 WARN L832 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from false [2018-11-18 11:22:35,929 WARN L854 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from true [2018-11-18 11:22:38,336 WARN L832 $PredicateComparison]: unable to prove that (= c_SqrtR_~xnp1~0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))))) .cse5))) is different from false [2018-11-18 11:22:40,757 WARN L854 $PredicateComparison]: unable to prove that (= c_SqrtR_~xnp1~0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))))) .cse5))) is different from true [2018-11-18 11:22:43,479 WARN L832 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5)))) |c_SqrtR_#res|) is different from false [2018-11-18 11:22:46,248 WARN L854 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5)))) |c_SqrtR_#res|) is different from true [2018-11-18 11:22:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-18 11:22:46,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:22:50,772 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-18 11:22:50,973 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2018-11-18 11:22:50,973 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:133) 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.simplification.SimplifyDDA.pushContext(SimplifyDDA.java:737) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walkParam(SimplifyDDA.java:526) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:412) 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:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition(TransFormulaUtils.java:214) 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:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) 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:429) 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:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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) ... 45 more [2018-11-18 11:22:50,976 INFO L168 Benchmark]: Toolchain (without parser) took 253283.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 948.7 MB in the beginning and 883.2 MB in the end (delta: 65.5 MB). Peak memory consumption was 186.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:22:50,977 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:22:50,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.87 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:22:50,978 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.75 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:22:50,978 INFO L168 Benchmark]: Boogie Preprocessor took 25.48 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:22:50,978 INFO L168 Benchmark]: RCFGBuilder took 8428.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:22:50,979 INFO L168 Benchmark]: TraceAbstraction took 244607.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 883.2 MB in the end (delta: 207.3 MB). Peak memory consumption was 207.3 MB. Max. memory is 11.5 GB. [2018-11-18 11:22:50,982 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 201.87 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.75 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.48 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 8428.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 244607.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 883.2 MB in the end (delta: 207.3 MB). Peak memory consumption was 207.3 MB. Max. memory is 11.5 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...