./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.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_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 .............................................................................................................................................................................................................................................. 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_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:15:02,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:15:02,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:15:02,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:15:02,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:15:02,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:15:02,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:15:02,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:15:02,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:15:02,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:15:02,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:15:02,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:15:02,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:15:02,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:15:02,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:15:02,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:15:02,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:15:02,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:15:02,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:15:02,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:15:02,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:15:02,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:15:02,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:15:02,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:15:02,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:15:02,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:15:02,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:15:02,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:15:02,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:15:02,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:15:02,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:15:02,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:15:02,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:15:02,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:15:02,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:15:02,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:15:02,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:15:02,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:15:02,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:15:02,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:15:02,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:15:02,758 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:15:02,770 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:15:02,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:15:02,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:15:02,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:15:02,772 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:15:02,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:15:02,772 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:15:02,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:15:02,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:15:02,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:15:02,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:15:02,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:15:02,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:15:02,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:15:02,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:15:02,774 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:15:02,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:15:02,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:15:02,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:15:02,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:15:02,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:15:02,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:15:02,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:15:02,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:15:02,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:15:02,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:15:02,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:15:02,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:15:02,785 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_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2019-11-20 03:15:02,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:15:02,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:15:02,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:15:02,949 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:15:02,949 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:15:02,950 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2019-11-20 03:15:03,017 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/data/4279763a1/9cc395642a6543d5bd47bb0df3aa1281/FLAGa2842d4e7 [2019-11-20 03:15:03,399 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:15:03,400 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2019-11-20 03:15:03,406 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/data/4279763a1/9cc395642a6543d5bd47bb0df3aa1281/FLAGa2842d4e7 [2019-11-20 03:15:03,420 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/data/4279763a1/9cc395642a6543d5bd47bb0df3aa1281 [2019-11-20 03:15:03,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:15:03,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:15:03,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:15:03,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:15:03,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:15:03,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:15:03" (1/1) ... [2019-11-20 03:15:03,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63bcaf9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03, skipping insertion in model container [2019-11-20 03:15:03,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:15:03" (1/1) ... [2019-11-20 03:15:03,443 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:15:03,464 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:15:03,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:15:03,696 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:15:03,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:15:03,724 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:15:03,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03 WrapperNode [2019-11-20 03:15:03,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:15:03,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:15:03,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:15:03,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:15:03,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03" (1/1) ... [2019-11-20 03:15:03,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03" (1/1) ... [2019-11-20 03:15:03,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:15:03,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:15:03,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:15:03,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:15:03,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03" (1/1) ... [2019-11-20 03:15:03,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03" (1/1) ... [2019-11-20 03:15:03,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03" (1/1) ... [2019-11-20 03:15:03,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03" (1/1) ... [2019-11-20 03:15:03,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03" (1/1) ... [2019-11-20 03:15:03,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03" (1/1) ... [2019-11-20 03:15:03,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03" (1/1) ... [2019-11-20 03:15:03,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:15:03,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:15:03,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:15:03,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:15:03,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 03:15:03,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:15:03,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:15:04,095 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:15:04,096 INFO L285 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-20 03:15:04,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:15:04 BoogieIcfgContainer [2019-11-20 03:15:04,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:15:04,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:15:04,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:15:04,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:15:04,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:15:03" (1/3) ... [2019-11-20 03:15:04,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e15236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:15:04, skipping insertion in model container [2019-11-20 03:15:04,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:03" (2/3) ... [2019-11-20 03:15:04,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e15236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:15:04, skipping insertion in model container [2019-11-20 03:15:04,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:15:04" (3/3) ... [2019-11-20 03:15:04,108 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2019-11-20 03:15:04,116 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:15:04,122 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:15:04,132 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:15:04,165 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:15:04,166 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:15:04,166 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:15:04,166 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:15:04,166 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:15:04,166 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:15:04,167 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:15:04,167 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:15:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-11-20 03:15:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 03:15:04,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:04,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:04,187 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:15:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:04,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2019-11-20 03:15:04,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:15:04,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477384920] [2019-11-20 03:15:04,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:15:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:15:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:15:04,316 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:15:04,317 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 03:15:04,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:15:04 BoogieIcfgContainer [2019-11-20 03:15:04,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:15:04,343 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:15:04,343 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:15:04,343 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:15:04,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:15:04" (3/4) ... [2019-11-20 03:15:04,346 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 03:15:04,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:15:04,349 INFO L168 Benchmark]: Toolchain (without parser) took 922.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:15:04,349 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:15:04,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:15:04,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.84 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 03:15:04,351 INFO L168 Benchmark]: Boogie Preprocessor took 18.08 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:15:04,352 INFO L168 Benchmark]: RCFGBuilder took 315.06 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:15:04,353 INFO L168 Benchmark]: TraceAbstraction took 245.05 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:15:04,354 INFO L168 Benchmark]: Witness Printer took 3.87 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 03:15:04,358 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.84 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 18.08 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 315.06 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 245.05 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 15]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L17] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L44] double d, r; [L46] d = 1. VAL [_EPS=1/1000000] [L46] COND TRUE d <= 20. [L21] double xn, xnp1, residu, lsup, linf; [L22] int i, cond; VAL [_EPS=1/1000000] [L23] COND TRUE Input <= 1.0 [L23] xn = 1.0 VAL [_EPS=1/1000000] [L24] xnp1 = xn [L25] residu = 2.0*_EPS*(xn+xnp1) [L26] lsup = _EPS * (xn+xnp1) [L27] linf = -lsup [L28] cond = ((residu > lsup) || (residu < linf)) [L29] i = 0 VAL [_EPS=1/1000000] [L30] COND FALSE !(\read(cond)) VAL [_EPS=1/1000000] [L39] return 1.0 / xnp1; VAL [_EPS=1/1000000] [L48] r = SqrtR(d) [L15] COND TRUE !(cond) VAL [_EPS=1/1000000] [L15] __VERIFIER_error() VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 03:15:06,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:15:06,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:15:06,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:15:06,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:15:06,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:15:06,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:15:06,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:15:06,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:15:06,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:15:06,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:15:06,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:15:06,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:15:06,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:15:06,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:15:06,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:15:06,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:15:06,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:15:06,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:15:06,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:15:06,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:15:06,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:15:06,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:15:06,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:15:06,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:15:06,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:15:06,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:15:06,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:15:06,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:15:06,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:15:06,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:15:06,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:15:06,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:15:06,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:15:06,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:15:06,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:15:06,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:15:06,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:15:06,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:15:06,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:15:06,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:15:06,267 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 03:15:06,290 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:15:06,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:15:06,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:15:06,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:15:06,292 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:15:06,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:15:06,292 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:15:06,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:15:06,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:15:06,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:15:06,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:15:06,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:15:06,294 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 03:15:06,294 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 03:15:06,295 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:15:06,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:15:06,295 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:15:06,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:15:06,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:15:06,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:15:06,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:15:06,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:15:06,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:15:06,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:15:06,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:15:06,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:15:06,298 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 03:15:06,298 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 03:15:06,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:15:06,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 03:15:06,298 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_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2019-11-20 03:15:06,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:15:06,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:15:06,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:15:06,594 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:15:06,594 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:15:06,595 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2019-11-20 03:15:06,657 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/data/b2b932ba7/2b8f3b3b46c3425a966125a216c180d9/FLAGefc29b5aa [2019-11-20 03:15:07,132 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:15:07,132 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2019-11-20 03:15:07,138 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/data/b2b932ba7/2b8f3b3b46c3425a966125a216c180d9/FLAGefc29b5aa [2019-11-20 03:15:07,567 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/bin/uautomizer/data/b2b932ba7/2b8f3b3b46c3425a966125a216c180d9 [2019-11-20 03:15:07,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:15:07,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:15:07,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:15:07,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:15:07,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:15:07,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:15:07" (1/1) ... [2019-11-20 03:15:07,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@542c4444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07, skipping insertion in model container [2019-11-20 03:15:07,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:15:07" (1/1) ... [2019-11-20 03:15:07,595 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:15:07,618 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:15:07,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:15:07,840 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:15:07,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:15:07,907 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:15:07,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07 WrapperNode [2019-11-20 03:15:07,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:15:07,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:15:07,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:15:07,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:15:07,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07" (1/1) ... [2019-11-20 03:15:07,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07" (1/1) ... [2019-11-20 03:15:08,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:15:08,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:15:08,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:15:08,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:15:08,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07" (1/1) ... [2019-11-20 03:15:08,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07" (1/1) ... [2019-11-20 03:15:08,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07" (1/1) ... [2019-11-20 03:15:08,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07" (1/1) ... [2019-11-20 03:15:08,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07" (1/1) ... [2019-11-20 03:15:08,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07" (1/1) ... [2019-11-20 03:15:08,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07" (1/1) ... [2019-11-20 03:15:08,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:15:08,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:15:08,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:15:08,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:15:08,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 03:15:08,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:15:08,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:15:17,660 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:15:17,661 INFO L285 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-20 03:15:17,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:15:17 BoogieIcfgContainer [2019-11-20 03:15:17,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:15:17,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:15:17,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:15:17,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:15:17,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:15:07" (1/3) ... [2019-11-20 03:15:17,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218ac0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:15:17, skipping insertion in model container [2019-11-20 03:15:17,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:07" (2/3) ... [2019-11-20 03:15:17,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218ac0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:15:17, skipping insertion in model container [2019-11-20 03:15:17,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:15:17" (3/3) ... [2019-11-20 03:15:17,670 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2019-11-20 03:15:17,679 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:15:17,686 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:15:17,699 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:15:17,725 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:15:17,725 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:15:17,726 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:15:17,726 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:15:17,726 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:15:17,727 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:15:17,727 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:15:17,727 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:15:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-11-20 03:15:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 03:15:17,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:17,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:17,747 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:15:17,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:17,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2019-11-20 03:15:17,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:17,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852662530] [2019-11-20 03:15:17,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 03:15:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:19,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:15:19,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:19,517 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 03:15:19,517 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:21,639 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_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))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5))) is different from false [2019-11-20 03:15:23,711 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_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))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5))) is different from true [2019-11-20 03:15:32,484 WARN L191 SmtUtils]: Spent 4.99 s on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-11-20 03:15:32,487 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 03:15:32,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852662530] [2019-11-20 03:15:32,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:15:32,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 03:15:32,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887156837] [2019-11-20 03:15:32,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:15:32,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:32,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:15:32,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2019-11-20 03:15:32,507 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 8 states. [2019-11-20 03:15:34,606 WARN L860 $PredicateComparison]: unable to prove that (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~xn~0) (or (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_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))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)))) is different from true [2019-11-20 03:15:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:51,025 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2019-11-20 03:15:51,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:15:51,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-20 03:15:51,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:51,138 INFO L225 Difference]: With dead ends: 39 [2019-11-20 03:15:51,138 INFO L226 Difference]: Without dead ends: 17 [2019-11-20 03:15:51,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2019-11-20 03:15:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-20 03:15:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-20 03:15:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-20 03:15:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-20 03:15:51,176 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2019-11-20 03:15:51,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:51,177 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-20 03:15:51,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:15:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-11-20 03:15:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 03:15:51,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:51,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:51,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 03:15:51,400 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:15:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash 68780179, now seen corresponding path program 1 times [2019-11-20 03:15:51,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:51,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881908709] [2019-11-20 03:15:51,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 03:15:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:53,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:15:53,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:53,548 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 03:15:53,548 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:53,576 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 03:15:53,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881908709] [2019-11-20 03:15:53,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:15:53,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:15:53,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069771450] [2019-11-20 03:15:53,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:15:53,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:53,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:15:53,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:15:53,580 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2019-11-20 03:15:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:58,236 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-11-20 03:15:58,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:15:58,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-20 03:15:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:58,237 INFO L225 Difference]: With dead ends: 35 [2019-11-20 03:15:58,238 INFO L226 Difference]: Without dead ends: 25 [2019-11-20 03:15:58,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 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 03:15:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-20 03:15:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2019-11-20 03:15:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-20 03:15:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-11-20 03:15:58,243 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2019-11-20 03:15:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:58,243 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-20 03:15:58,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:15:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-11-20 03:15:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 03:15:58,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:58,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:58,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 03:15:58,456 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:15:58,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:58,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1301780435, now seen corresponding path program 1 times [2019-11-20 03:15:58,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:58,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897692583] [2019-11-20 03:15:58,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 03:16:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:16:02,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 03:16:02,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:16:02,995 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 03:16:02,995 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:16:05,495 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2019-11-20 03:16:07,864 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2019-11-20 03:16:10,514 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_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_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2019-11-20 03:16:13,129 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_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_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2019-11-20 03:16:15,647 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .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_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2019-11-20 03:16:18,152 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .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_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2019-11-20 03:16:20,738 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2019-11-20 03:16:23,246 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2019-11-20 03:16:23,257 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 03:16:23,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897692583] [2019-11-20 03:16:23,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:16:23,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-20 03:16:23,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822077754] [2019-11-20 03:16:23,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 03:16:23,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:16:23,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 03:16:23,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=70, Unknown=8, NotChecked=76, Total=182 [2019-11-20 03:16:23,260 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 14 states. [2019-11-20 03:16:25,758 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1) (= .cse1 c_ULTIMATE.start_main_~d~0)))) is different from true [2019-11-20 03:16:28,286 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .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_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (= .cse1 c_ULTIMATE.start_SqrtR_~Input) (fp.geq .cse0 .cse1)))) is different from false [2019-11-20 03:16:30,815 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .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_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (= .cse1 c_ULTIMATE.start_SqrtR_~Input) (fp.geq .cse0 .cse1)))) is different from true [2019-11-20 03:16:33,428 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_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_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (= .cse0 c_ULTIMATE.start_SqrtR_~Input) (fp.geq .cse1 .cse0) (= .cse0 c_ULTIMATE.start_SqrtR_~xn~0) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2019-11-20 03:16:36,118 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_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_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (= .cse0 c_ULTIMATE.start_SqrtR_~Input) (fp.geq .cse1 .cse0) (= .cse0 c_ULTIMATE.start_SqrtR_~xn~0) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2019-11-20 03:16:38,496 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1) (= c_ULTIMATE.start_SqrtR_~xnp1~0 (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 .cse1 .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) .cse1) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))))) is different from true [2019-11-20 03:17:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:17:10,044 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-11-20 03:17:10,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 03:17:10,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2019-11-20 03:17:10,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:17:10,046 INFO L225 Difference]: With dead ends: 32 [2019-11-20 03:17:10,046 INFO L226 Difference]: Without dead ends: 30 [2019-11-20 03:17:10,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=42, Invalid=86, Unknown=14, NotChecked=200, Total=342 [2019-11-20 03:17:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-20 03:17:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2019-11-20 03:17:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-20 03:17:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-20 03:17:10,053 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2019-11-20 03:17:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:17:10,053 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-20 03:17:10,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 03:17:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-20 03:17:10,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 03:17:10,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:17:10,054 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:17:10,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 03:17:10,256 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:17:10,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:17:10,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1648833135, now seen corresponding path program 2 times [2019-11-20 03:17:10,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:17:10,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459530510] [2019-11-20 03:17:10,258 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 03:17:16,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:17:16,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:17:16,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 03:17:16,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:17:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:17:19,025 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:17:21,423 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2019-11-20 03:17:26,197 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_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_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2019-11-20 03:17:28,809 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_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_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2019-11-20 03:17:31,615 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) .cse6))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2019-11-20 03:17:34,523 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) .cse6))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2019-11-20 03:17:37,244 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse1) .cse1))))) .cse6))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2019-11-20 03:17:39,951 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse1) .cse1))))) .cse6))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2019-11-20 03:17:42,667 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse1) .cse1))))) .cse6))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2019-11-20 03:17:45,386 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse1) .cse1))))) .cse6))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2019-11-20 03:17:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-11-20 03:17:45,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459530510] [2019-11-20 03:17:45,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:17:45,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-20 03:17:45,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156490879] [2019-11-20 03:17:45,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 03:17:45,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:17:45,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 03:17:45,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=71, Unknown=9, NotChecked=100, Total=210 [2019-11-20 03:17:45,399 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 15 states. [2019-11-20 03:17:48,125 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse0) .cse0))))) .cse6))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse2) .cse2))))))) .cse6))))) (and (= .cse0 c_ULTIMATE.start_main_~d~0) (fp.geq .cse1 .cse0) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2019-11-20 03:17:50,861 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse0) .cse0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse0) .cse0))))) .cse6))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse2) .cse2))))))) .cse6))))) (and (= .cse0 c_ULTIMATE.start_SqrtR_~Input) (fp.geq .cse1 .cse0) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2019-11-20 03:17:53,767 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) .cse6))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse2) .cse2))))))) .cse6))))) (and (= .cse0 c_ULTIMATE.start_SqrtR_~Input) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse1 .cse0) (= .cse0 c_ULTIMATE.start_SqrtR_~xn~0)))) is different from true [2019-11-20 03:17:56,312 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) .cse5)))) (and (= .cse0 c_ULTIMATE.start_SqrtR_~Input) (fp.geq .cse1 .cse0) (= c_ULTIMATE.start_SqrtR_~xnp1~0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0) .cse0))))) .cse5)) (= .cse0 c_ULTIMATE.start_SqrtR_~xn~0) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2019-11-20 03:17:58,918 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) .cse5)))) (and (= .cse0 c_ULTIMATE.start_SqrtR_~Input) (fp.geq .cse1 .cse0) (= c_ULTIMATE.start_SqrtR_~xnp1~0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0) .cse0))))) .cse5)) (= .cse0 c_ULTIMATE.start_SqrtR_~xn~0) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2019-11-20 03:18:02,333 WARN L191 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-11-20 03:18:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:18:35,563 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-11-20 03:18:35,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 03:18:35,952 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2019-11-20 03:18:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:18:35,953 INFO L225 Difference]: With dead ends: 35 [2019-11-20 03:18:35,953 INFO L226 Difference]: Without dead ends: 33 [2019-11-20 03:18:35,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 46.4s TimeCoverageRelationStatistics Valid=78, Invalid=154, Unknown=14, NotChecked=306, Total=552 [2019-11-20 03:18:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-20 03:18:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2019-11-20 03:18:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-20 03:18:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-20 03:18:35,961 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2019-11-20 03:18:35,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:18:35,961 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-20 03:18:35,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 03:18:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-20 03:18:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 03:18:35,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:18:35,962 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:18:36,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 03:18:36,167 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:18:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:18:36,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1471521565, now seen corresponding path program 1 times [2019-11-20 03:18:36,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:18:36,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778548123] [2019-11-20 03:18:36,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 03:18:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:18:42,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:18:42,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:18:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:18:42,190 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:18:43,942 WARN L191 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-11-20 03:18:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:18:43,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778548123] [2019-11-20 03:18:43,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:18:43,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-20 03:18:43,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953699785] [2019-11-20 03:18:43,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:18:43,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:18:43,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:18:43,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:18:43,950 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 8 states. [2019-11-20 03:18:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:18:57,027 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2019-11-20 03:18:57,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:18:57,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-20 03:18:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:18:57,038 INFO L225 Difference]: With dead ends: 50 [2019-11-20 03:18:57,038 INFO L226 Difference]: Without dead ends: 40 [2019-11-20 03:18:57,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:18:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-20 03:18:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 20. [2019-11-20 03:18:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-20 03:18:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-11-20 03:18:57,045 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 19 [2019-11-20 03:18:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:18:57,046 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-20 03:18:57,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:18:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-11-20 03:18:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 03:18:57,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:18:57,048 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:18:57,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 03:18:57,256 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:18:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:18:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1048438369, now seen corresponding path program 1 times [2019-11-20 03:18:57,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:18:57,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278533665] [2019-11-20 03:18:57,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 03:19:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:19:03,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 03:19:03,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:19:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:19:04,162 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:19:06,297 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_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))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_21 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_21))) is different from false [2019-11-20 03:19:08,389 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_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))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_21 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_21))) is different from true [2019-11-20 03:19:10,905 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (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))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_21 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse2 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse2 .cse2))) v_ULTIMATE.start_SqrtR_~linf~0_21))) is different from false [2019-11-20 03:19:13,472 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (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))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_21 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse2 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse2 .cse2))) v_ULTIMATE.start_SqrtR_~linf~0_21))) is different from true [2019-11-20 03:19:15,966 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_21 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~d~0))) (fp.add roundNearestTiesToEven .cse0 .cse0))) v_ULTIMATE.start_SqrtR_~linf~0_21)) (let ((.cse1 (let ((.cse2 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~d~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 false [2019-11-20 03:19:18,446 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_21 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~d~0))) (fp.add roundNearestTiesToEven .cse0 .cse0))) v_ULTIMATE.start_SqrtR_~linf~0_21)) (let ((.cse1 (let ((.cse2 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~d~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 03:19:21,017 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_21 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse0 (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse1))))) (fp.add roundNearestTiesToEven .cse0 .cse0))) v_ULTIMATE.start_SqrtR_~linf~0_21)) (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse4))))) (fp.add roundNearestTiesToEven .cse3 .cse3)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse2) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse2)))) is different from false [2019-11-20 03:19:23,515 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_21 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse0 (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse1))))) (fp.add roundNearestTiesToEven .cse0 .cse0))) v_ULTIMATE.start_SqrtR_~linf~0_21)) (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse4))))) (fp.add roundNearestTiesToEven .cse3 .cse3)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse2) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse2)))) is different from true [2019-11-20 03:19:32,024 WARN L191 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2019-11-20 03:19:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2019-11-20 03:19:32,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278533665] [2019-11-20 03:19:32,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:19:32,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-20 03:19:32,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343717801] [2019-11-20 03:19:32,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 03:19:32,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:19:32,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 03:19:32,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=63, Unknown=8, NotChecked=76, Total=182 [2019-11-20 03:19:32,033 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 14 states. [2019-11-20 03:19:34,599 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~d~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_21 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse2))))) (fp.add roundNearestTiesToEven .cse1 .cse1))) v_ULTIMATE.start_SqrtR_~linf~0_21)) (let ((.cse3 (let ((.cse4 (fp.div roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse0)))) (fp.add roundNearestTiesToEven .cse4 .cse4)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse3) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse3)))))) is different from true [2019-11-20 03:19:37,173 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_21 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~d~0))) (fp.add roundNearestTiesToEven .cse0 .cse0))) v_ULTIMATE.start_SqrtR_~linf~0_21)) (let ((.cse1 (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~d~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)))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_main_~d~0 (fp.add roundNearestTiesToEven .cse3 .cse3)))) is different from true [2019-11-20 03:19:39,749 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse0) c_ULTIMATE.start_SqrtR_~Input) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (or (let ((.cse1 (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_SqrtR_~Input))) (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))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_21 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse3 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse3 .cse3))) v_ULTIMATE.start_SqrtR_~linf~0_21))))) is different from true [2019-11-20 03:19:41,852 WARN L860 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse0 .cse0))) c_ULTIMATE.start_SqrtR_~xn~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (or (let ((.cse1 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (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))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_21 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_21)))) is different from true [2019-11-20 03:20:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:20:05,627 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-11-20 03:20:05,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 03:20:05,713 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-11-20 03:20:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:20:05,714 INFO L225 Difference]: With dead ends: 35 [2019-11-20 03:20:05,714 INFO L226 Difference]: Without dead ends: 25 [2019-11-20 03:20:05,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=12, NotChecked=184, Total=306 [2019-11-20 03:20:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-20 03:20:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-20 03:20:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 03:20:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-11-20 03:20:05,722 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 19 [2019-11-20 03:20:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:20:05,722 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-20 03:20:05,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 03:20:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-11-20 03:20:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 03:20:05,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:20:05,724 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:20:05,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 03:20:05,936 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:20:05,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:20:05,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1909803615, now seen corresponding path program 2 times [2019-11-20 03:20:05,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:20:05,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510099525] [2019-11-20 03:20:05,937 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e697a83-5bb5-4c5a-bc62-c88fa446efc9/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 03:20:13,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:20:13,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:20:14,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 03:20:14,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:20:23,922 WARN L191 SmtUtils]: Spent 4.93 s on a formula simplification that was a NOOP. DAG size: 10 [2019-11-20 03:20:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:20:24,000 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:20:26,405 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2019-11-20 03:20:28,770 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2019-11-20 03:20:31,385 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_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_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2019-11-20 03:20:34,012 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_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_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2019-11-20 03:20:35,862 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-20 03:20:36,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 03:20:36,063 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:829) 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 03:20:36,067 INFO L168 Benchmark]: Toolchain (without parser) took 328495.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 952.4 MB in the beginning and 879.2 MB in the end (delta: 73.2 MB). Peak memory consumption was 234.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:20:36,068 INFO L168 Benchmark]: CDTParser took 0.28 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 03:20:36,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.26 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:20:36,069 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 941.7 MB in the beginning and 1.2 GB in the end (delta: -208.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:20:36,069 INFO L168 Benchmark]: Boogie Preprocessor took 64.16 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:20:36,070 INFO L168 Benchmark]: RCFGBuilder took 9535.55 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: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:20:36,070 INFO L168 Benchmark]: TraceAbstraction took 318402.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.2 MB in the end (delta: 244.9 MB). Peak memory consumption was 244.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:20:36,073 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.28 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 335.26 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 153.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 941.7 MB in the beginning and 1.2 GB in the end (delta: -208.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.16 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 9535.55 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: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 318402.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.2 MB in the end (delta: 244.9 MB). Peak memory consumption was 244.9 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...