./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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-5842f4b [2018-11-18 17:08:39,425 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:08:39,426 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:08:39,434 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:08:39,434 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:08:39,435 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:08:39,436 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:08:39,437 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:08:39,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:08:39,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:08:39,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:08:39,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:08:39,441 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:08:39,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:08:39,443 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:08:39,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:08:39,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:08:39,445 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:08:39,447 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:08:39,448 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:08:39,448 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:08:39,449 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:08:39,451 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:08:39,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:08:39,451 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:08:39,452 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:08:39,453 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:08:39,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:08:39,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:08:39,455 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:08:39,455 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:08:39,455 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:08:39,456 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:08:39,456 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:08:39,456 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:08:39,456 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:08:39,457 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 17:08:39,466 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:08:39,466 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:08:39,467 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:08:39,467 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 17:08:39,467 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 17:08:39,467 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 17:08:39,468 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 17:08:39,468 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:08:39,468 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:08:39,468 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:08:39,468 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:08:39,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:08:39,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:08:39,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:08:39,468 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:08:39,469 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:08:39,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:08:39,469 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:08:39,469 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:08:39,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:08:39,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:08:39,469 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:08:39,469 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:08:39,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:08:39,470 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:08:39,471 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:08:39,471 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:08:39,471 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 17:08:39,471 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:08:39,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:08:39,472 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_497122d4-12a7-488b-8803-e2a2c0d2e69e/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-11-18 17:08:39,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:08:39,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:08:39,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:08:39,503 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:08:39,503 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:08:39,503 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-18 17:08:39,536 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/data/0c94b10cc/cb0fb8ba922c4f2f8b865b239014862e/FLAG661a693e4 [2018-11-18 17:08:39,849 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:08:39,850 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-18 17:08:39,855 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/data/0c94b10cc/cb0fb8ba922c4f2f8b865b239014862e/FLAG661a693e4 [2018-11-18 17:08:39,866 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/data/0c94b10cc/cb0fb8ba922c4f2f8b865b239014862e [2018-11-18 17:08:39,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:08:39,870 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 17:08:39,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:08:39,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:08:39,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:08:39,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:08:39" (1/1) ... [2018-11-18 17:08:39,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4546e68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:39, skipping insertion in model container [2018-11-18 17:08:39,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:08:39" (1/1) ... [2018-11-18 17:08:39,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:08:39,897 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:08:40,011 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:08:40,015 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:08:40,032 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:08:40,041 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:08:40,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:40 WrapperNode [2018-11-18 17:08:40,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:08:40,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:08:40,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:08:40,042 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:08:40,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:40" (1/1) ... [2018-11-18 17:08:40,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:40" (1/1) ... [2018-11-18 17:08:40,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:40" (1/1) ... [2018-11-18 17:08:40,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:40" (1/1) ... [2018-11-18 17:08:40,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:40" (1/1) ... [2018-11-18 17:08:40,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:40" (1/1) ... [2018-11-18 17:08:40,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:40" (1/1) ... [2018-11-18 17:08:40,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:08:40,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:08:40,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:08:40,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:08:40,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:08:40,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:08:40,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:08:40,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:08:40,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 17:08:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-18 17:08:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 17:08:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 17:08:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-18 17:08:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:08:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:08:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:08:40,281 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:08:40,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:08:40 BoogieIcfgContainer [2018-11-18 17:08:40,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:08:40,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:08:40,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:08:40,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:08:40,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:08:39" (1/3) ... [2018-11-18 17:08:40,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320337ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:08:40, skipping insertion in model container [2018-11-18 17:08:40,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:40" (2/3) ... [2018-11-18 17:08:40,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320337ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:08:40, skipping insertion in model container [2018-11-18 17:08:40,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:08:40" (3/3) ... [2018-11-18 17:08:40,287 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-18 17:08:40,295 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:08:40,301 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:08:40,314 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:08:40,340 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 17:08:40,340 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:08:40,340 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:08:40,340 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:08:40,341 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:08:40,341 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:08:40,341 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:08:40,341 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:08:40,341 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:08:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-18 17:08:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 17:08:40,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:08:40,361 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:08:40,362 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:08:40,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:08:40,367 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-11-18 17:08:40,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:08:40,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:08:40,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:40,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:40,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:08:40,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:08:40,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:08:40,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:08:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:08:40,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:08:40,510 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-18 17:08:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:08:40,558 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-11-18 17:08:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:08:40,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 17:08:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:08:40,565 INFO L225 Difference]: With dead ends: 75 [2018-11-18 17:08:40,565 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 17:08:40,567 INFO L604 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-11-18 17:08:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 17:08:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 27. [2018-11-18 17:08:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 17:08:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-18 17:08:40,589 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-11-18 17:08:40,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:08:40,589 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-18 17:08:40,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:08:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-18 17:08:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 17:08:40,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:08:40,590 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:08:40,590 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:08:40,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:08:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1763341697, now seen corresponding path program 1 times [2018-11-18 17:08:40,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:08:40,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:08:40,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:40,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:40,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:08:40,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:08:40,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:08:40,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:08:40,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:08:40,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:08:40,637 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-11-18 17:08:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:08:40,664 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2018-11-18 17:08:40,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:08:40,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 17:08:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:08:40,666 INFO L225 Difference]: With dead ends: 50 [2018-11-18 17:08:40,666 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 17:08:40,666 INFO L604 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-11-18 17:08:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 17:08:40,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2018-11-18 17:08:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 17:08:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-18 17:08:40,671 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-11-18 17:08:40,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:08:40,672 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-18 17:08:40,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:08:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-18 17:08:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 17:08:40,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:08:40,673 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:08:40,673 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:08:40,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:08:40,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1747284348, now seen corresponding path program 1 times [2018-11-18 17:08:40,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:08:40,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:08:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:40,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:08:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:08:40,703 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 17:08:40,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:08:40 BoogieIcfgContainer [2018-11-18 17:08:40,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:08:40,722 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:08:40,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:08:40,723 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:08:40,723 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:08:40" (3/4) ... [2018-11-18 17:08:40,725 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 17:08:40,725 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:08:40,726 INFO L168 Benchmark]: Toolchain (without parser) took 856.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -117.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:40,727 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:08:40,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.66 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:40,727 INFO L168 Benchmark]: Boogie Preprocessor took 19.91 ms. Allocated memory is still 1.0 GB. Free memory was 946.6 MB in the beginning and 945.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:40,728 INFO L168 Benchmark]: RCFGBuilder took 219.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:40,728 INFO L168 Benchmark]: TraceAbstraction took 440.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:40,729 INFO L168 Benchmark]: Witness Printer took 2.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:08:40,730 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 171.66 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.91 ms. Allocated memory is still 1.0 GB. Free memory was 946.6 MB in the beginning and 945.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 219.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 440.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 96]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L1] int __return_main; [L6] double _EPS = 0.0000010; [L9] double __return_125; VAL [\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-5842f4b [2018-11-18 17:08:42,074 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:08:42,075 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:08:42,083 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:08:42,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:08:42,084 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:08:42,084 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:08:42,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:08:42,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:08:42,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:08:42,088 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:08:42,088 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:08:42,089 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:08:42,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:08:42,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:08:42,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:08:42,092 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:08:42,093 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:08:42,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:08:42,095 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:08:42,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:08:42,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:08:42,098 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:08:42,099 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:08:42,099 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:08:42,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:08:42,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:08:42,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:08:42,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:08:42,101 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:08:42,101 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:08:42,102 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:08:42,102 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:08:42,102 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:08:42,103 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:08:42,103 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:08:42,103 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 17:08:42,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:08:42,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:08:42,113 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:08:42,113 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 17:08:42,114 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 17:08:42,114 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 17:08:42,114 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 17:08:42,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:08:42,115 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:08:42,115 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:08:42,115 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:08:42,115 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:08:42,115 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:08:42,115 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:08:42,115 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 17:08:42,116 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 17:08:42,116 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:08:42,116 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:08:42,116 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:08:42,116 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:08:42,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:08:42,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:08:42,117 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:08:42,117 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:08:42,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:08:42,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:08:42,117 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:08:42,117 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:08:42,117 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 17:08:42,117 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:08:42,118 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 17:08:42,120 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 17:08:42,120 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_497122d4-12a7-488b-8803-e2a2c0d2e69e/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-11-18 17:08:42,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:08:42,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:08:42,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:08:42,163 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:08:42,163 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:08:42,163 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-18 17:08:42,204 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/data/7cb401228/841a52e71566469f8645b48c07dc127a/FLAG50c45863e [2018-11-18 17:08:42,590 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:08:42,590 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-18 17:08:42,594 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/data/7cb401228/841a52e71566469f8645b48c07dc127a/FLAG50c45863e [2018-11-18 17:08:42,602 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/data/7cb401228/841a52e71566469f8645b48c07dc127a [2018-11-18 17:08:42,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:08:42,604 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 17:08:42,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:08:42,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:08:42,608 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:08:42,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:08:42" (1/1) ... [2018-11-18 17:08:42,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71da67b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:42, skipping insertion in model container [2018-11-18 17:08:42,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:08:42" (1/1) ... [2018-11-18 17:08:42,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:08:42,636 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:08:42,775 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:08:42,780 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:08:42,800 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:08:42,810 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:08:42,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:42 WrapperNode [2018-11-18 17:08:42,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:08:42,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:08:42,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:08:42,811 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:08:42,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:42" (1/1) ... [2018-11-18 17:08:42,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:42" (1/1) ... [2018-11-18 17:08:42,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:42" (1/1) ... [2018-11-18 17:08:42,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:42" (1/1) ... [2018-11-18 17:08:42,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:42" (1/1) ... [2018-11-18 17:08:42,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:42" (1/1) ... [2018-11-18 17:08:42,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:42" (1/1) ... [2018-11-18 17:08:42,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:08:42,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:08:42,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:08:42,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:08:42,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:08:42,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:08:42,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:08:42,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:08:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 17:08:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-18 17:08:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 17:08:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 17:08:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-18 17:08:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:08:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:08:42,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:08:51,106 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:08:51,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:08:51 BoogieIcfgContainer [2018-11-18 17:08:51,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:08:51,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:08:51,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:08:51,109 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:08:51,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:08:42" (1/3) ... [2018-11-18 17:08:51,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58272bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:08:51, skipping insertion in model container [2018-11-18 17:08:51,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:42" (2/3) ... [2018-11-18 17:08:51,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58272bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:08:51, skipping insertion in model container [2018-11-18 17:08:51,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:08:51" (3/3) ... [2018-11-18 17:08:51,111 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-18 17:08:51,117 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:08:51,121 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:08:51,130 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:08:51,147 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 17:08:51,148 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:08:51,148 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:08:51,148 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:08:51,148 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:08:51,148 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:08:51,148 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:08:51,148 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:08:51,149 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:08:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-18 17:08:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 17:08:51,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:08:51,165 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:08:51,166 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:08:51,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:08:51,170 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-11-18 17:08:51,172 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:08:51,173 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-18 17:08:51,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:52,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:08:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:08:52,950 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:08:52,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:08:52,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:08:52,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:08:52,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:08:52,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:08:52,994 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-18 17:08:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:08:56,654 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-11-18 17:08:56,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:08:56,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 17:08:56,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:08:56,661 INFO L225 Difference]: With dead ends: 70 [2018-11-18 17:08:56,661 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 17:08:56,663 INFO L604 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-11-18 17:08:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 17:08:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2018-11-18 17:08:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 17:08:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-18 17:08:56,687 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-11-18 17:08:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:08:56,687 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-18 17:08:56,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:08:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-18 17:08:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 17:08:56,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:08:56,688 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:08:56,689 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:08:56,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:08:56,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1420788200, now seen corresponding path program 1 times [2018-11-18 17:08:56,689 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:08:56,689 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-18 17:08:56,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:57,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:08:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:08:57,834 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:08:57,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:08:57,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:08:57,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:08:57,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:08:57,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:08:57,868 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-11-18 17:09:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:09:04,091 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2018-11-18 17:09:04,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:09:04,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 17:09:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:09:04,092 INFO L225 Difference]: With dead ends: 48 [2018-11-18 17:09:04,092 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 17:09:04,093 INFO L604 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-11-18 17:09:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 17:09:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 17:09:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 17:09:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-18 17:09:04,096 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-11-18 17:09:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:09:04,096 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-18 17:09:04,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:09:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-18 17:09:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 17:09:04,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:09:04,097 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:09:04,097 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:09:04,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:09:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash -619377979, now seen corresponding path program 1 times [2018-11-18 17:09:04,098 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:09:04,098 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-18 17:09:04,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:09:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:09:05,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:09:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:09:05,267 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:09:05,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:09:05,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:09:05,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:09:05,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:09:05,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:09:05,287 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2018-11-18 17:09:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:09:22,028 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-18 17:09:22,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:09:22,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 17:09:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:09:22,030 INFO L225 Difference]: With dead ends: 55 [2018-11-18 17:09:22,030 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 17:09:22,031 INFO L604 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-11-18 17:09:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 17:09:22,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-18 17:09:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 17:09:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-18 17:09:22,035 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2018-11-18 17:09:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:09:22,035 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 17:09:22,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:09:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-18 17:09:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 17:09:22,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:09:22,036 INFO L375 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-11-18 17:09:22,036 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:09:22,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:09:22,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1492678358, now seen corresponding path program 1 times [2018-11-18 17:09:22,036 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:09:22,037 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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-11-18 17:09:22,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:09:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:09:25,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:09:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 17:09:25,295 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:09:25,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:09:25,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:09:25,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:09:25,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:09:25,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:09:25,336 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2018-11-18 17:09:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:09:27,529 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2018-11-18 17:09:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:09:27,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-18 17:09:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:09:27,531 INFO L225 Difference]: With dead ends: 54 [2018-11-18 17:09:27,531 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 17:09:27,531 INFO L604 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-11-18 17:09:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 17:09:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2018-11-18 17:09:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 17:09:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-11-18 17:09:27,537 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2018-11-18 17:09:27,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:09:27,538 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-18 17:09:27,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:09:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-11-18 17:09:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 17:09:27,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:09:27,539 INFO L375 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-11-18 17:09:27,539 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:09:27,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:09:27,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1476621009, now seen corresponding path program 1 times [2018-11-18 17:09:27,540 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:09:27,540 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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-11-18 17:09:27,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:09:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:09:30,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:09:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:09:30,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:09:33,223 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-11-18 17:09:37,409 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-11-18 17:09:39,892 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-11-18 17:09:42,282 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-11-18 17:09:44,685 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-11-18 17:09:47,090 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-11-18 17:09:49,519 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-11-18 17:09:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-18 17:09:49,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:09:49,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 17:09:49,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 17:09:49,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 17:09:49,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=42, Unknown=7, NotChecked=60, Total=132 [2018-11-18 17:09:49,579 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2018-11-18 17:09:51,993 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-11-18 17:09:54,416 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-11-18 17:09:56,926 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-11-18 17:10:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:10:27,873 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2018-11-18 17:10:28,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 17:10:28,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-18 17:10:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:10:28,173 INFO L225 Difference]: With dead ends: 101 [2018-11-18 17:10:28,174 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 17:10:28,174 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=10, NotChecked=140, Total=240 [2018-11-18 17:10:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 17:10:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 43. [2018-11-18 17:10:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 17:10:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2018-11-18 17:10:28,182 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 22 [2018-11-18 17:10:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:10:28,182 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-11-18 17:10:28,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 17:10:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-18 17:10:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 17:10:28,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:10:28,183 INFO L375 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-11-18 17:10:28,183 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:10:28,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:10:28,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1956324209, now seen corresponding path program 2 times [2018-11-18 17:10:28,183 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:10:28,183 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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-11-18 17:10:28,187 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 17:10:33,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 17:10:33,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:10:33,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:10:35,706 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-11-18 17:10:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-18 17:10:35,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:10:38,076 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-11-18 17:10:40,382 WARN L854 $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 true [2018-11-18 17:10:42,913 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-11-18 17:10:45,451 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-11-18 17:10:48,218 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-11-18 17:10:50,993 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-11-18 17:10:53,600 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-11-18 17:10:56,207 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-11-18 17:10:58,813 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-11-18 17:11:01,450 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-11-18 17:11:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-18 17:11:01,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:11:01,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 17:11:01,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 17:11:01,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 17:11:01,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=42, Unknown=11, NotChecked=102, Total=182 [2018-11-18 17:11:01,525 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 14 states. [2018-11-18 17:11:04,170 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-11-18 17:11:06,813 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-11-18 17:11:09,653 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-11-18 17:11:12,140 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-11-18 17:11:14,666 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-11-18 17:12:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:00,840 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2018-11-18 17:12:01,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 17:12:01,151 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-18 17:12:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:01,153 INFO L225 Difference]: With dead ends: 110 [2018-11-18 17:12:01,153 INFO L226 Difference]: Without dead ends: 87 [2018-11-18 17:12:01,153 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 42.9s TimeCoverageRelationStatistics Valid=40, Invalid=56, Unknown=16, NotChecked=230, Total=342 [2018-11-18 17:12:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-18 17:12:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2018-11-18 17:12:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 17:12:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2018-11-18 17:12:01,166 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 26 [2018-11-18 17:12:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:01,166 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-11-18 17:12:01,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 17:12:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2018-11-18 17:12:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 17:12:01,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:01,167 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:01,167 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:01,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:01,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1739969516, now seen corresponding path program 1 times [2018-11-18 17:12:01,167 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:12:01,167 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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-11-18 17:12:01,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:12:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:06,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:12:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:12:06,614 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:12:06,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:06,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 17:12:06,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 17:12:06,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:12:06,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:12:06,671 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 7 states. [2018-11-18 17:12:25,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:25,386 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2018-11-18 17:12:25,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:12:25,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-18 17:12:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:25,388 INFO L225 Difference]: With dead ends: 83 [2018-11-18 17:12:25,388 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 17:12:25,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 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-11-18 17:12:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 17:12:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-11-18 17:12:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 17:12:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2018-11-18 17:12:25,397 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 26 [2018-11-18 17:12:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:25,397 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-11-18 17:12:25,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 17:12:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-11-18 17:12:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 17:12:25,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:25,398 INFO L375 BasicCegarLoop]: trace histogram [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-11-18 17:12:25,398 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:25,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1580885751, now seen corresponding path program 1 times [2018-11-18 17:12:25,399 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:12:25,399 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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-11-18 17:12:25,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:30,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:12:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:12:30,835 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:12:30,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:30,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 17:12:30,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 17:12:30,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:12:30,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:12:30,893 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 7 states. [2018-11-18 17:12:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:49,585 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-18 17:12:49,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:12:49,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 17:12:49,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:49,586 INFO L225 Difference]: With dead ends: 80 [2018-11-18 17:12:49,586 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 17:12:49,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 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-11-18 17:12:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 17:12:49,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-11-18 17:12:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 17:12:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-11-18 17:12:49,595 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 27 [2018-11-18 17:12:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:49,596 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-11-18 17:12:49,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 17:12:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-11-18 17:12:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:12:49,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:49,596 INFO L375 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-11-18 17:12:49,597 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:49,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:49,597 INFO L82 PathProgramCache]: Analyzing trace with hash 127977651, now seen corresponding path program 3 times [2018-11-18 17:12:49,597 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:12:49,597 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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-11-18 17:12:49,602 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 17:12:54,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 17:12:54,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:12:55,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:12:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 17:12:55,071 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:12:55,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:55,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:12:55,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:12:55,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:12:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:12:55,128 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand 4 states. [2018-11-18 17:13:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:13:06,624 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2018-11-18 17:13:06,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:13:06,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-18 17:13:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:13:06,919 INFO L225 Difference]: With dead ends: 93 [2018-11-18 17:13:06,920 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 17:13:06,920 INFO L604 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-11-18 17:13:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 17:13:06,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2018-11-18 17:13:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 17:13:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-18 17:13:06,929 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 30 [2018-11-18 17:13:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:13:06,930 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-18 17:13:06,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:13:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-18 17:13:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 17:13:06,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:13:06,931 INFO L375 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-11-18 17:13:06,931 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:13:06,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:13:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash 331588760, now seen corresponding path program 1 times [2018-11-18 17:13:06,931 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:13:06,931 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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-11-18 17:13:06,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:13:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:13:12,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:13:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 17:13:12,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:13:14,241 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-11-18 17:13:16,312 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-11-18 17:13:18,695 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-11-18 17:13:21,082 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-11-18 17:13:23,464 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-11-18 17:13:25,859 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-11-18 17:13:28,257 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-11-18 17:13:30,652 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-11-18 17:13:37,552 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 17:13:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-11-18 17:13:37,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:13:37,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 17:13:37,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 17:13:37,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 17:13:37,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=63, Unknown=8, NotChecked=76, Total=182 [2018-11-18 17:13:37,624 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2018-11-18 17:13:40,043 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-11-18 17:13:42,446 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-11-18 17:13:44,834 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-11-18 17:13:46,916 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-11-18 17:14:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:14:16,728 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2018-11-18 17:14:16,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 17:14:16,729 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-18 17:14:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:14:16,729 INFO L225 Difference]: With dead ends: 94 [2018-11-18 17:14:16,729 INFO L226 Difference]: Without dead ends: 69 [2018-11-18 17:14:16,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=12, NotChecked=184, Total=306 [2018-11-18 17:14:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-18 17:14:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2018-11-18 17:14:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 17:14:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-11-18 17:14:16,742 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 33 [2018-11-18 17:14:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:14:16,742 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-11-18 17:14:16,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 17:14:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-18 17:14:16,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 17:14:16,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:14:16,743 INFO L375 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-11-18 17:14:16,743 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:14:16,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:14:16,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1475552478, now seen corresponding path program 1 times [2018-11-18 17:14:16,744 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:14:16,744 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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-11-18 17:14:16,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:14:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:14:21,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:14:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 17:14:21,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:14:22,826 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-18 17:14:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 17:14:22,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:14:22,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 17:14:22,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 17:14:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 17:14:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:14:22,882 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 8 states. [2018-11-18 17:14:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:14:37,274 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2018-11-18 17:14:37,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:14:37,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-18 17:14:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:14:37,276 INFO L225 Difference]: With dead ends: 89 [2018-11-18 17:14:37,276 INFO L226 Difference]: Without dead ends: 64 [2018-11-18 17:14:37,276 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-18 17:14:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-18 17:14:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2018-11-18 17:14:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 17:14:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-18 17:14:37,289 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 33 [2018-11-18 17:14:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:14:37,289 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-18 17:14:37,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 17:14:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-18 17:14:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 17:14:37,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:14:37,290 INFO L375 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-11-18 17:14:37,290 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:14:37,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:14:37,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1707439107, now seen corresponding path program 1 times [2018-11-18 17:14:37,291 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:14:37,291 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_497122d4-12a7-488b-8803-e2a2c0d2e69e/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-11-18 17:14:37,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:14:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:14:44,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:14:53,772 WARN L180 SmtUtils]: Spent 2.47 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-18 17:14:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 17:14:53,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:14:56,172 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-11-18 17:14:58,493 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-11-18 17:15:01,107 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-11-18 17:15:03,705 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-11-18 17:15:06,307 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-11-18 17:15:08,926 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-11-18 17:15:11,564 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-11-18 17:15:14,234 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-11-18 17:15:15,345 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 17:15:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2018-11-18 17:15:15,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:15:15,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 17:15:15,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 17:15:15,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 17:15:15,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=60, Unknown=10, NotChecked=76, Total=182 [2018-11-18 17:15:15,458 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 14 states. [2018-11-18 17:15:18,154 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (let ((.cse2 (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse3 .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)))))) (= .cse3 c_main_~main__d~0))) is different from true [2018-11-18 17:15:20,830 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 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))))) (= 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-11-18 17:15:23,509 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 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))))) (= (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-11-18 17:15:25,252 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-18 17:15:25,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:15:25,253 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:672) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:601) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 43 more [2018-11-18 17:15:25,255 INFO L168 Benchmark]: Toolchain (without parser) took 402651.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -125.4 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:25,256 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:15:25,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.77 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 927.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:25,257 INFO L168 Benchmark]: Boogie Preprocessor took 24.71 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:15:25,258 INFO L168 Benchmark]: RCFGBuilder took 8270.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:25,258 INFO L168 Benchmark]: TraceAbstraction took 394147.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 92.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:25,260 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 205.77 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 927.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.71 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 8270.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 394147.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 92.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...