./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer --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 Automizer --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: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer --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 Automizer --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)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 07:49:45,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:49:45,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:49:45,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:49:45,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:49:45,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:49:45,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:49:45,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:49:45,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:49:45,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:49:45,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:49:45,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:49:45,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:49:45,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:49:45,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:49:45,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:49:45,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:49:45,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:49:45,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:49:45,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:49:45,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:49:45,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:49:45,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:49:45,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:49:45,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:49:45,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:49:45,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:49:45,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:49:45,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:49:45,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:49:45,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:49:45,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:49:45,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:49:45,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:49:45,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:49:45,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:49:45,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:49:45,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:49:45,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:49:45,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:49:45,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:49:45,252 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 07:49:45,281 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:49:45,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:49:45,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:49:45,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:49:45,282 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:49:45,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:49:45,283 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:49:45,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:49:45,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:49:45,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:49:45,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:49:45,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:49:45,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:49:45,284 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:49:45,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:49:45,285 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:49:45,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:49:45,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:49:45,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:49:45,286 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:49:45,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:49:45,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:49:45,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:49:45,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:49:45,287 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:49:45,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:49:45,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 07:49:45,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:49:45,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer 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 -> Automizer 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 [2019-11-20 07:49:45,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:49:45,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:49:45,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:49:45,506 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:49:45,506 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:49:45,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2019-11-20 07:49:45,571 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/data/11f8099e0/dcf3df8463e746a6b48b497d7f10d9ce/FLAG4e5f1eac7 [2019-11-20 07:49:45,976 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:49:45,979 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2019-11-20 07:49:45,989 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/data/11f8099e0/dcf3df8463e746a6b48b497d7f10d9ce/FLAG4e5f1eac7 [2019-11-20 07:49:46,286 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/data/11f8099e0/dcf3df8463e746a6b48b497d7f10d9ce [2019-11-20 07:49:46,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:49:46,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:49:46,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:49:46,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:49:46,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:49:46,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:49:46" (1/1) ... [2019-11-20 07:49:46,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41683dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46, skipping insertion in model container [2019-11-20 07:49:46,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:49:46" (1/1) ... [2019-11-20 07:49:46,308 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:49:46,329 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:49:46,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:49:46,540 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:49:46,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:49:46,584 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:49:46,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46 WrapperNode [2019-11-20 07:49:46,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:49:46,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:49:46,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:49:46,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:49:46,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46" (1/1) ... [2019-11-20 07:49:46,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46" (1/1) ... [2019-11-20 07:49:46,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:49:46,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:49:46,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:49:46,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:49:46,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46" (1/1) ... [2019-11-20 07:49:46,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46" (1/1) ... [2019-11-20 07:49:46,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46" (1/1) ... [2019-11-20 07:49:46,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46" (1/1) ... [2019-11-20 07:49:46,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46" (1/1) ... [2019-11-20 07:49:46,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46" (1/1) ... [2019-11-20 07:49:46,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46" (1/1) ... [2019-11-20 07:49:46,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:49:46,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:49:46,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:49:46,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:49:46,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:49:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:49:46,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:49:47,033 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:49:47,033 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 07:49:47,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:49:47 BoogieIcfgContainer [2019-11-20 07:49:47,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:49:47,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:49:47,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:49:47,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:49:47,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:49:46" (1/3) ... [2019-11-20 07:49:47,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5537657a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:49:47, skipping insertion in model container [2019-11-20 07:49:47,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:46" (2/3) ... [2019-11-20 07:49:47,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5537657a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:49:47, skipping insertion in model container [2019-11-20 07:49:47,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:49:47" (3/3) ... [2019-11-20 07:49:47,043 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c.p+cfa-reducer.c [2019-11-20 07:49:47,065 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:49:47,072 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 07:49:47,084 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 07:49:47,109 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:49:47,109 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:49:47,110 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:49:47,110 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:49:47,110 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:49:47,110 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:49:47,110 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:49:47,111 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:49:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-20 07:49:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 07:49:47,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:49:47,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:49:47,133 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:49:47,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:49:47,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2001896247, now seen corresponding path program 1 times [2019-11-20 07:49:47,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:49:47,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914726026] [2019-11-20 07:49:47,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:49:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:49:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:49:47,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914726026] [2019-11-20 07:49:47,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:49:47,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:49:47,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604047636] [2019-11-20 07:49:47,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:49:47,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:49:47,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:49:47,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:49:47,349 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-11-20 07:49:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:49:47,451 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2019-11-20 07:49:47,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:49:47,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-20 07:49:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:49:47,462 INFO L225 Difference]: With dead ends: 51 [2019-11-20 07:49:47,462 INFO L226 Difference]: Without dead ends: 40 [2019-11-20 07:49:47,465 INFO L630 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 [2019-11-20 07:49:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-20 07:49:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2019-11-20 07:49:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 07:49:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-20 07:49:47,502 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-11-20 07:49:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:49:47,503 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-20 07:49:47,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:49:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-20 07:49:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 07:49:47,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:49:47,504 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:49:47,504 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:49:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:49:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1984885586, now seen corresponding path program 1 times [2019-11-20 07:49:47,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:49:47,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993980363] [2019-11-20 07:49:47,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:49:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:49:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:49:47,549 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:49:47,549 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 07:49:47,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:49:47 BoogieIcfgContainer [2019-11-20 07:49:47,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:49:47,580 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:49:47,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:49:47,580 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:49:47,581 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:49:47" (3/4) ... [2019-11-20 07:49:47,587 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 07:49:47,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:49:47,591 INFO L168 Benchmark]: Toolchain (without parser) took 1297.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2019-11-20 07:49:47,592 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:49:47,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-20 07:49:47,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:49:47,595 INFO L168 Benchmark]: Boogie Preprocessor took 22.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:49:47,599 INFO L168 Benchmark]: RCFGBuilder took 389.64 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: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-20 07:49:47,601 INFO L168 Benchmark]: TraceAbstraction took 543.78 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-11-20 07:49:47,601 INFO L168 Benchmark]: Witness Printer took 7.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:49:47,605 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 389.64 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: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 543.78 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Witness Printer took 7.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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 [__return_125=0, __return_main=0, _EPS=1/1000000] [L12] double main__d; [L13] double main__r; [L14] main__d = 1.0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [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 [__return_125=0, __return_main=0, _EPS=1/1000000] [L30] COND FALSE !(SqrtR__Input <= 1.0) [L134] SqrtR__xn = 1.0 / SqrtR__Input VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [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 [__return_125=0, __return_main=0, _EPS=1/1000000] [L39] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L121] COND FALSE !(SqrtR__residu < SqrtR__linf) [L127] SqrtR____CPAchecker_TMP_0 = 0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L44] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L45] SqrtR__i = 0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [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 [__return_125=1, __return_main=0, _EPS=1/1000000] [L83] COND FALSE !(main__r >= 1.0) VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L109] main____CPAchecker_TMP_0 = 0 VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_0 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L96] __VERIFIER_error() VAL [__return_125=1, __return_main=0, _EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 56 SDtfs, 49 SDslu, 58 SDs, 0 SdLazy, 15 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: 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.24-678e011 [2019-11-20 07:49:49,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:49:49,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:49:49,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:49:49,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:49:49,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:49:49,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:49:49,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:49:49,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:49:49,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:49:49,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:49:49,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:49:49,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:49:49,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:49:49,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:49:49,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:49:49,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:49:49,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:49:49,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:49:49,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:49:49,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:49:49,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:49:49,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:49:49,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:49:49,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:49:49,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:49:49,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:49:49,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:49:49,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:49:49,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:49:49,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:49:49,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:49:49,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:49:49,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:49:49,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:49:49,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:49:49,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:49:49,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:49:49,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:49:49,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:49:49,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:49:49,851 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 07:49:49,880 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:49:49,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:49:49,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:49:49,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:49:49,883 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:49:49,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:49:49,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:49:49,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:49:49,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:49:49,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:49:49,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:49:49,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:49:49,886 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 07:49:49,887 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 07:49:49,887 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:49:49,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:49:49,888 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:49:49,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:49:49,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:49:49,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:49:49,889 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:49:49,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:49:49,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:49:49,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:49:49,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:49:49,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:49:49,891 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 07:49:49,891 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 07:49:49,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:49:49,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 07:49:49,892 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer 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 -> Automizer 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 [2019-11-20 07:49:50,206 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:49:50,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:49:50,226 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:49:50,228 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:49:50,228 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:49:50,230 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2019-11-20 07:49:50,302 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/data/0aac23481/9955bdb7bbc845c0b797d47296614073/FLAG02bf98927 [2019-11-20 07:49:50,806 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:49:50,808 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2019-11-20 07:49:50,817 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/data/0aac23481/9955bdb7bbc845c0b797d47296614073/FLAG02bf98927 [2019-11-20 07:49:51,198 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/data/0aac23481/9955bdb7bbc845c0b797d47296614073 [2019-11-20 07:49:51,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:49:51,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:49:51,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:49:51,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:49:51,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:49:51,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:49:51" (1/1) ... [2019-11-20 07:49:51,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7806c80f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51, skipping insertion in model container [2019-11-20 07:49:51,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:49:51" (1/1) ... [2019-11-20 07:49:51,220 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:49:51,245 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:49:51,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:49:51,439 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:49:51,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:49:51,487 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:49:51,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51 WrapperNode [2019-11-20 07:49:51,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:49:51,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:49:51,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:49:51,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:49:51,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51" (1/1) ... [2019-11-20 07:49:51,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51" (1/1) ... [2019-11-20 07:49:51,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:49:51,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:49:51,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:49:51,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:49:51,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51" (1/1) ... [2019-11-20 07:49:51,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51" (1/1) ... [2019-11-20 07:49:51,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51" (1/1) ... [2019-11-20 07:49:51,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51" (1/1) ... [2019-11-20 07:49:51,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51" (1/1) ... [2019-11-20 07:49:51,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51" (1/1) ... [2019-11-20 07:49:51,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51" (1/1) ... [2019-11-20 07:49:51,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:49:51,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:49:51,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:49:51,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:49:51,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:49:51,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:49:51,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:50:01,353 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:50:01,354 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 07:50:01,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:50:01 BoogieIcfgContainer [2019-11-20 07:50:01,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:50:01,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:50:01,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:50:01,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:50:01,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:49:51" (1/3) ... [2019-11-20 07:50:01,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a11cd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:50:01, skipping insertion in model container [2019-11-20 07:50:01,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:51" (2/3) ... [2019-11-20 07:50:01,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a11cd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:50:01, skipping insertion in model container [2019-11-20 07:50:01,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:50:01" (3/3) ... [2019-11-20 07:50:01,361 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c.p+cfa-reducer.c [2019-11-20 07:50:01,369 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:50:01,374 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 07:50:01,383 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 07:50:01,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:50:01,404 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:50:01,405 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:50:01,405 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:50:01,405 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:50:01,405 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:50:01,405 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:50:01,406 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:50:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-20 07:50:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 07:50:01,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:50:01,425 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:50:01,426 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:50:01,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:50:01,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2001896247, now seen corresponding path program 1 times [2019-11-20 07:50:01,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:50:01,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572084523] [2019-11-20 07:50:01,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/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 [2019-11-20 07:50:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:50:03,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 07:50:03,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:50:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:50:03,937 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:50:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:50:03,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572084523] [2019-11-20 07:50:03,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:50:03,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 07:50:03,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433418951] [2019-11-20 07:50:03,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:50:03,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:50:04,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:50:04,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:50:04,005 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 6 states. [2019-11-20 07:50:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:50:09,014 INFO L93 Difference]: Finished difference Result 82 states and 114 transitions. [2019-11-20 07:50:09,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:50:09,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-20 07:50:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:50:09,028 INFO L225 Difference]: With dead ends: 82 [2019-11-20 07:50:09,028 INFO L226 Difference]: Without dead ends: 51 [2019-11-20 07:50:09,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:50:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-20 07:50:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 23. [2019-11-20 07:50:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 07:50:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-20 07:50:09,073 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-11-20 07:50:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:50:09,074 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-20 07:50:09,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:50:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-20 07:50:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 07:50:09,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:50:09,076 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:50:09,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 07:50:09,301 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:50:09,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:50:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash 939018830, now seen corresponding path program 1 times [2019-11-20 07:50:09,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:50:09,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174042339] [2019-11-20 07:50:09,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/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 [2019-11-20 07:50:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:50:11,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 07:50:11,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:50:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:50:11,138 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:50:13,283 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2019-11-20 07:50:15,371 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2019-11-20 07:50:20,142 WARN L191 SmtUtils]: Spent 981.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 07:50:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:50:20,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174042339] [2019-11-20 07:50:20,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:50:20,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 07:50:20,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114306656] [2019-11-20 07:50:20,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 07:50:20,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:50:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 07:50:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2019-11-20 07:50:20,148 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 8 states. [2019-11-20 07:50:22,296 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_main_~SqrtR__xn~0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) is different from true [2019-11-20 07:50:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:50:38,930 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2019-11-20 07:50:38,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:50:38,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-20 07:50:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:50:38,933 INFO L225 Difference]: With dead ends: 68 [2019-11-20 07:50:38,933 INFO L226 Difference]: Without dead ends: 49 [2019-11-20 07:50:38,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2019-11-20 07:50:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-20 07:50:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 25. [2019-11-20 07:50:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 07:50:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-20 07:50:38,941 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2019-11-20 07:50:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:50:38,941 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-20 07:50:38,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 07:50:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-11-20 07:50:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 07:50:38,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:50:38,942 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:50:39,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 07:50:39,143 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:50:39,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:50:39,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1251138159, now seen corresponding path program 1 times [2019-11-20 07:50:39,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:50:39,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987163919] [2019-11-20 07:50:39,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/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 [2019-11-20 07:50:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:50:40,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:50:40,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:50:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:50:40,861 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:50:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:50:40,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987163919] [2019-11-20 07:50:40,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:50:40,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 07:50:40,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707584675] [2019-11-20 07:50:40,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:50:40,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:50:40,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:50:40,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:50:40,884 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 6 states. [2019-11-20 07:50:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:50:53,406 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-11-20 07:50:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:50:53,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-20 07:50:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:50:53,408 INFO L225 Difference]: With dead ends: 46 [2019-11-20 07:50:53,408 INFO L226 Difference]: Without dead ends: 27 [2019-11-20 07:50:53,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:50:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-20 07:50:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-20 07:50:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 07:50:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-20 07:50:53,416 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2019-11-20 07:50:53,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:50:53,416 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-20 07:50:53,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:50:53,416 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-11-20 07:50:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 07:50:53,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:50:53,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:50:53,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 07:50:53,621 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:50:53,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:50:53,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1124243894, now seen corresponding path program 1 times [2019-11-20 07:50:53,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:50:53,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779999579] [2019-11-20 07:50:53,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/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 [2019-11-20 07:50:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:50:58,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 07:50:58,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:50:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:50:58,842 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:51:01,314 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from false [2019-11-20 07:51:03,657 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from true [2019-11-20 07:51:05,887 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from false [2019-11-20 07:51:08,107 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from true [2019-11-20 07:51:10,350 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from false [2019-11-20 07:51:12,581 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from true [2019-11-20 07:51:13,314 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 07:51:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:51:13,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779999579] [2019-11-20 07:51:13,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:51:13,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-20 07:51:13,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986587215] [2019-11-20 07:51:13,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 07:51:13,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:51:13,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 07:51:13,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=48, Unknown=6, NotChecked=48, Total=132 [2019-11-20 07:51:13,325 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 12 states. [2019-11-20 07:51:15,590 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) (= .cse1 c_ULTIMATE.start_main_~main__d~0))) is different from true [2019-11-20 07:51:17,846 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (let ((.cse1 (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_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 .cse0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1))))))) is different from true [2019-11-20 07:51:20,218 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_main_~SqrtR__xn~0 .cse0) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1))))))) is different from true [2019-11-20 07:51:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:51:30,398 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2019-11-20 07:51:30,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 07:51:30,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-20 07:51:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:51:30,411 INFO L225 Difference]: With dead ends: 78 [2019-11-20 07:51:30,411 INFO L226 Difference]: Without dead ends: 57 [2019-11-20 07:51:30,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=36, Invalid=51, Unknown=9, NotChecked=114, Total=210 [2019-11-20 07:51:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-20 07:51:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 31. [2019-11-20 07:51:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 07:51:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-11-20 07:51:30,420 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2019-11-20 07:51:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:51:30,420 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-20 07:51:30,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 07:51:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-11-20 07:51:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 07:51:30,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:51:30,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:51:30,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 07:51:30,625 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:51:30,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:51:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1669842835, now seen corresponding path program 1 times [2019-11-20 07:51:30,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:51:30,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539948200] [2019-11-20 07:51:30,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/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 [2019-11-20 07:51:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:51:35,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 07:51:35,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:51:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:51:35,565 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:51:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:51:35,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539948200] [2019-11-20 07:51:35,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:51:35,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 07:51:35,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949973181] [2019-11-20 07:51:35,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:51:35,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:51:35,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:51:35,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:51:35,615 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 6 states. [2019-11-20 07:51:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:51:39,951 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-11-20 07:51:39,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 07:51:39,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-20 07:51:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:51:39,953 INFO L225 Difference]: With dead ends: 64 [2019-11-20 07:51:39,954 INFO L226 Difference]: Without dead ends: 62 [2019-11-20 07:51:39,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:51:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-20 07:51:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 33. [2019-11-20 07:51:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-20 07:51:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-20 07:51:39,965 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 18 [2019-11-20 07:51:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:51:39,966 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-20 07:51:39,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:51:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-11-20 07:51:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 07:51:39,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:51:39,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:51:40,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 07:51:40,169 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:51:40,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:51:40,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1686853496, now seen corresponding path program 1 times [2019-11-20 07:51:40,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:51:40,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731623586] [2019-11-20 07:51:40,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-20 07:51:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:51:45,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 07:51:45,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:51:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:51:45,191 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:51:47,647 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xnp1~0) .cse0)) is different from false [2019-11-20 07:51:51,953 WARN L838 $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_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2019-11-20 07:51:54,671 WARN L860 $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_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2019-11-20 07:51:57,257 WARN L838 $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_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2019-11-20 07:51:59,860 WARN L860 $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_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2019-11-20 07:52:02,454 WARN L838 $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_ULTIMATE.start_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_ULTIMATE.start_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2019-11-20 07:52:05,083 WARN L860 $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_ULTIMATE.start_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_ULTIMATE.start_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2019-11-20 07:52:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-11-20 07:52:05,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731623586] [2019-11-20 07:52:05,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:52:05,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-20 07:52:05,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353435393] [2019-11-20 07:52:05,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 07:52:05,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:52:05,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 07:52:05,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=42, Unknown=7, NotChecked=60, Total=132 [2019-11-20 07:52:05,093 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2019-11-20 07:52:07,715 WARN L860 $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_ULTIMATE.start_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_ULTIMATE.start_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_ULTIMATE.start_main_~main__d~0))) is different from true [2019-11-20 07:52:10,333 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~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_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0))) is different from true [2019-11-20 07:52:13,077 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= c_ULTIMATE.start_main_~SqrtR__xn~0 .cse0))) is different from true [2019-11-20 07:52:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:52,239 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2019-11-20 07:52:52,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 07:52:52,663 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-20 07:52:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:52,664 INFO L225 Difference]: With dead ends: 97 [2019-11-20 07:52:52,664 INFO L226 Difference]: Without dead ends: 74 [2019-11-20 07:52:52,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=10, NotChecked=140, Total=240 [2019-11-20 07:52:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-20 07:52:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 39. [2019-11-20 07:52:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 07:52:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-11-20 07:52:52,677 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 18 [2019-11-20 07:52:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:52,678 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-11-20 07:52:52,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 07:52:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-11-20 07:52:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 07:52:52,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:52,680 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:52,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 07:52:52,882 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:52:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:52,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1075575453, now seen corresponding path program 1 times [2019-11-20 07:52:52,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:52:52,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607059540] [2019-11-20 07:52:52,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/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 [2019-11-20 07:52:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:00,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:53:00,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:53:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:53:00,508 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:53:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:53:00,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607059540] [2019-11-20 07:53:00,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:53:00,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 07:53:00,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201039959] [2019-11-20 07:53:00,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:53:00,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:53:00,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:53:00,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:53:00,517 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 4 states. [2019-11-20 07:53:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:53:08,313 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2019-11-20 07:53:08,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:53:08,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-20 07:53:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:53:08,751 INFO L225 Difference]: With dead ends: 66 [2019-11-20 07:53:08,751 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 07:53:08,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:53:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 07:53:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-20 07:53:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-20 07:53:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-11-20 07:53:08,763 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 22 [2019-11-20 07:53:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:53:08,763 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-20 07:53:08,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:53:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-11-20 07:53:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 07:53:08,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:53:08,765 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:53:08,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 07:53:08,981 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:53:08,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:53:08,981 INFO L82 PathProgramCache]: Analyzing trace with hash 340173568, now seen corresponding path program 1 times [2019-11-20 07:53:08,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:53:08,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765628924] [2019-11-20 07:53:08,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-20 07:53:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:16,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 07:53:16,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:53:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 07:53:16,750 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:53:19,193 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from false [2019-11-20 07:53:21,541 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from true [2019-11-20 07:53:23,774 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))))) is different from false [2019-11-20 07:53:26,016 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))))) is different from true [2019-11-20 07:53:28,254 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))))) is different from false [2019-11-20 07:53:30,491 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))))) is different from true [2019-11-20 07:53:31,569 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 07:53:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 07:53:31,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765628924] [2019-11-20 07:53:31,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:53:31,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-20 07:53:31,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305796162] [2019-11-20 07:53:31,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 07:53:31,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:53:31,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 07:53:31,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=48, Unknown=6, NotChecked=48, Total=132 [2019-11-20 07:53:31,577 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-11-20 07:53:33,839 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse1 c_ULTIMATE.start_main_~main__d~0))) is different from true [2019-11-20 07:53:36,084 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (let ((.cse1 (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_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 .cse0)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1)))))))) is different from true [2019-11-20 07:53:38,479 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_main_~SqrtR__xn~0 .cse0) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1)))))))) is different from true [2019-11-20 07:53:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:53:56,409 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2019-11-20 07:53:56,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 07:53:56,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-20 07:53:56,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:53:56,411 INFO L225 Difference]: With dead ends: 84 [2019-11-20 07:53:56,411 INFO L226 Difference]: Without dead ends: 54 [2019-11-20 07:53:56,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=36, Invalid=51, Unknown=9, NotChecked=114, Total=210 [2019-11-20 07:53:56,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-20 07:53:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2019-11-20 07:53:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 07:53:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-11-20 07:53:56,423 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 23 [2019-11-20 07:53:56,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:53:56,423 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-20 07:53:56,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 07:53:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-11-20 07:53:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 07:53:56,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:53:56,425 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:53:56,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-20 07:53:56,633 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:53:56,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:53:56,634 INFO L82 PathProgramCache]: Analyzing trace with hash 13709678, now seen corresponding path program 1 times [2019-11-20 07:53:56,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:53:56,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385756287] [2019-11-20 07:53:56,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-20 07:54:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:54:04,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 07:54:04,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:54:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:54:04,280 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:54:06,520 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2019-11-20 07:54:08,606 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2019-11-20 07:54:11,166 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2019-11-20 07:54:13,768 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2019-11-20 07:54:16,279 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2019-11-20 07:54:18,832 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2019-11-20 07:54:21,392 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2019-11-20 07:54:23,923 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2019-11-20 07:54:30,655 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-20 07:54:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2019-11-20 07:54:30,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385756287] [2019-11-20 07:54:30,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:54:30,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-20 07:54:30,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487424434] [2019-11-20 07:54:30,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 07:54:30,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:54:30,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 07:54:30,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=63, Unknown=8, NotChecked=76, Total=182 [2019-11-20 07:54:30,664 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 14 states. [2019-11-20 07:54:33,306 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse0 c_ULTIMATE.start_main_~main__d~0) (let ((.cse1 (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse2 .cse2)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse1) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse1))))) is different from true [2019-11-20 07:54:35,931 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_main_~main__d~0 (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) is different from true [2019-11-20 07:54:38,510 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~SqrtR__Input~0 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (let ((.cse1 (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse2 .cse2)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse1) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse1))))) is different from true [2019-11-20 07:54:40,619 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_main_~SqrtR__xn~0 (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))))) is different from true [2019-11-20 07:54:54,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:54:54,470 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2019-11-20 07:54:54,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 07:54:54,472 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-11-20 07:54:54,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:54:54,473 INFO L225 Difference]: With dead ends: 90 [2019-11-20 07:54:54,473 INFO L226 Difference]: Without dead ends: 65 [2019-11-20 07:54:54,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=12, NotChecked=184, Total=306 [2019-11-20 07:54:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-20 07:54:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2019-11-20 07:54:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-20 07:54:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-11-20 07:54:54,484 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 29 [2019-11-20 07:54:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:54:54,485 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-11-20 07:54:54,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 07:54:54,485 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-11-20 07:54:54,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 07:54:54,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:54:54,487 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:54:54,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-20 07:54:54,693 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:54:54,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:54:54,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1340342541, now seen corresponding path program 1 times [2019-11-20 07:54:54,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:54:54,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388639828] [2019-11-20 07:54:54,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-20 07:55:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:55:01,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 07:55:01,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:55:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:55:01,180 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:55:02,759 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-11-20 07:55:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:55:02,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388639828] [2019-11-20 07:55:02,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:55:02,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-20 07:55:02,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605889724] [2019-11-20 07:55:02,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 07:55:02,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:55:02,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 07:55:02,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:55:02,767 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 8 states. [2019-11-20 07:55:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:55:13,884 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2019-11-20 07:55:13,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 07:55:13,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-20 07:55:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:55:13,885 INFO L225 Difference]: With dead ends: 85 [2019-11-20 07:55:13,885 INFO L226 Difference]: Without dead ends: 60 [2019-11-20 07:55:13,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-20 07:55:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-20 07:55:13,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2019-11-20 07:55:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-20 07:55:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-11-20 07:55:13,895 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 29 [2019-11-20 07:55:13,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:55:13,895 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-11-20 07:55:13,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 07:55:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-11-20 07:55:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 07:55:13,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:55:13,897 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:55:14,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-20 07:55:14,117 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:55:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:55:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash -426284202, now seen corresponding path program 1 times [2019-11-20 07:55:14,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:55:14,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129488199] [2019-11-20 07:55:14,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-20 07:55:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:55:24,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:55:24,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:55:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 07:55:24,600 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:55:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 07:55:24,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129488199] [2019-11-20 07:55:24,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:55:24,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 07:55:24,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226598480] [2019-11-20 07:55:24,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:55:24,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:55:24,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:55:24,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:55:24,627 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 6 states. [2019-11-20 07:55:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:55:38,607 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2019-11-20 07:55:38,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:55:38,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-20 07:55:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:55:38,612 INFO L225 Difference]: With dead ends: 77 [2019-11-20 07:55:38,612 INFO L226 Difference]: Without dead ends: 52 [2019-11-20 07:55:38,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:55:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-20 07:55:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-11-20 07:55:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-20 07:55:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-11-20 07:55:38,623 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 33 [2019-11-20 07:55:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:55:38,623 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-11-20 07:55:38,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:55:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-11-20 07:55:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 07:55:38,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:55:38,625 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:55:38,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-20 07:55:38,833 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:55:38,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:55:38,833 INFO L82 PathProgramCache]: Analyzing trace with hash 119314739, now seen corresponding path program 1 times [2019-11-20 07:55:38,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:55:38,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694329331] [2019-11-20 07:55:38,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-20 07:55:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:55:49,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 07:55:49,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:56:00,765 WARN L191 SmtUtils]: Spent 3.69 s on a formula simplification that was a NOOP. DAG size: 16 [2019-11-20 07:56:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:56:00,807 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:56:03,266 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))) is different from false [2019-11-20 07:56:05,664 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))) is different from true [2019-11-20 07:56:08,520 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from false [2019-11-20 07:56:11,400 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from true [2019-11-20 07:56:14,318 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~main__d~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from false [2019-11-20 07:56:17,131 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~main__d~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from true [2019-11-20 07:56:20,031 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from false [2019-11-20 07:56:22,914 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from true [2019-11-20 07:56:23,906 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 07:56:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2019-11-20 07:56:23,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694329331] [2019-11-20 07:56:23,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:56:23,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-20 07:56:23,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572738313] [2019-11-20 07:56:23,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 07:56:23,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:56:23,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 07:56:23,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=60, Unknown=10, NotChecked=76, Total=182 [2019-11-20 07:56:23,918 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 14 states. [2019-11-20 07:56:26,827 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse0 c_ULTIMATE.start_main_~main__d~0) (let ((.cse3 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 .cse3))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse3) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1)))))))) is different from true [2019-11-20 07:56:29,672 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~main__d~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_main_~main__d~0 (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) is different from true [2019-11-20 07:56:32,499 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~SqrtR__Input~0 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1))))))) is different from true [2019-11-20 07:56:34,906 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~SqrtR__Input~0 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1)))))) is different from true [2019-11-20 07:57:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:57:05,933 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2019-11-20 07:57:05,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 07:57:05,935 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-11-20 07:57:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:57:05,936 INFO L225 Difference]: With dead ends: 83 [2019-11-20 07:57:05,936 INFO L226 Difference]: Without dead ends: 58 [2019-11-20 07:57:05,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=44, Invalid=64, Unknown=14, NotChecked=184, Total=306 [2019-11-20 07:57:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-20 07:57:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-11-20 07:57:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 07:57:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-11-20 07:57:05,948 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 33 [2019-11-20 07:57:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:57:05,949 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-11-20 07:57:05,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 07:57:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-11-20 07:57:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 07:57:05,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:57:05,951 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:57:06,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-20 07:57:06,173 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:57:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:57:06,173 INFO L82 PathProgramCache]: Analyzing trace with hash 346299736, now seen corresponding path program 2 times [2019-11-20 07:57:06,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:57:06,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830770637] [2019-11-20 07:57:06,174 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7a5f1e6-8836-455b-8dc6-b10646772e3e/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-20 07:57:19,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 07:57:19,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:57:20,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 07:57:20,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:57:27,895 WARN L191 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 07:57:39,630 WARN L191 SmtUtils]: Spent 6.25 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 07:57:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:57:39,694 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:58:20,418 WARN L191 SmtUtils]: Spent 3.90 s on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 07:58:23,167 WARN L838 $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_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2019-11-20 07:58:25,918 WARN L860 $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_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2019-11-20 07:58:29,021 WARN L838 $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_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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 [2019-11-20 07:58:32,010 WARN L860 $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_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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 [2019-11-20 07:58:36,062 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse6 ((_ 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_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (let ((.cse5 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse5) .cse5) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) .cse5)))))) .cse6))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse6))) .cse0)) is different from false [2019-11-20 07:58:38,270 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-20 07:58:38,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-20 07:58:38,471 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:851) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:576) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 42 more [2019-11-20 07:58:38,476 INFO L168 Benchmark]: Toolchain (without parser) took 527273.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 956.4 MB in the beginning and 1.0 GB in the end (delta: -60.5 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. [2019-11-20 07:58:38,476 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:58:38,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.79 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 940.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-20 07:58:38,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -211.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-20 07:58:38,477 INFO L168 Benchmark]: Boogie Preprocessor took 34.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-20 07:58:38,479 INFO L168 Benchmark]: RCFGBuilder took 9721.96 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: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-11-20 07:58:38,480 INFO L168 Benchmark]: TraceAbstraction took 517118.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -1.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.7 MB). Peak memory consumption was 109.6 MB. Max. memory is 11.5 GB. [2019-11-20 07:58:38,482 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 284.79 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 940.3 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 109.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -211.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 9721.96 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: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 517118.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -1.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.7 MB). Peak memory consumption was 109.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...