./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/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_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/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_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/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_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/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-635dfa2 [2018-12-09 05:38:27,384 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:38:27,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:38:27,391 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:38:27,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:38:27,392 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:38:27,392 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:38:27,393 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:38:27,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:38:27,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:38:27,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:38:27,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:38:27,395 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:38:27,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:38:27,396 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:38:27,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:38:27,397 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:38:27,398 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:38:27,399 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:38:27,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:38:27,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:38:27,400 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:38:27,401 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:38:27,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:38:27,402 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:38:27,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:38:27,403 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:38:27,403 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:38:27,403 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:38:27,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:38:27,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:38:27,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:38:27,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:38:27,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:38:27,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:38:27,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:38:27,405 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 05:38:27,412 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:38:27,412 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:38:27,413 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:38:27,413 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:38:27,413 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 05:38:27,413 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 05:38:27,414 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 05:38:27,414 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:38:27,414 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:38:27,414 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:38:27,414 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:38:27,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:38:27,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:38:27,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:38:27,414 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:38:27,414 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:38:27,414 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:38:27,415 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:38:27,415 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:38:27,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:38:27,415 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:38:27,415 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:38:27,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:38:27,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:38:27,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:38:27,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:38:27,415 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:38:27,415 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 05:38:27,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:38:27,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:38:27,416 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_d73839df-a03e-4340-8b72-82f90cda25ed/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-12-09 05:38:27,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:38:27,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:38:27,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:38:27,442 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:38:27,442 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:38:27,442 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-12-09 05:38:27,475 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/data/d61a7c1c9/279d5d9b4b7a48e9b3ff2125d98f2632/FLAG7b1d15878 [2018-12-09 05:38:27,883 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:38:27,883 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-12-09 05:38:27,887 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/data/d61a7c1c9/279d5d9b4b7a48e9b3ff2125d98f2632/FLAG7b1d15878 [2018-12-09 05:38:27,896 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/data/d61a7c1c9/279d5d9b4b7a48e9b3ff2125d98f2632 [2018-12-09 05:38:27,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:38:27,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:38:27,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:38:27,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:38:27,901 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:38:27,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:38:27" (1/1) ... [2018-12-09 05:38:27,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706fcb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:27, skipping insertion in model container [2018-12-09 05:38:27,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:38:27" (1/1) ... [2018-12-09 05:38:27,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:38:27,917 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:38:28,005 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:38:28,008 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:38:28,019 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:38:28,027 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:38:28,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:28 WrapperNode [2018-12-09 05:38:28,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:38:28,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:38:28,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:38:28,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:38:28,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:28" (1/1) ... [2018-12-09 05:38:28,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:28" (1/1) ... [2018-12-09 05:38:28,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:38:28,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:38:28,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:38:28,041 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:38:28,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:28" (1/1) ... [2018-12-09 05:38:28,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:28" (1/1) ... [2018-12-09 05:38:28,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:28" (1/1) ... [2018-12-09 05:38:28,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:28" (1/1) ... [2018-12-09 05:38:28,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:28" (1/1) ... [2018-12-09 05:38:28,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:28" (1/1) ... [2018-12-09 05:38:28,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:28" (1/1) ... [2018-12-09 05:38:28,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:38:28,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:38:28,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:38:28,088 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:38:28,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/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-12-09 05:38:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 05:38:28,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 05:38:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-12-09 05:38:28,120 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-12-09 05:38:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:38:28,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:38:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 05:38:28,121 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 05:38:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 05:38:28,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 05:38:28,223 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:38:28,224 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 05:38:28,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:38:28 BoogieIcfgContainer [2018-12-09 05:38:28,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:38:28,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:38:28,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:38:28,227 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:38:28,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:38:27" (1/3) ... [2018-12-09 05:38:28,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a60ec98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:38:28, skipping insertion in model container [2018-12-09 05:38:28,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:28" (2/3) ... [2018-12-09 05:38:28,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a60ec98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:38:28, skipping insertion in model container [2018-12-09 05:38:28,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:38:28" (3/3) ... [2018-12-09 05:38:28,230 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-12-09 05:38:28,238 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:38:28,243 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 05:38:28,252 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 05:38:28,268 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 05:38:28,268 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:38:28,268 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:38:28,268 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:38:28,268 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:38:28,268 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:38:28,268 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:38:28,268 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:38:28,268 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:38:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-09 05:38:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 05:38:28,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:28,282 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-12-09 05:38:28,283 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:28,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:28,287 INFO L82 PathProgramCache]: Analyzing trace with hash -995072322, now seen corresponding path program 1 times [2018-12-09 05:38:28,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:38:28,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:38:28,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:28,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:28,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:38:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:38:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:38:28,363 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 05:38:28,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:38:28 BoogieIcfgContainer [2018-12-09 05:38:28,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:38:28,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:38:28,380 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:38:28,380 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:38:28,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:38:28" (3/4) ... [2018-12-09 05:38:28,382 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 05:38:28,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:38:28,383 INFO L168 Benchmark]: Toolchain (without parser) took 485.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -126.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:38:28,384 INFO L168 Benchmark]: CDTParser took 0.10 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-12-09 05:38:28,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.01 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.5 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-12-09 05:38:28,385 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.82 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:38:28,385 INFO L168 Benchmark]: Boogie Preprocessor took 46.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:38:28,385 INFO L168 Benchmark]: RCFGBuilder took 136.20 ms. Allocated memory is still 1.1 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-12-09 05:38:28,386 INFO L168 Benchmark]: TraceAbstraction took 154.69 ms. Allocated memory is still 1.1 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-12-09 05:38:28,386 INFO L168 Benchmark]: Witness Printer took 2.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:38:28,388 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.10 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 129.01 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.5 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.82 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 136.20 ms. Allocated memory is still 1.1 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 154.69 ms. Allocated memory is still 1.1 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.76 ms. Allocated memory is still 1.1 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-635dfa2 [2018-12-09 05:38:29,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:38:29,613 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:38:29,619 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:38:29,620 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:38:29,620 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:38:29,621 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:38:29,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:38:29,622 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:38:29,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:38:29,623 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:38:29,623 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:38:29,623 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:38:29,624 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:38:29,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:38:29,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:38:29,625 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:38:29,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:38:29,627 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:38:29,627 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:38:29,628 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:38:29,629 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:38:29,630 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:38:29,630 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:38:29,630 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:38:29,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:38:29,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:38:29,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:38:29,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:38:29,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:38:29,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:38:29,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:38:29,633 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:38:29,633 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:38:29,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:38:29,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:38:29,634 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-09 05:38:29,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:38:29,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:38:29,641 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:38:29,642 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:38:29,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 05:38:29,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 05:38:29,642 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 05:38:29,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:38:29,642 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:38:29,642 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:38:29,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:38:29,642 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:38:29,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:38:29,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:38:29,643 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 05:38:29,643 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 05:38:29,643 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:38:29,643 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:38:29,643 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:38:29,643 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:38:29,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:38:29,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:38:29,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:38:29,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:38:29,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:38:29,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:38:29,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:38:29,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:38:29,644 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-09 05:38:29,644 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:38:29,644 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 05:38:29,644 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 05:38:29,644 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_d73839df-a03e-4340-8b72-82f90cda25ed/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-12-09 05:38:29,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:38:29,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:38:29,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:38:29,673 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:38:29,673 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:38:29,673 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-12-09 05:38:29,711 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/data/c74087754/c62dfcea56c5454187f3b1fe6c4f99af/FLAG31fc697c3 [2018-12-09 05:38:30,035 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:38:30,035 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-12-09 05:38:30,039 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/data/c74087754/c62dfcea56c5454187f3b1fe6c4f99af/FLAG31fc697c3 [2018-12-09 05:38:30,046 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/data/c74087754/c62dfcea56c5454187f3b1fe6c4f99af [2018-12-09 05:38:30,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:38:30,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:38:30,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:38:30,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:38:30,051 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:38:30,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:38:30" (1/1) ... [2018-12-09 05:38:30,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267733d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30, skipping insertion in model container [2018-12-09 05:38:30,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:38:30" (1/1) ... [2018-12-09 05:38:30,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:38:30,067 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:38:30,158 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:38:30,162 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:38:30,175 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:38:30,184 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:38:30,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30 WrapperNode [2018-12-09 05:38:30,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:38:30,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:38:30,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:38:30,185 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:38:30,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30" (1/1) ... [2018-12-09 05:38:30,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30" (1/1) ... [2018-12-09 05:38:30,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:38:30,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:38:30,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:38:30,200 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:38:30,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30" (1/1) ... [2018-12-09 05:38:30,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30" (1/1) ... [2018-12-09 05:38:30,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30" (1/1) ... [2018-12-09 05:38:30,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30" (1/1) ... [2018-12-09 05:38:30,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30" (1/1) ... [2018-12-09 05:38:30,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30" (1/1) ... [2018-12-09 05:38:30,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30" (1/1) ... [2018-12-09 05:38:30,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:38:30,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:38:30,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:38:30,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:38:30,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/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-12-09 05:38:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 05:38:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 05:38:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-12-09 05:38:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-12-09 05:38:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:38:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:38:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 05:38:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 05:38:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 05:38:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 05:38:39,020 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:38:39,020 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 05:38:39,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:38:39 BoogieIcfgContainer [2018-12-09 05:38:39,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:38:39,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:38:39,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:38:39,023 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:38:39,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:38:30" (1/3) ... [2018-12-09 05:38:39,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3168c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:38:39, skipping insertion in model container [2018-12-09 05:38:39,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:30" (2/3) ... [2018-12-09 05:38:39,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3168c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:38:39, skipping insertion in model container [2018-12-09 05:38:39,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:38:39" (3/3) ... [2018-12-09 05:38:39,025 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-12-09 05:38:39,031 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:38:39,035 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 05:38:39,044 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 05:38:39,061 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 05:38:39,061 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:38:39,061 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:38:39,061 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:38:39,061 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:38:39,061 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:38:39,062 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:38:39,062 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:38:39,062 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:38:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-09 05:38:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 05:38:39,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:39,075 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-12-09 05:38:39,076 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:39,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash -995072322, now seen corresponding path program 1 times [2018-12-09 05:38:39,082 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 05:38:39,082 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/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-12-09 05:38:39,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:40,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:38:47,367 WARN L180 SmtUtils]: Spent 5.23 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-12-09 05:38:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:47,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:38:47,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:47,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:38:47,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:38:47,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:38:47,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:38:47,404 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2018-12-09 05:38:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:38:57,058 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2018-12-09 05:38:57,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:38:57,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 05:38:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:38:57,066 INFO L225 Difference]: With dead ends: 58 [2018-12-09 05:38:57,066 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 05:38:57,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:38:57,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 05:38:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-12-09 05:38:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-09 05:38:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-09 05:38:57,090 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2018-12-09 05:38:57,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:38:57,090 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-09 05:38:57,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:38:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-09 05:38:57,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 05:38:57,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:38:57,091 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-12-09 05:38:57,091 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:38:57,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:38:57,092 INFO L82 PathProgramCache]: Analyzing trace with hash -294007744, now seen corresponding path program 1 times [2018-12-09 05:38:57,092 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 05:38:57,092 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/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-12-09 05:38:57,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:38:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:38:58,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:38:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:38:58,882 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:38:58,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:38:58,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:38:58,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:38:58,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:38:58,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:38:58,912 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-12-09 05:39:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:39:03,063 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-12-09 05:39:03,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:39:03,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 05:39:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:39:03,065 INFO L225 Difference]: With dead ends: 55 [2018-12-09 05:39:03,065 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 05:39:03,066 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-12-09 05:39:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 05:39:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-12-09 05:39:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 05:39:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-09 05:39:03,074 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-12-09 05:39:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:39:03,074 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-09 05:39:03,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:39:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-09 05:39:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:39:03,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:39:03,075 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-12-09 05:39:03,075 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:39:03,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:39:03,076 INFO L82 PathProgramCache]: Analyzing trace with hash -224200478, now seen corresponding path program 1 times [2018-12-09 05:39:03,076 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 05:39:03,076 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/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-12-09 05:39:03,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:39:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:39:06,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:39:08,505 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-12-09 05:39:10,623 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-12-09 05:39:13,019 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-12-09 05:39:15,419 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-12-09 05:39:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-09 05:39:15,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 05:39:37,802 WARN L180 SmtUtils]: Spent 22.18 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 05:39:54,539 WARN L180 SmtUtils]: Spent 16.74 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-09 05:40:19,695 WARN L180 SmtUtils]: Spent 25.15 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 05:40:44,943 WARN L180 SmtUtils]: Spent 25.25 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 05:40:47,378 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-12-09 05:40:49,821 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-12-09 05:40:52,276 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-12-09 05:40:54,717 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-12-09 05:40:57,456 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-12-09 05:41:00,203 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-12-09 05:41:03,132 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-12-09 05:41:06,069 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-12-09 05:41:08,903 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-12-09 05:41:11,750 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-12-09 05:41:14,222 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-12-09 05:41:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-09 05:41:14,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:41:14,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-12-09 05:41:14,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 05:41:14,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 05:41:14,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=128, Unknown=14, NotChecked=196, Total=380 [2018-12-09 05:41:14,295 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 20 states. [2018-12-09 05:41:16,747 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-12-09 05:41:19,205 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-12-09 05:41:21,724 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-12-09 05:41:24,608 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-12-09 05:41:27,065 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-12-09 05:41:30,034 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-12-09 05:41:32,484 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-12-09 05:41:35,243 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse4 (fp.div roundNearestTiesToEven .cse3 .cse0))) (or (let ((.cse1 (fp.div roundNearestTiesToEven .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3))) (not (fp.leq .cse4 .cse2)) (not (fp.geq .cse4 .cse3))))))) is different from true [2018-12-09 05:41:40,542 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (= .cse0 |c_SqrtR_#res|) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (or (not (fp.leq .cse0 .cse1)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2)) (not (fp.geq .cse0 .cse2))))))) is different from false [2018-12-09 05:41:42,993 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (= .cse0 |c_SqrtR_#res|) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (or (not (fp.leq .cse0 .cse1)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2)) (not (fp.geq .cse0 .cse2))))))) is different from true [2018-12-09 05:41:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:43,230 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-12-09 05:41:43,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 05:41:43,231 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-12-09 05:41:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:43,232 INFO L225 Difference]: With dead ends: 48 [2018-12-09 05:41:43,232 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 05:41:43,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 64.6s TimeCoverageRelationStatistics Valid=58, Invalid=148, Unknown=24, NotChecked=420, Total=650 [2018-12-09 05:41:43,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 05:41:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-12-09 05:41:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 05:41:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-09 05:41:43,239 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 21 [2018-12-09 05:41:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:43,239 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-09 05:41:43,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 05:41:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-09 05:41:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:43,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:43,240 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-12-09 05:41:43,240 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:43,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:43,240 INFO L82 PathProgramCache]: Analyzing trace with hash 33964960, now seen corresponding path program 1 times [2018-12-09 05:41:43,241 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 05:41:43,241 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-09 05:41:43,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:47,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:41:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 05:41:47,270 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:41:47,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:47,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:41:47,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:41:47,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:41:47,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:41:47,323 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-12-09 05:41:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:52,236 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-12-09 05:41:52,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:41:52,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-09 05:41:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:52,238 INFO L225 Difference]: With dead ends: 77 [2018-12-09 05:41:52,238 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 05:41:52,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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-12-09 05:41:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 05:41:52,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-12-09 05:41:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 05:41:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-09 05:41:52,246 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 21 [2018-12-09 05:41:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:52,246 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-09 05:41:52,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:41:52,246 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-09 05:41:52,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 05:41:52,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:52,247 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:52,247 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:52,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:52,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2096977090, now seen corresponding path program 2 times [2018-12-09 05:41:52,247 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 05:41:52,247 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d73839df-a03e-4340-8b72-82f90cda25ed/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-09 05:41:52,251 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 05:41:57,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 05:41:57,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 05:41:57,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:41:59,921 WARN L832 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from false [2018-12-09 05:42:02,258 WARN L854 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_SqrtR_~Input .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from true [2018-12-09 05:42:04,660 WARN L832 $PredicateComparison]: unable to prove that (= c_SqrtR_~xnp1~0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))))) .cse5))) is different from false [2018-12-09 05:42:07,074 WARN L854 $PredicateComparison]: unable to prove that (= c_SqrtR_~xnp1~0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))))) .cse5))) is different from true [2018-12-09 05:42:07,915 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-09 05:42:08,116 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2018-12-09 05:42:08,117 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:823) 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.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java: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) ... 39 more [2018-12-09 05:42:08,123 INFO L168 Benchmark]: Toolchain (without parser) took 218074.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.4 MB in the beginning and 952.2 MB in the end (delta: -8.9 MB). Peak memory consumption was 129.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:42:08,125 INFO L168 Benchmark]: CDTParser took 0.11 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-12-09 05:42:08,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.85 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:42:08,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.22 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 05:42:08,126 INFO L168 Benchmark]: Boogie Preprocessor took 16.55 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:42:08,126 INFO L168 Benchmark]: RCFGBuilder took 8804.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-09 05:42:08,127 INFO L168 Benchmark]: TraceAbstraction took 209101.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 952.2 MB in the end (delta: 154.4 MB). Peak memory consumption was 154.4 MB. Max. memory is 11.5 GB. [2018-12-09 05:42:08,129 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.11 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 135.85 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.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 14.22 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.55 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 8804.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 209101.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 952.2 MB in the end (delta: 154.4 MB). Peak memory consumption was 154.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)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...