./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/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 2efbbd8e1ed6cd606263edae3254601484469bf9 .............................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/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 2efbbd8e1ed6cd606263edae3254601484469bf9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 10:55:33,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:55:33,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:55:33,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:55:33,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:55:33,901 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:55:33,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:55:33,903 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:55:33,904 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:55:33,904 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:55:33,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:55:33,905 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:55:33,905 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:55:33,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:55:33,906 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:55:33,907 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:55:33,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:55:33,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:55:33,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:55:33,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:55:33,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:55:33,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:55:33,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:55:33,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:55:33,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:55:33,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:55:33,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:55:33,913 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:55:33,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:55:33,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:55:33,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:55:33,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:55:33,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:55:33,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:55:33,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:55:33,916 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:55:33,916 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 10:55:33,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:55:33,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:55:33,924 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 10:55:33,924 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 10:55:33,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:55:33,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:55:33,924 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:55:33,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:55:33,925 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:55:33,925 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:55:33,925 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:55:33,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:55:33,925 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 10:55:33,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 10:55:33,925 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 10:55:33,925 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:55:33,926 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:55:33,926 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:55:33,926 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 10:55:33,926 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:55:33,926 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:55:33,926 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 10:55:33,926 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 10:55:33,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:55:33,926 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:55:33,927 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 10:55:33,927 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 10:55:33,927 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:55:33,927 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 10:55:33,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 10:55:33,927 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_132019ff-3470-4320-911a-4c2c5d548855/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 -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-12-09 10:55:33,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:55:33,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:55:33,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:55:33,954 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:55:33,954 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:55:33,955 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-09 10:55:33,989 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/data/f97aad23b/8515dc75521840ff93168de15b85411c/FLAG93fa9a04d [2018-12-09 10:55:34,425 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:55:34,426 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-09 10:55:34,429 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/data/f97aad23b/8515dc75521840ff93168de15b85411c/FLAG93fa9a04d [2018-12-09 10:55:34,439 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/data/f97aad23b/8515dc75521840ff93168de15b85411c [2018-12-09 10:55:34,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:55:34,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:55:34,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:55:34,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:55:34,445 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:55:34,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:55:34" (1/1) ... [2018-12-09 10:55:34,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723851a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34, skipping insertion in model container [2018-12-09 10:55:34,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:55:34" (1/1) ... [2018-12-09 10:55:34,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:55:34,471 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:55:34,575 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:55:34,579 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:55:34,593 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:55:34,602 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:55:34,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34 WrapperNode [2018-12-09 10:55:34,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:55:34,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:55:34,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:55:34,603 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:55:34,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34" (1/1) ... [2018-12-09 10:55:34,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34" (1/1) ... [2018-12-09 10:55:34,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:55:34,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:55:34,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:55:34,617 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:55:34,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34" (1/1) ... [2018-12-09 10:55:34,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34" (1/1) ... [2018-12-09 10:55:34,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34" (1/1) ... [2018-12-09 10:55:34,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34" (1/1) ... [2018-12-09 10:55:34,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34" (1/1) ... [2018-12-09 10:55:34,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34" (1/1) ... [2018-12-09 10:55:34,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34" (1/1) ... [2018-12-09 10:55:34,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:55:34,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:55:34,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:55:34,664 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:55:34,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/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 10:55:34,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 10:55:34,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 10:55:34,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:55:34,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:55:34,703 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 10:55:34,703 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 10:55:34,812 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:55:34,812 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 10:55:34,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:55:34 BoogieIcfgContainer [2018-12-09 10:55:34,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:55:34,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 10:55:34,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 10:55:34,815 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 10:55:34,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:55:34" (1/3) ... [2018-12-09 10:55:34,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d156bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:55:34, skipping insertion in model container [2018-12-09 10:55:34,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:34" (2/3) ... [2018-12-09 10:55:34,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d156bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:55:34, skipping insertion in model container [2018-12-09 10:55:34,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:55:34" (3/3) ... [2018-12-09 10:55:34,817 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-09 10:55:34,822 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 10:55:34,827 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 10:55:34,835 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 10:55:34,851 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:55:34,852 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 10:55:34,852 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 10:55:34,852 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 10:55:34,852 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:55:34,852 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:55:34,852 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 10:55:34,852 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:55:34,853 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 10:55:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-09 10:55:34,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 10:55:34,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:55:34,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:55:34,868 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:55:34,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:55:34,871 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-12-09 10:55:34,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:55:34,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:55:34,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:55:34,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:55:34,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:55:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:55:34,960 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 10:55:34,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:55:34,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:55:34,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:55:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:55:34,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:55:34,974 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-12-09 10:55:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:55:35,016 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-12-09 10:55:35,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:55:35,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 10:55:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:55:35,023 INFO L225 Difference]: With dead ends: 75 [2018-12-09 10:55:35,023 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 10:55:35,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:55:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 10:55:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 27. [2018-12-09 10:55:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 10:55:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-09 10:55:35,046 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-12-09 10:55:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:55:35,047 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-09 10:55:35,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:55:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-09 10:55:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 10:55:35,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:55:35,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:55:35,048 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:55:35,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:55:35,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1763341697, now seen corresponding path program 1 times [2018-12-09 10:55:35,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:55:35,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:55:35,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:55:35,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:55:35,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:55:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:55:35,075 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 10:55:35,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:55:35,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:55:35,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:55:35,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:55:35,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:55:35,076 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-12-09 10:55:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:55:35,105 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2018-12-09 10:55:35,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:55:35,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 10:55:35,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:55:35,107 INFO L225 Difference]: With dead ends: 50 [2018-12-09 10:55:35,107 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 10:55:35,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:55:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 10:55:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2018-12-09 10:55:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 10:55:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-12-09 10:55:35,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-12-09 10:55:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:55:35,111 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-12-09 10:55:35,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:55:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-12-09 10:55:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 10:55:35,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:55:35,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:55:35,112 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:55:35,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:55:35,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1747284348, now seen corresponding path program 1 times [2018-12-09 10:55:35,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:55:35,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:55:35,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:55:35,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:55:35,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:55:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:55:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:55:35,134 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 10:55:35,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:55:35 BoogieIcfgContainer [2018-12-09 10:55:35,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 10:55:35,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:55:35,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:55:35,151 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:55:35,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:55:34" (3/4) ... [2018-12-09 10:55:35,154 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 10:55:35,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:55:35,154 INFO L168 Benchmark]: Toolchain (without parser) took 713.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 957.1 MB in the beginning and 1.0 GB in the end (delta: -90.5 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-12-09 10:55:35,155 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:55:35,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.25 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:55:35,156 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.12 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 10:55:35,156 INFO L168 Benchmark]: Boogie Preprocessor took 47.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-09 10:55:35,157 INFO L168 Benchmark]: RCFGBuilder took 148.40 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: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2018-12-09 10:55:35,157 INFO L168 Benchmark]: TraceAbstraction took 338.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2018-12-09 10:55:35,157 INFO L168 Benchmark]: Witness Printer took 2.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:55:35,159 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.25 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 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.12 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 148.40 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: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 338.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 96]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L1] int __return_main; [L6] double _EPS = 0.0000010; [L9] double __return_125; VAL [\old(__return_125)=2, \old(__return_main)=4, \old(_EPS)=3, __return_125=0, __return_main=0, _EPS=1/1000000] [L12] double main__d; [L13] double main__r; [L14] main__d = 1.0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, _EPS=1/1000000, main__d=1] [L16] COND TRUE main__d <= 20.0 [L19] double __tmp_1; [L20] __tmp_1 = main__d [L21] double SqrtR__Input; [L22] SqrtR__Input = __tmp_1 [L23] double SqrtR__xn; [L24] double SqrtR__xnp1; [L25] double SqrtR__residu; [L26] double SqrtR__lsup; [L27] double SqrtR__linf; [L28] int SqrtR__i; [L29] int SqrtR__cond; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L30] COND FALSE !(SqrtR__Input <= 1.0) [L134] SqrtR__xn = 1.0 / SqrtR__Input VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L34] SqrtR__xnp1 = SqrtR__xn [L35] SqrtR__residu = (2.0 * _EPS) * (SqrtR__xn + SqrtR__xnp1) [L36] SqrtR__lsup = _EPS * (SqrtR__xn + SqrtR__xnp1) [L37] SqrtR__linf = -SqrtR__lsup [L38] int SqrtR____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L39] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L121] COND FALSE !(SqrtR__residu < SqrtR__linf) [L127] SqrtR____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L44] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L45] SqrtR__i = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L47] COND FALSE !(!(SqrtR__cond == 0)) [L80] __return_125 = 1.0 / SqrtR__xnp1 [L81] main__r = __return_125 [L82] int main____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L83] COND FALSE !(main__r >= 1.0) VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L109] main____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_0 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L96] __VERIFIER_error() VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 106 SDtfs, 79 SDslu, 148 SDs, 0 SdLazy, 27 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 10:55:36,526 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:55:36,527 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:55:36,533 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:55:36,533 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:55:36,533 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:55:36,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:55:36,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:55:36,535 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:55:36,536 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:55:36,536 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:55:36,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:55:36,537 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:55:36,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:55:36,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:55:36,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:55:36,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:55:36,539 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:55:36,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:55:36,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:55:36,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:55:36,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:55:36,543 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:55:36,543 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:55:36,543 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:55:36,544 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:55:36,544 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:55:36,545 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:55:36,545 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:55:36,545 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:55:36,546 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:55:36,546 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:55:36,546 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:55:36,546 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:55:36,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:55:36,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:55:36,547 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-09 10:55:36,554 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:55:36,554 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:55:36,555 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 10:55:36,555 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 10:55:36,555 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:55:36,555 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:55:36,555 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:55:36,555 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:55:36,555 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:55:36,556 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:55:36,556 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:55:36,556 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 10:55:36,556 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 10:55:36,556 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 10:55:36,556 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 10:55:36,556 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 10:55:36,556 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:55:36,556 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:55:36,556 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:55:36,556 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 10:55:36,556 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:55:36,557 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:55:36,557 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 10:55:36,557 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 10:55:36,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:55:36,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:55:36,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 10:55:36,557 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 10:55:36,557 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-09 10:55:36,557 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 10:55:36,557 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 10:55:36,557 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 10:55:36,557 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_132019ff-3470-4320-911a-4c2c5d548855/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 -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-12-09 10:55:36,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:55:36,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:55:36,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:55:36,584 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:55:36,585 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:55:36,585 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-09 10:55:36,619 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/data/744bacf98/e3f3754ab08f4c4891571eff806fd758/FLAG2e2665a0b [2018-12-09 10:55:36,968 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:55:36,968 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-09 10:55:36,972 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/data/744bacf98/e3f3754ab08f4c4891571eff806fd758/FLAG2e2665a0b [2018-12-09 10:55:37,356 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/data/744bacf98/e3f3754ab08f4c4891571eff806fd758 [2018-12-09 10:55:37,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:55:37,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:55:37,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:55:37,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:55:37,362 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:55:37,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:55:37" (1/1) ... [2018-12-09 10:55:37,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44dcf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37, skipping insertion in model container [2018-12-09 10:55:37,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:55:37" (1/1) ... [2018-12-09 10:55:37,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:55:37,384 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:55:37,494 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:55:37,500 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:55:37,521 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:55:37,533 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:55:37,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37 WrapperNode [2018-12-09 10:55:37,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:55:37,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:55:37,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:55:37,534 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:55:37,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37" (1/1) ... [2018-12-09 10:55:37,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37" (1/1) ... [2018-12-09 10:55:37,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:55:37,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:55:37,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:55:37,548 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:55:37,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37" (1/1) ... [2018-12-09 10:55:37,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37" (1/1) ... [2018-12-09 10:55:37,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37" (1/1) ... [2018-12-09 10:55:37,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37" (1/1) ... [2018-12-09 10:55:37,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37" (1/1) ... [2018-12-09 10:55:37,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37" (1/1) ... [2018-12-09 10:55:37,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37" (1/1) ... [2018-12-09 10:55:37,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:55:37,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:55:37,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:55:37,564 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:55:37,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/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 10:55:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 10:55:37,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 10:55:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:55:37,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:55:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 10:55:37,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 10:55:45,966 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:55:45,966 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 10:55:45,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:55:45 BoogieIcfgContainer [2018-12-09 10:55:45,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:55:45,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 10:55:45,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 10:55:45,969 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 10:55:45,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:55:37" (1/3) ... [2018-12-09 10:55:45,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40505f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:55:45, skipping insertion in model container [2018-12-09 10:55:45,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:55:37" (2/3) ... [2018-12-09 10:55:45,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40505f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:55:45, skipping insertion in model container [2018-12-09 10:55:45,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:55:45" (3/3) ... [2018-12-09 10:55:45,971 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-12-09 10:55:45,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 10:55:45,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 10:55:45,989 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 10:55:46,005 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:55:46,006 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 10:55:46,006 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 10:55:46,006 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 10:55:46,006 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:55:46,006 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:55:46,006 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 10:55:46,006 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:55:46,006 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 10:55:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-09 10:55:46,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 10:55:46,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:55:46,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:55:46,021 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:55:46,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:55:46,024 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-12-09 10:55:46,026 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 10:55:46,026 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/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 10:55:46,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:55:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:55:47,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:55:47,864 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 10:55:47,865 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 10:55:47,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:55:47,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:55:47,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:55:47,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:55:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:55:47,907 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-12-09 10:55:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:55:51,763 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-12-09 10:55:51,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:55:51,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 10:55:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:55:51,771 INFO L225 Difference]: With dead ends: 70 [2018-12-09 10:55:51,771 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 10:55:51,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:55:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 10:55:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2018-12-09 10:55:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 10:55:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-09 10:55:51,797 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-12-09 10:55:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:55:51,798 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-09 10:55:51,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:55:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-09 10:55:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 10:55:51,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:55:51,798 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:55:51,799 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:55:51,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:55:51,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1420788200, now seen corresponding path program 1 times [2018-12-09 10:55:51,799 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 10:55:51,799 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/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 10:55:51,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:55:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:55:52,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:55:52,966 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 10:55:52,967 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 10:55:52,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:55:52,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:55:52,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:55:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:55:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:55:52,993 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-12-09 10:55:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:55:58,992 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2018-12-09 10:55:58,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:55:58,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 10:55:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:55:58,993 INFO L225 Difference]: With dead ends: 48 [2018-12-09 10:55:58,993 INFO L226 Difference]: Without dead ends: 29 [2018-12-09 10:55:58,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:55:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-09 10:55:58,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-09 10:55:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 10:55:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-12-09 10:55:58,998 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-12-09 10:55:58,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:55:58,998 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-12-09 10:55:58,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:55:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-12-09 10:55:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 10:55:58,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:55:58,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:55:58,999 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:55:58,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:55:58,999 INFO L82 PathProgramCache]: Analyzing trace with hash -619377979, now seen corresponding path program 1 times [2018-12-09 10:55:58,999 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 10:55:58,999 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/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 10:55:59,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:00,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:56:00,186 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 10:56:00,186 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 10:56:00,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:00,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:56:00,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:56:00,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:56:00,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:56:00,209 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2018-12-09 10:56:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:17,632 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-12-09 10:56:17,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:56:17,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 10:56:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:17,634 INFO L225 Difference]: With dead ends: 55 [2018-12-09 10:56:17,634 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 10:56:17,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:56:17,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 10:56:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-12-09 10:56:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 10:56:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-12-09 10:56:17,639 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2018-12-09 10:56:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:17,639 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-12-09 10:56:17,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:56:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-12-09 10:56:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 10:56:17,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:17,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:17,640 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:17,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:17,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1492678358, now seen corresponding path program 1 times [2018-12-09 10:56:17,640 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 10:56:17,640 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/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 10:56:17,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:20,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:56:20,952 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 10:56:20,953 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 10:56:20,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:56:20,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:56:20,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:56:21,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:56:21,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:56:21,000 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2018-12-09 10:56:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:56:23,734 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2018-12-09 10:56:23,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:56:23,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-09 10:56:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:56:23,735 INFO L225 Difference]: With dead ends: 54 [2018-12-09 10:56:23,735 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 10:56:23,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:56:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 10:56:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2018-12-09 10:56:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 10:56:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-12-09 10:56:23,741 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2018-12-09 10:56:23,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:56:23,741 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-09 10:56:23,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:56:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-12-09 10:56:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 10:56:23,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:56:23,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:56:23,742 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:56:23,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:56:23,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1476621009, now seen corresponding path program 1 times [2018-12-09 10:56:23,743 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 10:56:23,743 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/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 10:56:23,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:56:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:56:27,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:56:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:56:27,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 10:56:29,434 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-12-09 10:56:33,122 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-12-09 10:56:35,649 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-12-09 10:56:38,052 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-12-09 10:56:40,477 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-12-09 10:56:42,920 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-12-09 10:56:45,362 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-12-09 10:56:45,383 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 10:56:45,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:56:45,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-09 10:56:45,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 10:56:45,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 10:56:45,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=42, Unknown=7, NotChecked=60, Total=132 [2018-12-09 10:56:45,430 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2018-12-09 10:56:47,862 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~main__d~0))) is different from true [2018-12-09 10:56:50,316 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 10:56:52,901 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 10:56:55,215 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 c_main_~SqrtR__xnp1~0) .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 .cse0 .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) .cse0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_main_~SqrtR__xnp1~0))) is different from true [2018-12-09 10:57:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:16,988 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2018-12-09 10:57:17,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:57:17,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-09 10:57:17,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:17,314 INFO L225 Difference]: With dead ends: 100 [2018-12-09 10:57:17,314 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 10:57:17,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=31, Invalid=46, Unknown=11, NotChecked=152, Total=240 [2018-12-09 10:57:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 10:57:17,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 42. [2018-12-09 10:57:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 10:57:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2018-12-09 10:57:17,324 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 22 [2018-12-09 10:57:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:17,324 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2018-12-09 10:57:17,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 10:57:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2018-12-09 10:57:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 10:57:17,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:17,325 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:17,325 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:57:17,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:17,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2022219950, now seen corresponding path program 1 times [2018-12-09 10:57:17,326 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 10:57:17,326 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-09 10:57:17,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:20,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:57:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:57:20,742 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 10:57:20,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:57:20,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:57:20,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:57:20,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:57:20,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:57:20,784 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 7 states. [2018-12-09 10:57:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:30,993 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2018-12-09 10:57:30,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:57:30,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-09 10:57:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:30,995 INFO L225 Difference]: With dead ends: 78 [2018-12-09 10:57:30,995 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 10:57:30,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:57:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 10:57:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-12-09 10:57:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 10:57:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2018-12-09 10:57:31,002 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2018-12-09 10:57:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:31,002 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2018-12-09 10:57:31,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:57:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-12-09 10:57:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 10:57:31,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:31,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:31,003 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:57:31,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:31,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1630637767, now seen corresponding path program 1 times [2018-12-09 10:57:31,003 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 10:57:31,003 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-12-09 10:57:31,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:34,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:57:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:57:34,394 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 10:57:34,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:57:34,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:57:34,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:57:34,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:57:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:57:34,438 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 7 states. [2018-12-09 10:57:54,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:54,435 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2018-12-09 10:57:54,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:57:54,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-09 10:57:54,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:54,437 INFO L225 Difference]: With dead ends: 68 [2018-12-09 10:57:54,437 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 10:57:54,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:57:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 10:57:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-09 10:57:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 10:57:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-12-09 10:57:54,445 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2018-12-09 10:57:54,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:54,445 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-12-09 10:57:54,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:57:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-12-09 10:57:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 10:57:54,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:54,446 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:54,446 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:57:54,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1956324209, now seen corresponding path program 2 times [2018-12-09 10:57:54,447 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 10:57:54,447 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-09 10:57:54,451 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 10:57:59,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:57:59,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:57:59,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:58:02,113 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 10:58:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-12-09 10:58:02,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 10:58:04,520 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-12-09 10:58:08,164 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-12-09 10:58:10,755 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-12-09 10:58:13,580 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-12-09 10:58:16,425 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-12-09 10:58:19,089 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-12-09 10:58:21,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-12-09 10:58:24,415 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-12-09 10:58:27,108 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-12-09 10:58:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-09 10:58:27,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:58:27,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-12-09 10:58:27,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 10:58:27,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 10:58:27,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=43, Unknown=10, NotChecked=102, Total=182 [2018-12-09 10:58:27,196 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 14 states. [2018-12-09 10:58:29,906 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~main__d~0))) is different from true [2018-12-09 10:58:32,616 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 10:58:35,513 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 10:58:38,022 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from false [2018-12-09 10:58:40,588 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-12-09 10:59:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:59:16,640 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2018-12-09 10:59:16,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 10:59:16,967 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-09 10:59:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:59:16,967 INFO L225 Difference]: With dead ends: 107 [2018-12-09 10:59:16,967 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 10:59:16,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=40, Invalid=57, Unknown=15, NotChecked=230, Total=342 [2018-12-09 10:59:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 10:59:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2018-12-09 10:59:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 10:59:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-12-09 10:59:16,979 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 26 [2018-12-09 10:59:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:59:16,979 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-12-09 10:59:16,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 10:59:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-12-09 10:59:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 10:59:16,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:59:16,980 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:59:16,981 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:59:16,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:59:16,981 INFO L82 PathProgramCache]: Analyzing trace with hash 127977651, now seen corresponding path program 3 times [2018-12-09 10:59:16,981 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 10:59:16,981 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-12-09 10:59:16,985 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 10:59:22,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 10:59:22,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:59:22,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:59:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 10:59:22,537 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 10:59:22,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:59:22,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:59:22,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:59:22,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:59:22,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:59:22,604 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand 4 states. [2018-12-09 10:59:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:59:34,659 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2018-12-09 10:59:34,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:59:34,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-12-09 10:59:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:59:34,964 INFO L225 Difference]: With dead ends: 93 [2018-12-09 10:59:34,965 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 10:59:34,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:59:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 10:59:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2018-12-09 10:59:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 10:59:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-09 10:59:34,975 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 30 [2018-12-09 10:59:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:59:34,975 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-09 10:59:34,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:59:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-12-09 10:59:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 10:59:34,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:59:34,976 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:59:34,976 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:59:34,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:59:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash 331588760, now seen corresponding path program 1 times [2018-12-09 10:59:34,977 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 10:59:34,977 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-09 10:59:34,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:59:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:59:40,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:59:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 10:59:40,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 10:59:42,452 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-09 10:59:44,539 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-12-09 10:59:46,960 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-09 10:59:49,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-12-09 10:59:51,776 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-09 10:59:54,194 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-12-09 10:59:56,619 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-09 10:59:59,033 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-12-09 11:00:01,057 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-12-09 11:00:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-12-09 11:00:01,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:01,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-12-09 11:00:01,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 11:00:01,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 11:00:01,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=53, Unknown=9, NotChecked=90, Total=182 [2018-12-09 11:00:01,914 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2018-12-09 11:00:04,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse2 c_main_~main__d~0))) is different from true [2018-12-09 11:00:07,349 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_main_~main__d~0 (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) is different from true [2018-12-09 11:00:09,766 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) c_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from true [2018-12-09 11:00:11,853 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) c_main_~SqrtR__xn~0)) is different from true [2018-12-09 11:00:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:34,699 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2018-12-09 11:00:34,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:00:34,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-12-09 11:00:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:34,701 INFO L225 Difference]: With dead ends: 94 [2018-12-09 11:00:34,701 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 11:00:34,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=38, Invalid=57, Unknown=13, NotChecked=198, Total=306 [2018-12-09 11:00:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 11:00:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2018-12-09 11:00:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 11:00:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-12-09 11:00:34,712 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 33 [2018-12-09 11:00:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:34,712 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-12-09 11:00:34,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 11:00:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-12-09 11:00:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 11:00:34,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:34,713 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:34,713 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:34,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1475552478, now seen corresponding path program 1 times [2018-12-09 11:00:34,714 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 11:00:34,714 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-12-09 11:00:34,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:39,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:00:39,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:41,558 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-09 11:00:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:00:41,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:41,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-09 11:00:41,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:00:41,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:00:41,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:00:41,625 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 8 states. [2018-12-09 11:00:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:53,569 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2018-12-09 11:00:53,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:00:53,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-12-09 11:00:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:53,571 INFO L225 Difference]: With dead ends: 89 [2018-12-09 11:00:53,571 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 11:00:53,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:00:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 11:00:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2018-12-09 11:00:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 11:00:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-09 11:00:53,585 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 33 [2018-12-09 11:00:53,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:53,586 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-09 11:00:53,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:00:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-09 11:00:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 11:00:53,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:53,586 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:53,586 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:53,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:53,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1707439107, now seen corresponding path program 1 times [2018-12-09 11:00:53,587 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 11:00:53,587 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132019ff-3470-4320-911a-4c2c5d548855/bin-2019/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-12-09 11:00:53,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:01:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:01:00,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:01:09,679 WARN L180 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-09 11:01:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:01:09,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:01:12,095 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))) is different from false [2018-12-09 11:01:14,424 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))) is different from true [2018-12-09 11:01:17,078 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from false [2018-12-09 11:01:19,733 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from true [2018-12-09 11:01:22,427 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~main__d~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from false [2018-12-09 11:01:25,105 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~main__d~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from true [2018-12-09 11:01:27,783 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from false [2018-12-09 11:01:30,458 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from true [2018-12-09 11:01:31,605 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-09 11:01:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2018-12-09 11:01:31,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:01:31,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-12-09 11:01:31,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 11:01:31,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 11:01:31,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=60, Unknown=10, NotChecked=76, Total=182 [2018-12-09 11:01:31,721 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 14 states. [2018-12-09 11:01:40,017 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-09 11:01:40,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:01:40,018 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:845) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 43 more [2018-12-09 11:01:40,020 INFO L168 Benchmark]: Toolchain (without parser) took 362661.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -63.5 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2018-12-09 11:01:40,021 INFO L168 Benchmark]: CDTParser took 0.12 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 11:01:40,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.49 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 11:01:40,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.15 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 11:01:40,021 INFO L168 Benchmark]: Boogie Preprocessor took 15.74 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 11:01:40,022 INFO L168 Benchmark]: RCFGBuilder took 8402.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-09 11:01:40,022 INFO L168 Benchmark]: TraceAbstraction took 354052.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 94.2 MB). Peak memory consumption was 90.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:01:40,024 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.12 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 174.49 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.15 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. * Boogie Preprocessor took 15.74 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 8402.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 354052.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 94.2 MB). Peak memory consumption was 90.0 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...