./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/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 2efbbd8e1ed6cd606263edae3254601484469bf9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/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 2efbbd8e1ed6cd606263edae3254601484469bf9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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) Connection to SMT solver broken --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:00:54,273 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:00:54,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:00:54,282 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:00:54,283 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:00:54,283 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:00:54,284 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:00:54,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:00:54,287 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:00:54,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:00:54,288 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:00:54,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:00:54,289 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:00:54,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:00:54,291 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:00:54,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:00:54,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:00:54,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:00:54,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:00:54,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:00:54,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:00:54,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:00:54,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:00:54,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:00:54,301 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:00:54,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:00:54,303 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:00:54,303 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:00:54,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:00:54,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:00:54,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:00:54,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:00:54,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:00:54,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:00:54,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:00:54,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:00:54,308 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 00:00:54,321 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:00:54,321 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:00:54,322 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:00:54,322 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:00:54,322 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 00:00:54,323 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 00:00:54,323 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 00:00:54,323 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 00:00:54,323 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 00:00:54,323 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 00:00:54,323 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 00:00:54,323 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 00:00:54,324 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 00:00:54,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:00:54,324 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:00:54,325 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:00:54,325 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:00:54,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:00:54,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:00:54,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:00:54,326 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:00:54,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:00:54,326 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:00:54,326 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:00:54,326 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:00:54,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:00:54,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:00:54,327 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:00:54,327 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:00:54,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:00:54,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:00:54,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:00:54,328 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:00:54,328 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 00:00:54,328 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:00:54,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:00:54,328 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 00:00:54,328 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_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/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 -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-11-23 00:00:54,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:00:54,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:00:54,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:00:54,366 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:00:54,366 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:00:54,367 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-23 00:00:54,406 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/data/aaa0e9dd3/d7b068b503764dd18c03d466402fe22e/FLAGda224ff1c [2018-11-23 00:00:54,755 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:00:54,755 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-23 00:00:54,760 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/data/aaa0e9dd3/d7b068b503764dd18c03d466402fe22e/FLAGda224ff1c [2018-11-23 00:00:55,169 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/data/aaa0e9dd3/d7b068b503764dd18c03d466402fe22e [2018-11-23 00:00:55,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:00:55,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:00:55,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:00:55,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:00:55,177 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:00:55,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:00:55" (1/1) ... [2018-11-23 00:00:55,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a31ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55, skipping insertion in model container [2018-11-23 00:00:55,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:00:55" (1/1) ... [2018-11-23 00:00:55,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:00:55,214 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:00:55,387 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:00:55,392 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:00:55,412 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:00:55,426 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:00:55,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55 WrapperNode [2018-11-23 00:00:55,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:00:55,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:00:55,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:00:55,427 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:00:55,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55" (1/1) ... [2018-11-23 00:00:55,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55" (1/1) ... [2018-11-23 00:00:55,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:00:55,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:00:55,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:00:55,444 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:00:55,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55" (1/1) ... [2018-11-23 00:00:55,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55" (1/1) ... [2018-11-23 00:00:55,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55" (1/1) ... [2018-11-23 00:00:55,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55" (1/1) ... [2018-11-23 00:00:55,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55" (1/1) ... [2018-11-23 00:00:55,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55" (1/1) ... [2018-11-23 00:00:55,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55" (1/1) ... [2018-11-23 00:00:55,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:00:55,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:00:55,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:00:55,463 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:00:55,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/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-23 00:00:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:00:55,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:00:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:00:55,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:00:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:00:55,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:00:55,715 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:00:55,715 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 00:00:55,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:00:55 BoogieIcfgContainer [2018-11-23 00:00:55,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:00:55,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:00:55,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:00:55,719 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:00:55,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:00:55" (1/3) ... [2018-11-23 00:00:55,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7673d357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:00:55, skipping insertion in model container [2018-11-23 00:00:55,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:55" (2/3) ... [2018-11-23 00:00:55,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7673d357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:00:55, skipping insertion in model container [2018-11-23 00:00:55,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:00:55" (3/3) ... [2018-11-23 00:00:55,721 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-23 00:00:55,729 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:00:55,734 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:00:55,745 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:00:55,772 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:00:55,772 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:00:55,772 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:00:55,772 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:00:55,772 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:00:55,772 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:00:55,772 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:00:55,773 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:00:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 00:00:55,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:00:55,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:00:55,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:00:55,791 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:00:55,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:00:55,795 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-11-23 00:00:55,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:00:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:00:55,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:00:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:00:55,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:00:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:00:55,919 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-23 00:00:55,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:00:55,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:00:55,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:00:55,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:00:55,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:00:55,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:00:55,940 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-23 00:00:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:00:56,000 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-11-23 00:00:56,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:00:56,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 00:00:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:00:56,008 INFO L225 Difference]: With dead ends: 75 [2018-11-23 00:00:56,008 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 00:00:56,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:00:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 00:00:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 27. [2018-11-23 00:00:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 00:00:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-23 00:00:56,037 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-11-23 00:00:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:00:56,038 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 00:00:56,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:00:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-23 00:00:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:00:56,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:00:56,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:00:56,039 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:00:56,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:00:56,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1763341697, now seen corresponding path program 1 times [2018-11-23 00:00:56,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:00:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:00:56,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:00:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:00:56,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:00:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:00:56,087 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-23 00:00:56,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:00:56,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:00:56,087 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:00:56,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:00:56,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:00:56,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:00:56,089 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-11-23 00:00:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:00:56,136 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2018-11-23 00:00:56,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:00:56,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 00:00:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:00:56,137 INFO L225 Difference]: With dead ends: 50 [2018-11-23 00:00:56,138 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 00:00:56,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:00:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 00:00:56,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2018-11-23 00:00:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 00:00:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-23 00:00:56,142 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-11-23 00:00:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:00:56,142 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-23 00:00:56,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:00:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-23 00:00:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:00:56,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:00:56,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:00:56,143 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:00:56,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:00:56,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1747284348, now seen corresponding path program 1 times [2018-11-23 00:00:56,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:00:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:00:56,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:00:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:00:56,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:00:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:00:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:00:56,173 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~__return_125~0)|=2.0, |old(~__return_main~0)|=4, |old(~_EPS~0)|=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [?] ~__return_main~0 := 0;~_EPS~0 := 1.0E-6;~__return_125~0 := 0.0; VAL [|old(~__return_125~0)|=2.0, |old(~__return_main~0)|=4, |old(~_EPS~0)|=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume true; VAL [|old(~__return_125~0)|=2.0, |old(~__return_main~0)|=4, |old(~_EPS~0)|=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] RET #75#return; VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] CALL call #t~ret0 := main(); VAL [|old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] havoc ~main__d~0;havoc ~main__r~0;~main__d~0 := 1.0; VAL [main_~main__d~0=1.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0);havoc ~__tmp_1~0;~__tmp_1~0 := ~main__d~0;havoc ~SqrtR__Input~0;~SqrtR__Input~0 := ~__tmp_1~0;havoc ~SqrtR__xn~0;havoc ~SqrtR__xnp1~0;havoc ~SqrtR__residu~0;havoc ~SqrtR__lsup~0;havoc ~SqrtR__linf~0;havoc ~SqrtR__i~0;havoc ~SqrtR__cond~0; VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~SqrtR__Input~0=1.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0);~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~SqrtR__Input~0=1.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~SqrtR__xnp1~0 := ~SqrtR__xn~0;~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0));~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0));~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0);havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~SqrtR__Input~0=1.0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0); VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~SqrtR__Input~0=1.0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0);~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0;~SqrtR__i~0 := 0; VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !!(0 == ~SqrtR__cond~0);~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0);~main__r~0 := ~__return_125~0;havoc ~main____CPAchecker_TMP_0~0; VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~main__r~0=6.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0); VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~main__r~0=6.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~main____CPAchecker_TMP_0~0 := 0; VAL [main_~__tmp_1~0=1.0, main_~main____CPAchecker_TMP_0~0=0, main_~main__d~0=1.0, main_~main__r~0=6.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] havoc ~__tmp_2~0;~__tmp_2~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [main_~__tmp_1~0=1.0, main_~__tmp_2~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main____CPAchecker_TMP_0~0=0, main_~main__d~0=1.0, main_~main__r~0=6.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume 0 == ~__VERIFIER_assert__cond~0; VAL [main_~__tmp_1~0=1.0, main_~__tmp_2~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main____CPAchecker_TMP_0~0=0, main_~main__d~0=1.0, main_~main__r~0=6.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !false; VAL [main_~__tmp_1~0=1.0, main_~__tmp_2~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main____CPAchecker_TMP_0~0=0, main_~main__d~0=1.0, main_~main__r~0=6.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] CALL call ULTIMATE.init(); VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [L1] ~__return_main~0 := 0; [L6] ~_EPS~0 := 1.0E-6; [L9] ~__return_125~0 := 0.0; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] ensures true; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] CALL call #t~ret0 := main(); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [L12] havoc ~main__d~0; [L13] havoc ~main__r~0; [L14] ~main__d~0 := 1.0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000, ~main__d~0=1.0] [L16-L142] assume ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0); [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := ~main__d~0; [L21] havoc ~SqrtR__Input~0; [L22] ~SqrtR__Input~0 := ~__tmp_1~0; [L23] havoc ~SqrtR__xn~0; [L24] havoc ~SqrtR__xnp1~0; [L25] havoc ~SqrtR__residu~0; [L26] havoc ~SqrtR__lsup~0; [L27] havoc ~SqrtR__linf~0; [L28] havoc ~SqrtR__i~0; [L29] havoc ~SqrtR__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L30-L136] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0); [L134] ~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L34] ~SqrtR__xnp1~0 := ~SqrtR__xn~0; [L35] ~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L36] ~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L37] ~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0); [L38] havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L39-L130] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L121-L129] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0); [L127] ~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L44] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0; [L45] ~SqrtR__i~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L47-L117] assume !!(0 == ~SqrtR__cond~0); [L80] ~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0); [L81] ~main__r~0 := ~__return_125~0; [L82] havoc ~main____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L83-L116] assume !~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L109] ~main____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L90] havoc ~__tmp_2~0; [L91] ~__tmp_2~0 := ~main____CPAchecker_TMP_0~0; [L92] havoc ~__VERIFIER_assert__cond~0; [L93] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L94-L103] assume 0 == ~__VERIFIER_assert__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L96] assert false; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [L1] ~__return_main~0 := 0; [L6] ~_EPS~0 := 1.0E-6; [L9] ~__return_125~0 := 0.0; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] ensures true; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] CALL call #t~ret0 := main(); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [L12] havoc ~main__d~0; [L13] havoc ~main__r~0; [L14] ~main__d~0 := 1.0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000, ~main__d~0=1.0] [L16-L142] assume ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0); [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := ~main__d~0; [L21] havoc ~SqrtR__Input~0; [L22] ~SqrtR__Input~0 := ~__tmp_1~0; [L23] havoc ~SqrtR__xn~0; [L24] havoc ~SqrtR__xnp1~0; [L25] havoc ~SqrtR__residu~0; [L26] havoc ~SqrtR__lsup~0; [L27] havoc ~SqrtR__linf~0; [L28] havoc ~SqrtR__i~0; [L29] havoc ~SqrtR__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L30-L136] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0); [L134] ~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L34] ~SqrtR__xnp1~0 := ~SqrtR__xn~0; [L35] ~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L36] ~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L37] ~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0); [L38] havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L39-L130] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L121-L129] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0); [L127] ~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L44] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0; [L45] ~SqrtR__i~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L47-L117] assume !!(0 == ~SqrtR__cond~0); [L80] ~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0); [L81] ~main__r~0 := ~__return_125~0; [L82] havoc ~main____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L83-L116] assume !~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L109] ~main____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L90] havoc ~__tmp_2~0; [L91] ~__tmp_2~0 := ~main____CPAchecker_TMP_0~0; [L92] havoc ~__VERIFIER_assert__cond~0; [L93] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L94-L103] assume 0 == ~__VERIFIER_assert__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L96] assert false; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [L1] ~__return_main~0 := 0; [L6] ~_EPS~0 := 1.0E-6; [L9] ~__return_125~0 := 0.0; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] CALL call #t~ret0 := main(); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [L12] havoc ~main__d~0; [L13] havoc ~main__r~0; [L14] ~main__d~0 := 1.0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000, ~main__d~0=1.0] [L16] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := ~main__d~0; [L21] havoc ~SqrtR__Input~0; [L22] ~SqrtR__Input~0 := ~__tmp_1~0; [L23] havoc ~SqrtR__xn~0; [L24] havoc ~SqrtR__xnp1~0; [L25] havoc ~SqrtR__residu~0; [L26] havoc ~SqrtR__lsup~0; [L27] havoc ~SqrtR__linf~0; [L28] havoc ~SqrtR__i~0; [L29] havoc ~SqrtR__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L30] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0)) [L134] ~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L34] ~SqrtR__xnp1~0 := ~SqrtR__xn~0; [L35] ~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L36] ~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L37] ~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0); [L38] havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L39] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L121] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0)) [L127] ~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L44] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0; [L45] ~SqrtR__i~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L47] COND FALSE !(!(0 == ~SqrtR__cond~0)) [L80] ~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0); [L81] ~main__r~0 := ~__return_125~0; [L82] havoc ~main____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L83] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L109] ~main____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L90] havoc ~__tmp_2~0; [L91] ~__tmp_2~0 := ~main____CPAchecker_TMP_0~0; [L92] havoc ~__VERIFIER_assert__cond~0; [L93] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L94] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L96] assert false; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [L1] ~__return_main~0 := 0; [L6] ~_EPS~0 := 1.0E-6; [L9] ~__return_125~0 := 0.0; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] CALL call #t~ret0 := main(); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [L12] havoc ~main__d~0; [L13] havoc ~main__r~0; [L14] ~main__d~0 := 1.0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000, ~main__d~0=1.0] [L16] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := ~main__d~0; [L21] havoc ~SqrtR__Input~0; [L22] ~SqrtR__Input~0 := ~__tmp_1~0; [L23] havoc ~SqrtR__xn~0; [L24] havoc ~SqrtR__xnp1~0; [L25] havoc ~SqrtR__residu~0; [L26] havoc ~SqrtR__lsup~0; [L27] havoc ~SqrtR__linf~0; [L28] havoc ~SqrtR__i~0; [L29] havoc ~SqrtR__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L30] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0)) [L134] ~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L34] ~SqrtR__xnp1~0 := ~SqrtR__xn~0; [L35] ~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L36] ~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L37] ~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0); [L38] havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L39] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L121] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0)) [L127] ~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L44] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0; [L45] ~SqrtR__i~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L47] COND FALSE !(!(0 == ~SqrtR__cond~0)) [L80] ~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0); [L81] ~main__r~0 := ~__return_125~0; [L82] havoc ~main____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L83] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L109] ~main____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L90] havoc ~__tmp_2~0; [L91] ~__tmp_2~0 := ~main____CPAchecker_TMP_0~0; [L92] havoc ~__VERIFIER_assert__cond~0; [L93] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L94] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L96] assert false; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [L1] ~__return_main~0 := 0; [L6] ~_EPS~0 := 1.0E-6; [L9] ~__return_125~0 := 0.0; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] CALL call #t~ret0 := main(); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [L12] havoc ~main__d~0; [L13] havoc ~main__r~0; [L14] ~main__d~0 := 1.0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000, ~main__d~0=1.0] [L16] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := ~main__d~0; [L21] havoc ~SqrtR__Input~0; [L22] ~SqrtR__Input~0 := ~__tmp_1~0; [L23] havoc ~SqrtR__xn~0; [L24] havoc ~SqrtR__xnp1~0; [L25] havoc ~SqrtR__residu~0; [L26] havoc ~SqrtR__lsup~0; [L27] havoc ~SqrtR__linf~0; [L28] havoc ~SqrtR__i~0; [L29] havoc ~SqrtR__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L30] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0)) [L134] ~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L34] ~SqrtR__xnp1~0 := ~SqrtR__xn~0; [L35] ~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L36] ~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L37] ~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0); [L38] havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L39] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L121] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0)) [L127] ~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L44] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0; [L45] ~SqrtR__i~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L47] COND FALSE !(!(0 == ~SqrtR__cond~0)) [L80] ~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0); [L81] ~main__r~0 := ~__return_125~0; [L82] havoc ~main____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L83] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L109] ~main____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L90] havoc ~__tmp_2~0; [L91] ~__tmp_2~0 := ~main____CPAchecker_TMP_0~0; [L92] havoc ~__VERIFIER_assert__cond~0; [L93] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L94] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L96] assert false; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [L1] ~__return_main~0 := 0; [L6] ~_EPS~0 := 1.0E-6; [L9] ~__return_125~0 := 0.0; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] CALL call #t~ret0 := main(); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [L12] havoc ~main__d~0; [L13] havoc ~main__r~0; [L14] ~main__d~0 := 1.0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000, ~main__d~0=1.0] [L16] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := ~main__d~0; [L21] havoc ~SqrtR__Input~0; [L22] ~SqrtR__Input~0 := ~__tmp_1~0; [L23] havoc ~SqrtR__xn~0; [L24] havoc ~SqrtR__xnp1~0; [L25] havoc ~SqrtR__residu~0; [L26] havoc ~SqrtR__lsup~0; [L27] havoc ~SqrtR__linf~0; [L28] havoc ~SqrtR__i~0; [L29] havoc ~SqrtR__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L30] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0)) [L134] ~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L34] ~SqrtR__xnp1~0 := ~SqrtR__xn~0; [L35] ~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L36] ~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L37] ~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0); [L38] havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L39] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L121] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0)) [L127] ~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L44] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0; [L45] ~SqrtR__i~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L47] COND FALSE !(!(0 == ~SqrtR__cond~0)) [L80] ~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0); [L81] ~main__r~0 := ~__return_125~0; [L82] havoc ~main____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L83] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L109] ~main____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L90] havoc ~__tmp_2~0; [L91] ~__tmp_2~0 := ~main____CPAchecker_TMP_0~0; [L92] havoc ~__VERIFIER_assert__cond~0; [L93] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L94] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L96] assert false; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L1] int __return_main; [L6] double _EPS = 0.0000010; [L9] double __return_125; VAL [\old(__return_125)=2, \old(__return_main)=4, \old(_EPS)=3, __return_125=0, __return_main=0, _EPS=1/1000000] [L12] double main__d; [L13] double main__r; [L14] main__d = 1.0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, _EPS=1/1000000, main__d=1] [L16] COND TRUE main__d <= 20.0 [L19] double __tmp_1; [L20] __tmp_1 = main__d [L21] double SqrtR__Input; [L22] SqrtR__Input = __tmp_1 [L23] double SqrtR__xn; [L24] double SqrtR__xnp1; [L25] double SqrtR__residu; [L26] double SqrtR__lsup; [L27] double SqrtR__linf; [L28] int SqrtR__i; [L29] int SqrtR__cond; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L30] COND FALSE !(SqrtR__Input <= 1.0) [L134] SqrtR__xn = 1.0 / SqrtR__Input VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L34] SqrtR__xnp1 = SqrtR__xn [L35] SqrtR__residu = (2.0 * _EPS) * (SqrtR__xn + SqrtR__xnp1) [L36] SqrtR__lsup = _EPS * (SqrtR__xn + SqrtR__xnp1) [L37] SqrtR__linf = -SqrtR__lsup [L38] int SqrtR____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L39] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L121] COND FALSE !(SqrtR__residu < SqrtR__linf) [L127] SqrtR____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L44] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L45] SqrtR__i = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L47] COND FALSE !(!(SqrtR__cond == 0)) [L80] __return_125 = 1.0 / SqrtR__xnp1 [L81] main__r = __return_125 [L82] int main____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L83] COND FALSE !(main__r >= 1.0) VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L109] main____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_0 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L96] __VERIFIER_error() VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] ----- [2018-11-23 00:00:56,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:00:56 BoogieIcfgContainer [2018-11-23 00:00:56,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:00:56,220 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:00:56,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:00:56,220 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:00:56,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:00:55" (3/4) ... [2018-11-23 00:00:56,224 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:00:56,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:00:56,225 INFO L168 Benchmark]: Toolchain (without parser) took 1053.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:00:56,227 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:00:56,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.07 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:00:56,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.81 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:00:56,228 INFO L168 Benchmark]: Boogie Preprocessor took 18.83 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:00:56,229 INFO L168 Benchmark]: RCFGBuilder took 252.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:00:56,230 INFO L168 Benchmark]: TraceAbstraction took 503.72 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: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:00:56,230 INFO L168 Benchmark]: Witness Printer took 4.85 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:00:56,234 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.07 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.81 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.83 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 252.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 503.72 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: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.85 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 96]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L1] int __return_main; [L6] double _EPS = 0.0000010; [L9] double __return_125; VAL [\old(__return_125)=2, \old(__return_main)=4, \old(_EPS)=3, __return_125=0, __return_main=0, _EPS=1/1000000] [L12] double main__d; [L13] double main__r; [L14] main__d = 1.0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, _EPS=1/1000000, main__d=1] [L16] COND TRUE main__d <= 20.0 [L19] double __tmp_1; [L20] __tmp_1 = main__d [L21] double SqrtR__Input; [L22] SqrtR__Input = __tmp_1 [L23] double SqrtR__xn; [L24] double SqrtR__xnp1; [L25] double SqrtR__residu; [L26] double SqrtR__lsup; [L27] double SqrtR__linf; [L28] int SqrtR__i; [L29] int SqrtR__cond; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L30] COND FALSE !(SqrtR__Input <= 1.0) [L134] SqrtR__xn = 1.0 / SqrtR__Input VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L34] SqrtR__xnp1 = SqrtR__xn [L35] SqrtR__residu = (2.0 * _EPS) * (SqrtR__xn + SqrtR__xnp1) [L36] SqrtR__lsup = _EPS * (SqrtR__xn + SqrtR__xnp1) [L37] SqrtR__linf = -SqrtR__lsup [L38] int SqrtR____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L39] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L121] COND FALSE !(SqrtR__residu < SqrtR__linf) [L127] SqrtR____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L44] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L45] SqrtR__i = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L47] COND FALSE !(!(SqrtR__cond == 0)) [L80] __return_125 = 1.0 / SqrtR__xnp1 [L81] main__r = __return_125 [L82] int main____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L83] COND FALSE !(main__r >= 1.0) VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L109] main____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_0 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L96] __VERIFIER_error() VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 106 SDtfs, 79 SDslu, 148 SDs, 0 SdLazy, 27 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-aa41828 [2018-11-23 00:00:57,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:00:57,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:00:57,768 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:00:57,769 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:00:57,769 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:00:57,770 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:00:57,771 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:00:57,773 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:00:57,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:00:57,774 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:00:57,774 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:00:57,775 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:00:57,776 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:00:57,777 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:00:57,778 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:00:57,778 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:00:57,780 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:00:57,781 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:00:57,782 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:00:57,783 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:00:57,784 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:00:57,786 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:00:57,786 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:00:57,786 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:00:57,787 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:00:57,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:00:57,788 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:00:57,789 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:00:57,790 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:00:57,790 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:00:57,791 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:00:57,791 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:00:57,791 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:00:57,792 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:00:57,792 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:00:57,793 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 00:00:57,804 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:00:57,804 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:00:57,805 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:00:57,805 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:00:57,805 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 00:00:57,805 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 00:00:57,805 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 00:00:57,806 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 00:00:57,806 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 00:00:57,806 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 00:00:57,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:00:57,807 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:00:57,807 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:00:57,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:00:57,807 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:00:57,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:00:57,807 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:00:57,808 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 00:00:57,808 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 00:00:57,808 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:00:57,808 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:00:57,808 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:00:57,808 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:00:57,808 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:00:57,809 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:00:57,809 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:00:57,809 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:00:57,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:00:57,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:00:57,811 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:00:57,811 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:00:57,811 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 00:00:57,812 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:00:57,812 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 00:00:57,812 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 00:00:57,812 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_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/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 -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-11-23 00:00:57,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:00:57,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:00:57,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:00:57,856 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:00:57,856 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:00:57,857 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-23 00:00:57,899 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/data/a8006aef9/8ab83a49cfb146fc9e527bdb1bb95c68/FLAGa30c804fe [2018-11-23 00:00:58,227 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:00:58,228 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-23 00:00:58,232 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/data/a8006aef9/8ab83a49cfb146fc9e527bdb1bb95c68/FLAGa30c804fe [2018-11-23 00:00:58,656 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/data/a8006aef9/8ab83a49cfb146fc9e527bdb1bb95c68 [2018-11-23 00:00:58,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:00:58,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:00:58,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:00:58,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:00:58,663 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:00:58,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:00:58" (1/1) ... [2018-11-23 00:00:58,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6919f42f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58, skipping insertion in model container [2018-11-23 00:00:58,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:00:58" (1/1) ... [2018-11-23 00:00:58,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:00:58,690 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:00:58,816 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:00:58,822 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:00:58,842 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:00:58,853 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:00:58,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58 WrapperNode [2018-11-23 00:00:58,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:00:58,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:00:58,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:00:58,854 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:00:58,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58" (1/1) ... [2018-11-23 00:00:58,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58" (1/1) ... [2018-11-23 00:00:58,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:00:58,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:00:58,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:00:58,870 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:00:58,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58" (1/1) ... [2018-11-23 00:00:58,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58" (1/1) ... [2018-11-23 00:00:58,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58" (1/1) ... [2018-11-23 00:00:58,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58" (1/1) ... [2018-11-23 00:00:58,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58" (1/1) ... [2018-11-23 00:00:58,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58" (1/1) ... [2018-11-23 00:00:58,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58" (1/1) ... [2018-11-23 00:00:58,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:00:58,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:00:58,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:00:58,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:00:58,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/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-23 00:00:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:00:58,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:00:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:00:58,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:00:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:00:58,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:01:07,532 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:01:07,532 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 00:01:07,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:07 BoogieIcfgContainer [2018-11-23 00:01:07,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:01:07,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:01:07,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:01:07,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:01:07,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:00:58" (1/3) ... [2018-11-23 00:01:07,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b22e958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:07, skipping insertion in model container [2018-11-23 00:01:07,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:00:58" (2/3) ... [2018-11-23 00:01:07,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b22e958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:07, skipping insertion in model container [2018-11-23 00:01:07,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:07" (3/3) ... [2018-11-23 00:01:07,538 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-23 00:01:07,546 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:01:07,552 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:01:07,565 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:01:07,592 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:01:07,593 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:01:07,593 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:01:07,593 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:01:07,593 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:01:07,593 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:01:07,593 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:01:07,594 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:01:07,594 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:01:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 00:01:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:01:07,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:07,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:07,615 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:07,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:07,619 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-11-23 00:01:07,622 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:01:07,623 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/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-23 00:01:07,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:09,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:09,514 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-23 00:01:09,514 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:01:09,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:01:09,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:01:09,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:01:09,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:01:09,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:01:09,553 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-23 00:01:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:13,401 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-11-23 00:01:13,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:01:13,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 00:01:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:13,410 INFO L225 Difference]: With dead ends: 70 [2018-11-23 00:01:13,410 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 00:01:13,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:01:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 00:01:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2018-11-23 00:01:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 00:01:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-23 00:01:13,440 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-11-23 00:01:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:13,440 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 00:01:13,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:01:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-23 00:01:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:01:13,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:13,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:13,441 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:13,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:13,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1420788200, now seen corresponding path program 1 times [2018-11-23 00:01:13,442 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:01:13,442 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/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-23 00:01:13,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:14,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:14,721 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-23 00:01:14,722 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:01:14,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:01:14,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:01:14,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:01:14,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:01:14,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:01:14,751 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-11-23 00:01:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:22,545 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2018-11-23 00:01:22,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:01:22,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 00:01:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:22,547 INFO L225 Difference]: With dead ends: 48 [2018-11-23 00:01:22,547 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 00:01:22,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:01:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 00:01:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 00:01:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 00:01:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-23 00:01:22,552 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-11-23 00:01:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:22,552 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-23 00:01:22,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:01:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-23 00:01:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:01:22,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:22,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:22,553 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:22,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash -619377979, now seen corresponding path program 1 times [2018-11-23 00:01:22,554 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:01:22,554 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/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-23 00:01:22,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:23,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:23,949 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-23 00:01:23,949 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:01:23,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:01:23,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:01:23,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:01:23,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:01:23,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:01:23,971 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2018-11-23 00:01:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:41,647 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 00:01:41,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:01:41,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 00:01:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:41,649 INFO L225 Difference]: With dead ends: 55 [2018-11-23 00:01:41,649 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 00:01:41,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:01:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 00:01:41,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-23 00:01:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 00:01:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-23 00:01:41,655 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2018-11-23 00:01:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:41,655 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 00:01:41,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:01:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 00:01:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:01:41,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:41,656 INFO L402 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-23 00:01:41,656 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:41,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:41,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1492678358, now seen corresponding path program 1 times [2018-11-23 00:01:41,657 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:01:41,657 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/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-23 00:01:41,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:45,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 00:01:45,198 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:01:45,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:01:45,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:01:45,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:01:45,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:01:45,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:01:45,244 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2018-11-23 00:01:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:50,703 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2018-11-23 00:01:50,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:01:50,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 00:01:50,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:50,705 INFO L225 Difference]: With dead ends: 54 [2018-11-23 00:01:50,705 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 00:01:50,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:01:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 00:01:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2018-11-23 00:01:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 00:01:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-11-23 00:01:50,713 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2018-11-23 00:01:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:50,713 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-23 00:01:50,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:01:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-11-23 00:01:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:01:50,714 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:50,715 INFO L402 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-23 00:01:50,715 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:50,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:50,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1476621009, now seen corresponding path program 1 times [2018-11-23 00:01:50,715 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:01:50,715 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 00:01:50,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:54,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:01:54,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:01:56,715 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-11-23 00:02:01,283 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (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_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-11-23 00:02:03,808 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (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_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-11-23 00:02:06,225 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (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_main_~SqrtR__Input~0 .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_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-11-23 00:02:08,688 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (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_main_~SqrtR__Input~0 .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_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-11-23 00:02:11,117 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (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_main_~main__d~0 .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_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-11-23 00:02:13,538 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (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_main_~main__d~0 .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_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-11-23 00:02:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-23 00:02:13,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:02:13,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:02:13,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:02:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 00:02:27,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:02:27,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 00:02:27,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 00:02:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:02:27,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=42, Unknown=7, NotChecked=60, Total=132 [2018-11-23 00:02:27,288 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2018-11-23 00:02:29,754 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (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_main_~main__d~0 .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_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~main__d~0))) is different from true [2018-11-23 00:02:32,209 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (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_main_~SqrtR__Input~0 .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_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 00:02:34,762 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (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_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 00:03:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:03:06,408 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2018-11-23 00:03:06,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 00:03:06,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 00:03:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:03:06,733 INFO L225 Difference]: With dead ends: 101 [2018-11-23 00:03:06,733 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 00:03:06,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=10, NotChecked=140, Total=240 [2018-11-23 00:03:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 00:03:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 43. [2018-11-23 00:03:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 00:03:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2018-11-23 00:03:06,743 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 22 [2018-11-23 00:03:06,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:03:06,743 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-11-23 00:03:06,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 00:03:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-23 00:03:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 00:03:06,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:03:06,744 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:03:06,744 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:03:06,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:03:06,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1956324209, now seen corresponding path program 2 times [2018-11-23 00:03:06,745 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:03:06,745 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/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-23 00:03:06,748 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 00:03:12,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:03:12,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:03:12,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:03:14,876 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (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_main_~SqrtR__Input~0 .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_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 00:03:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-23 00:03:14,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:03:40,439 WARN L180 SmtUtils]: Spent 4.16 s on a formula simplification that was a NOOP. DAG size: 6 [2018-11-23 00:03:43,002 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (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_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-11-23 00:03:45,569 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (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_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-11-23 00:03:48,397 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (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_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-11-23 00:03:51,252 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (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_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-11-23 00:03:53,905 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (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_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .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_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-11-23 00:03:56,567 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (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_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .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_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-11-23 00:03:59,238 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (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_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .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_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-11-23 00:04:01,939 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (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_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .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_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-11-23 00:04:01,963 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-23 00:04:02,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:04:02,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fd7cbb7-64a8-4242-b4e2-516fac0cb18b/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:04:02,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:04:15,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:04:15,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:04:15,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:04:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:04:18,774 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:04:18,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:04:18,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 8] total 16 [2018-11-23 00:04:18,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 00:04:18,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 00:04:18,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=83, Unknown=15, NotChecked=110, Total=240 [2018-11-23 00:04:18,873 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 16 states. [2018-11-23 00:04:21,602 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (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_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .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_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~main__d~0))) is different from true [2018-11-23 00:04:24,386 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (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_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .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_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 00:04:27,274 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (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_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 00:04:29,782 WARN L832 $PredicateComparison]: unable to prove that (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_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from false [2018-11-23 00:04:32,461 WARN L854 $PredicateComparison]: unable to prove that (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_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 00:04:34,957 WARN L832 $PredicateComparison]: unable to prove that (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_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_main_~SqrtR____CPAchecker_TMP_1~0 (_ bv0 32)) (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from false [2018-11-23 00:04:37,535 WARN L854 $PredicateComparison]: unable to prove that (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_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_main_~SqrtR____CPAchecker_TMP_1~0 (_ bv0 32)) (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 00:04:40,070 WARN L832 $PredicateComparison]: unable to prove that (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_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= c_main_~SqrtR__cond~0 (_ bv0 32)) (= .cse0 c_main_~SqrtR__Input~0))) is different from false [2018-11-23 00:04:42,662 WARN L854 $PredicateComparison]: unable to prove that (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_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= c_main_~SqrtR__cond~0 (_ bv0 32)) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 00:06:00,777 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-23 00:06:00,778 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) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:651) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:255) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:270) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-11-23 00:06:00,780 INFO L168 Benchmark]: Toolchain (without parser) took 302121.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 949.2 MB in the beginning and 910.3 MB in the end (delta: 38.9 MB). Peak memory consumption was 181.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:00,780 INFO L168 Benchmark]: CDTParser took 0.14 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-23 00:06:00,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.48 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:00,781 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.52 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:06:00,781 INFO L168 Benchmark]: Boogie Preprocessor took 19.76 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:06:00,782 INFO L168 Benchmark]: RCFGBuilder took 8642.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:00,782 INFO L168 Benchmark]: TraceAbstraction took 293245.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 910.3 MB in the end (delta: 201.4 MB). Peak memory consumption was 201.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:00,784 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.14 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 193.48 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 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.52 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.76 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 8642.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 293245.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 910.3 MB in the end (delta: 201.4 MB). Peak memory consumption was 201.4 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) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...