./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/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: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/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.23-0cd3be1 [2018-11-28 10:33:47,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:33:47,497 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:33:47,504 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:33:47,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:33:47,505 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:33:47,506 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:33:47,507 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:33:47,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:33:47,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:33:47,509 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:33:47,509 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:33:47,510 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:33:47,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:33:47,511 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:33:47,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:33:47,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:33:47,512 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:33:47,514 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:33:47,514 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:33:47,515 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:33:47,516 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:33:47,517 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:33:47,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:33:47,518 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:33:47,518 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:33:47,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:33:47,519 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:33:47,520 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:33:47,520 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:33:47,521 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:33:47,521 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:33:47,521 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:33:47,521 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:33:47,522 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:33:47,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:33:47,523 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 10:33:47,530 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:33:47,530 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:33:47,531 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 10:33:47,531 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 10:33:47,531 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:33:47,532 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:33:47,532 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:33:47,532 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:33:47,532 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:33:47,532 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:33:47,532 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:33:47,532 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:33:47,533 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 10:33:47,533 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 10:33:47,533 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 10:33:47,533 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:33:47,533 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:33:47,533 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:33:47,534 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 10:33:47,534 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:33:47,534 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:33:47,534 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 10:33:47,534 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 10:33:47,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 10:33:47,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:33:47,535 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 10:33:47,535 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 10:33:47,535 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:33:47,535 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 10:33:47,535 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 10:33:47,535 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/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 [2018-11-28 10:33:47,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:33:47,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:33:47,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:33:47,572 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:33:47,572 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:33:47,572 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-28 10:33:47,616 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/data/5f224936d/0e15c3f639fc4110b42dfeef5d068a60/FLAGecf086b2f [2018-11-28 10:33:48,019 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:33:48,020 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-28 10:33:48,024 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/data/5f224936d/0e15c3f639fc4110b42dfeef5d068a60/FLAGecf086b2f [2018-11-28 10:33:48,034 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/data/5f224936d/0e15c3f639fc4110b42dfeef5d068a60 [2018-11-28 10:33:48,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:33:48,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:33:48,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:48,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:33:48,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:33:48,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:48" (1/1) ... [2018-11-28 10:33:48,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de80484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48, skipping insertion in model container [2018-11-28 10:33:48,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:48" (1/1) ... [2018-11-28 10:33:48,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:33:48,060 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:33:48,164 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:48,168 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:33:48,181 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:48,189 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:33:48,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48 WrapperNode [2018-11-28 10:33:48,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:48,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:48,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:33:48,189 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:33:48,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48" (1/1) ... [2018-11-28 10:33:48,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48" (1/1) ... [2018-11-28 10:33:48,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:48,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:33:48,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:33:48,203 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:33:48,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48" (1/1) ... [2018-11-28 10:33:48,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48" (1/1) ... [2018-11-28 10:33:48,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48" (1/1) ... [2018-11-28 10:33:48,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48" (1/1) ... [2018-11-28 10:33:48,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48" (1/1) ... [2018-11-28 10:33:48,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48" (1/1) ... [2018-11-28 10:33:48,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48" (1/1) ... [2018-11-28 10:33:48,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:33:48,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:33:48,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:33:48,256 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:33:48,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/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 [2018-11-28 10:33:48,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 10:33:48,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 10:33:48,288 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-28 10:33:48,289 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-28 10:33:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:33:48,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:33:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 10:33:48,289 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 10:33:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 10:33:48,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 10:33:48,394 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:33:48,395 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 10:33:48,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:48 BoogieIcfgContainer [2018-11-28 10:33:48,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:33:48,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 10:33:48,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 10:33:48,398 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 10:33:48,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:33:48" (1/3) ... [2018-11-28 10:33:48,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf4b86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:33:48, skipping insertion in model container [2018-11-28 10:33:48,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:48" (2/3) ... [2018-11-28 10:33:48,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf4b86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:33:48, skipping insertion in model container [2018-11-28 10:33:48,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:48" (3/3) ... [2018-11-28 10:33:48,401 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-11-28 10:33:48,409 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 10:33:48,414 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 10:33:48,426 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 10:33:48,448 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:33:48,449 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 10:33:48,449 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 10:33:48,449 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 10:33:48,449 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:33:48,449 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:33:48,450 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 10:33:48,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:33:48,450 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 10:33:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-28 10:33:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 10:33:48,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:48,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:48,469 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:33:48,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash -995072322, now seen corresponding path program 1 times [2018-11-28 10:33:48,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:48,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:48,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:48,560 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 10:33:48,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:33:48 BoogieIcfgContainer [2018-11-28 10:33:48,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 10:33:48,582 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:33:48,582 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:33:48,582 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:33:48,582 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:48" (3/4) ... [2018-11-28 10:33:48,585 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:33:48,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:33:48,585 INFO L168 Benchmark]: Toolchain (without parser) took 548.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -138.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:48,586 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:48,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.91 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:48,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.51 ms. Allocated memory is still 1.0 GB. Free memory is still 943.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:48,587 INFO L168 Benchmark]: Boogie Preprocessor took 52.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:48,588 INFO L168 Benchmark]: RCFGBuilder took 139.20 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:48,588 INFO L168 Benchmark]: TraceAbstraction took 185.95 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.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:48,589 INFO L168 Benchmark]: Witness Printer took 2.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:48,591 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.91 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 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 13.51 ms. Allocated memory is still 1.0 GB. Free memory is still 943.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 139.20 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 185.95 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.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.97 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 [\old(_EPS)=2, _EPS=1/1000000] [L44] double d, r; [L46] d = 1. VAL [_EPS=1/1000000, d=1] [L46] COND TRUE d <= 20. VAL [_EPS=1/1000000, d=1] [L48] CALL, EXPR SqrtR(d) VAL [\old(Input)=1, _EPS=1/1000000] [L21] double xn, xnp1, residu, lsup, linf; [L22] int i, cond; VAL [\old(Input)=1, _EPS=1/1000000, Input=1] [L23] COND TRUE Input <= 1.0 [L23] xn = 1.0 VAL [\old(Input)=1, _EPS=1/1000000, Input=1, xn=1] [L24] xnp1 = xn [L25] residu = 2.0*_EPS*(xn+xnp1) [L26] lsup = _EPS * (xn+xnp1) [L27] linf = -lsup [L28] cond = ((residu > lsup) || (residu < linf)) [L29] i = 0 VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L30] COND FALSE !(\read(cond)) VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L39] return 1.0 / xnp1; VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L48] RET, EXPR SqrtR(d) VAL [_EPS=1/1000000, d=1, SqrtR(d)=3] [L48] r = SqrtR(d) [L50] CALL __VERIFIER_assert(r >= 1.0 && r <= 5.0) VAL [\old(cond)=0, _EPS=1/1000000] [L15] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L15] __VERIFIER_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-0cd3be1 [2018-11-28 10:33:49,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:33:49,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:33:49,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:33:49,999 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:33:50,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:33:50,000 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:33:50,001 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:33:50,002 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:33:50,002 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:33:50,003 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:33:50,003 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:33:50,003 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:33:50,004 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:33:50,005 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:33:50,005 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:33:50,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:33:50,006 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:33:50,008 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:33:50,008 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:33:50,009 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:33:50,009 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:33:50,010 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:33:50,010 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:33:50,011 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:33:50,011 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:33:50,012 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:33:50,012 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:33:50,012 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:33:50,013 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:33:50,013 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:33:50,014 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:33:50,014 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:33:50,014 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:33:50,015 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:33:50,015 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:33:50,015 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-28 10:33:50,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:33:50,025 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:33:50,026 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 10:33:50,026 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 10:33:50,026 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:33:50,027 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:33:50,027 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:33:50,027 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:33:50,027 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:33:50,027 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:33:50,027 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:33:50,028 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 10:33:50,028 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 10:33:50,028 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 10:33:50,028 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 10:33:50,028 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 10:33:50,028 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:33:50,028 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:33:50,028 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:33:50,029 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 10:33:50,029 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:33:50,029 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:33:50,029 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 10:33:50,029 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 10:33:50,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 10:33:50,030 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:33:50,030 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 10:33:50,030 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 10:33:50,030 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 10:33:50,030 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 10:33:50,030 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 10:33:50,030 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-28 10:33:50,030 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/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 [2018-11-28 10:33:50,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:33:50,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:33:50,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:33:50,068 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:33:50,068 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:33:50,069 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-28 10:33:50,117 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/data/09ffbab92/5057a8d4b83c4852838df2490afe012b/FLAG98a50992b [2018-11-28 10:33:50,440 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:33:50,441 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-11-28 10:33:50,444 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/data/09ffbab92/5057a8d4b83c4852838df2490afe012b/FLAG98a50992b [2018-11-28 10:33:50,878 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/uautomizer/data/09ffbab92/5057a8d4b83c4852838df2490afe012b [2018-11-28 10:33:50,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:33:50,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:33:50,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:50,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:33:50,884 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:33:50,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:50" (1/1) ... [2018-11-28 10:33:50,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3eb2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:50, skipping insertion in model container [2018-11-28 10:33:50,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:50" (1/1) ... [2018-11-28 10:33:50,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:33:50,901 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:33:51,006 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:51,011 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:33:51,027 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:51,038 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:33:51,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:51 WrapperNode [2018-11-28 10:33:51,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:51,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:51,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:33:51,040 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:33:51,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:51" (1/1) ... [2018-11-28 10:33:51,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:51" (1/1) ... [2018-11-28 10:33:51,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:51,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:33:51,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:33:51,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:33:51,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:51" (1/1) ... [2018-11-28 10:33:51,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:51" (1/1) ... [2018-11-28 10:33:51,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:51" (1/1) ... [2018-11-28 10:33:51,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:51" (1/1) ... [2018-11-28 10:33:51,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:51" (1/1) ... [2018-11-28 10:33:51,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:51" (1/1) ... [2018-11-28 10:33:51,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:51" (1/1) ... [2018-11-28 10:33:51,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:33:51,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:33:51,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:33:51,076 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:33:51,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/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 [2018-11-28 10:33:51,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 10:33:51,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 10:33:51,158 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-28 10:33:51,158 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-28 10:33:51,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:33:51,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:33:51,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 10:33:51,159 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 10:33:51,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 10:33:51,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 10:33:58,733 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:33:58,733 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 10:33:58,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:58 BoogieIcfgContainer [2018-11-28 10:33:58,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:33:58,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 10:33:58,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 10:33:58,737 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 10:33:58,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:33:50" (1/3) ... [2018-11-28 10:33:58,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2155b8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:33:58, skipping insertion in model container [2018-11-28 10:33:58,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:51" (2/3) ... [2018-11-28 10:33:58,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2155b8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:33:58, skipping insertion in model container [2018-11-28 10:33:58,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:58" (3/3) ... [2018-11-28 10:33:58,740 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-11-28 10:33:58,750 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 10:33:58,755 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 10:33:58,765 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 10:33:58,783 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:33:58,784 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 10:33:58,784 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 10:33:58,784 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 10:33:58,784 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:33:58,784 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:33:58,784 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 10:33:58,784 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:33:58,784 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 10:33:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-28 10:33:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 10:33:58,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:58,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:58,798 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:33:58,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash -995072322, now seen corresponding path program 1 times [2018-11-28 10:33:58,804 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 10:33:58,804 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/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 [2018-11-28 10:33:58,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:59,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:34:05,342 WARN L180 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-11-28 10:34:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:34:05,347 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:34:05,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:05,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:34:05,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:34:05,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:34:05,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:34:05,381 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2018-11-28 10:34:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:34:11,246 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-11-28 10:34:11,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:34:11,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 10:34:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:34:11,252 INFO L225 Difference]: With dead ends: 54 [2018-11-28 10:34:11,253 INFO L226 Difference]: Without dead ends: 26 [2018-11-28 10:34:11,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:34:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-28 10:34:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-28 10:34:11,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 10:34:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 10:34:11,278 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2018-11-28 10:34:11,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:34:11,279 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 10:34:11,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:34:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-28 10:34:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 10:34:11,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:34:11,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:34:11,280 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:34:11,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:34:11,280 INFO L82 PathProgramCache]: Analyzing trace with hash -294007744, now seen corresponding path program 1 times [2018-11-28 10:34:11,281 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 10:34:11,281 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/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 [2018-11-28 10:34:11,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:34:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:34:13,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:34:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:34:13,057 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:34:13,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:13,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:34:13,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:34:13,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:34:13,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:34:13,087 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-28 10:34:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:34:16,766 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-28 10:34:16,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:34:16,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 10:34:16,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:34:16,769 INFO L225 Difference]: With dead ends: 55 [2018-11-28 10:34:16,769 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 10:34:16,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:34:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 10:34:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-28 10:34:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 10:34:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-28 10:34:16,779 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-11-28 10:34:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:34:16,779 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-28 10:34:16,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:34:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-28 10:34:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 10:34:16,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:34:16,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:34:16,782 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:34:16,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:34:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash -224200478, now seen corresponding path program 1 times [2018-11-28 10:34:16,783 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 10:34:16,783 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a8060d0-ffb2-495d-a715-1a6cfec12cb7/bin-2019/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 [2018-11-28 10:34:16,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:34:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:34:20,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:34:22,198 WARN L832 $PredicateComparison]: unable to prove that (= (fp.div roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xnp1~0) is different from false [2018-11-28 10:34:24,308 WARN L854 $PredicateComparison]: unable to prove that (= (fp.div roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xnp1~0) is different from true [2018-11-28 10:34:26,696 WARN L832 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) |c_SqrtR_#res|) is different from false [2018-11-28 10:34:29,074 WARN L854 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) |c_SqrtR_#res|) is different from true [2018-11-28 10:34:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-28 10:34:29,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 10:34:51,282 WARN L180 SmtUtils]: Spent 21.99 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 10:35:07,802 WARN L180 SmtUtils]: Spent 16.52 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 10:35:32,898 WARN L180 SmtUtils]: Spent 25.09 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 10:35:57,939 WARN L180 SmtUtils]: Spent 25.04 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 10:36:00,359 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2018-11-28 10:36:02,793 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2018-11-28 10:36:05,231 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (or (not (fp.leq .cse0 .cse1)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2)) (not (fp.geq .cse0 .cse2))))) is different from false [2018-11-28 10:36:07,661 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (or (not (fp.leq .cse0 .cse1)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2)) (not (fp.geq .cse0 .cse2))))) is different from true [2018-11-28 10:36:10,381 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse3 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse3 .cse1)) (not (fp.geq .cse3 .cse2))))) is different from false [2018-11-28 10:36:13,106 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse3 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse3 .cse1)) (not (fp.geq .cse3 .cse2))))) is different from true [2018-11-28 10:36:15,997 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse7 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse6)))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse7 .cse1)) (not (fp.geq .cse7 .cse2))))) is different from false [2018-11-28 10:36:18,883 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse7 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse6)))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse7 .cse1)) (not (fp.geq .cse7 .cse2))))) is different from true [2018-11-28 10:36:21,682 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |c_SqrtR_#in~Input|) .cse3) .cse3))))) .cse7)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_SqrtR_~Input) .cse3) .cse3))))) .cse7)))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))) (not (fp.geq .cse0 .cse3))))) is different from false [2018-11-28 10:36:24,495 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |c_SqrtR_#in~Input|) .cse3) .cse3))))) .cse7)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_SqrtR_~Input) .cse3) .cse3))))) .cse7)))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))) (not (fp.geq .cse0 .cse3))))) is different from true [2018-11-28 10:36:26,940 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (let ((.cse1 (fp.geq .cse2 .cse3)) (.cse0 (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)))) (or (not .cse0) (not .cse1) (and .cse1 .cse0))))) is different from false [2018-11-28 10:36:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-28 10:36:27,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:36:27,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-28 10:36:27,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 10:36:27,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 10:36:27,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=128, Unknown=14, NotChecked=196, Total=380 [2018-11-28 10:36:27,008 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 20 states. [2018-11-28 10:36:29,439 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (= .cse1 c_main_~d~0) (fp.geq .cse0 .cse1)))) is different from false [2018-11-28 10:36:31,866 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (= .cse1 c_main_~d~0) (fp.geq .cse0 .cse1)))) is different from true [2018-11-28 10:36:34,312 WARN L832 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |c_SqrtR_#in~Input|) .cse3) .cse3))))) .cse7)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_SqrtR_~Input) .cse3) .cse3))))) .cse7)))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))) (not (fp.geq .cse0 .cse3)))))) is different from false [2018-11-28 10:36:37,145 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse0 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |c_SqrtR_#in~Input|) .cse3) .cse3))))) .cse7)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.div roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_SqrtR_~Input) .cse3) .cse3))))) .cse7)))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))) (not (fp.geq .cse0 .cse3)))))) is different from true [2018-11-28 10:36:39,585 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse7 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse6)))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse7 .cse1)) (not (fp.geq .cse7 .cse2))))) (= .cse2 c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input))) is different from false [2018-11-28 10:36:42,505 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse7 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse6)))) (or (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) (not (fp.leq .cse7 .cse1)) (not (fp.geq .cse7 .cse2))))) (= .cse2 c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input))) is different from true [2018-11-28 10:36:44,940 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse4 (fp.div roundNearestTiesToEven .cse3 .cse0))) (or (let ((.cse1 (fp.div roundNearestTiesToEven .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3))) (not (fp.leq .cse4 .cse2)) (not (fp.geq .cse4 .cse3))))))) is different from false [2018-11-28 10:36:45,935 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-28 10:36:45,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:36:45,936 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:845) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 43 more [2018-11-28 10:36:45,939 INFO L168 Benchmark]: Toolchain (without parser) took 175058.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 941.9 MB in the beginning and 1.0 GB in the end (delta: -70.4 MB). Peak memory consumption was 85.8 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:45,940 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:36:45,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.36 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 931.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:45,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.77 ms. Allocated memory is still 1.0 GB. Free memory was 931.2 MB in the beginning and 925.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:45,941 INFO L168 Benchmark]: Boogie Preprocessor took 21.46 ms. Allocated memory is still 1.0 GB. Free memory is still 925.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:36:45,941 INFO L168 Benchmark]: RCFGBuilder took 7657.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -201.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:45,942 INFO L168 Benchmark]: TraceAbstraction took 167204.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 115.3 MB). Peak memory consumption was 115.3 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:45,944 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.36 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 931.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.77 ms. Allocated memory is still 1.0 GB. Free memory was 931.2 MB in the beginning and 925.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.46 ms. Allocated memory is still 1.0 GB. Free memory is still 925.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 7657.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -201.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 167204.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 115.3 MB). Peak memory consumption was 115.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...