./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2efbbd8e1ed6cd606263edae3254601484469bf9 ................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.24-cad4683 [2019-11-15 22:04:32,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:04:32,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:04:32,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:04:32,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:04:32,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:04:32,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:04:32,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:04:32,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:04:32,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:04:32,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:04:32,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:04:32,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:04:32,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:04:32,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:04:32,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:04:32,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:04:32,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:04:32,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:04:32,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:04:32,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:04:32,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:04:32,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:04:32,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:04:32,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:04:32,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:04:32,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:04:32,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:04:32,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:04:32,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:04:32,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:04:32,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:04:32,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:04:32,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:04:32,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:04:32,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:04:32,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:04:32,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:04:32,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:04:32,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:04:32,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:04:32,943 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:04:32,957 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:04:32,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:04:32,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:04:32,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:04:32,961 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:04:32,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:04:32,961 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:04:32,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:04:32,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:04:32,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:04:32,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:04:32,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:04:32,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:04:32,964 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:04:32,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:04:32,965 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:04:32,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:04:32,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:04:32,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:04:32,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:04:32,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:04:32,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:04:32,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:04:32,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:04:32,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:04:32,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:04:32,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:04:32,969 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:04:32,969 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2019-11-15 22:04:33,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:04:33,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:04:33,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:04:33,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:04:33,031 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:04:33,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2019-11-15 22:04:33,088 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/data/80dc797bc/a4e5ff57602c40a3aa912e08eb257e70/FLAG73a14fed8 [2019-11-15 22:04:33,499 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:04:33,503 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2019-11-15 22:04:33,511 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/data/80dc797bc/a4e5ff57602c40a3aa912e08eb257e70/FLAG73a14fed8 [2019-11-15 22:04:33,525 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/data/80dc797bc/a4e5ff57602c40a3aa912e08eb257e70 [2019-11-15 22:04:33,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:04:33,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:04:33,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:04:33,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:04:33,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:04:33,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:04:33" (1/1) ... [2019-11-15 22:04:33,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40324b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33, skipping insertion in model container [2019-11-15 22:04:33,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:04:33" (1/1) ... [2019-11-15 22:04:33,544 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:04:33,571 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:04:33,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:04:33,791 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:04:33,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:04:33,825 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:04:33,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33 WrapperNode [2019-11-15 22:04:33,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:04:33,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:04:33,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:04:33,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:04:33,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33" (1/1) ... [2019-11-15 22:04:33,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33" (1/1) ... [2019-11-15 22:04:33,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:04:33,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:04:33,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:04:33,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:04:33,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33" (1/1) ... [2019-11-15 22:04:33,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33" (1/1) ... [2019-11-15 22:04:33,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33" (1/1) ... [2019-11-15 22:04:33,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33" (1/1) ... [2019-11-15 22:04:33,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33" (1/1) ... [2019-11-15 22:04:33,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33" (1/1) ... [2019-11-15 22:04:33,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33" (1/1) ... [2019-11-15 22:04:33,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:04:33,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:04:33,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:04:33,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:04:33,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:04:33,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:04:33,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:04:34,140 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:04:34,141 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 22:04:34,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:04:34 BoogieIcfgContainer [2019-11-15 22:04:34,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:04:34,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:04:34,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:04:34,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:04:34,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:04:33" (1/3) ... [2019-11-15 22:04:34,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d28959f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:04:34, skipping insertion in model container [2019-11-15 22:04:34,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:33" (2/3) ... [2019-11-15 22:04:34,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d28959f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:04:34, skipping insertion in model container [2019-11-15 22:04:34,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:04:34" (3/3) ... [2019-11-15 22:04:34,148 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c.p+cfa-reducer.c [2019-11-15 22:04:34,157 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:04:34,163 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:04:34,174 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:04:34,195 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:04:34,195 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:04:34,195 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:04:34,195 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:04:34,196 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:04:34,196 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:04:34,196 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:04:34,196 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:04:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-15 22:04:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:04:34,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:34,217 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:34,219 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:04:34,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2001896247, now seen corresponding path program 1 times [2019-11-15 22:04:34,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:34,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916901167] [2019-11-15 22:04:34,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:34,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:34,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:34,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916901167] [2019-11-15 22:04:34,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:04:34,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:04:34,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778777036] [2019-11-15 22:04:34,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:04:34,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:34,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:04:34,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:04:34,378 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-11-15 22:04:34,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:34,464 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2019-11-15 22:04:34,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:04:34,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-15 22:04:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:34,475 INFO L225 Difference]: With dead ends: 51 [2019-11-15 22:04:34,475 INFO L226 Difference]: Without dead ends: 40 [2019-11-15 22:04:34,478 INFO L600 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 [2019-11-15 22:04:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-15 22:04:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2019-11-15 22:04:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 22:04:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-15 22:04:34,508 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-11-15 22:04:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:34,508 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-15 22:04:34,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:04:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-15 22:04:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:04:34,509 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:34,509 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:34,509 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:04:34,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1984885586, now seen corresponding path program 1 times [2019-11-15 22:04:34,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:34,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536676729] [2019-11-15 22:04:34,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:34,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:34,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:34,549 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:04:34,549 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:04:34,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:04:34 BoogieIcfgContainer [2019-11-15 22:04:34,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:04:34,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:04:34,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:04:34,578 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:04:34,579 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:04:34" (3/4) ... [2019-11-15 22:04:34,582 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:04:34,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:04:34,585 INFO L168 Benchmark]: Toolchain (without parser) took 1054.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -111.4 MB). Peak memory consumption was 307.8 kB. Max. memory is 11.5 GB. [2019-11-15 22:04:34,585 INFO L168 Benchmark]: CDTParser took 2.05 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:04:34,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:04:34,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:04:34,587 INFO L168 Benchmark]: Boogie Preprocessor took 18.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:04:34,587 INFO L168 Benchmark]: RCFGBuilder took 262.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:04:34,588 INFO L168 Benchmark]: TraceAbstraction took 435.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:04:34,588 INFO L168 Benchmark]: Witness Printer took 4.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:04:34,591 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.05 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 262.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 435.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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 [__return_125=0, __return_main=0, _EPS=1/1000000] [L12] double main__d; [L13] double main__r; [L14] main__d = 1.0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [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 [__return_125=0, __return_main=0, _EPS=1/1000000] [L30] COND FALSE !(SqrtR__Input <= 1.0) [L134] SqrtR__xn = 1.0 / SqrtR__Input VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [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 [__return_125=0, __return_main=0, _EPS=1/1000000] [L39] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L121] COND FALSE !(SqrtR__residu < SqrtR__linf) [L127] SqrtR____CPAchecker_TMP_0 = 0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L44] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L45] SqrtR__i = 0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [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 [__return_125=1, __return_main=0, _EPS=1/1000000] [L83] COND FALSE !(main__r >= 1.0) VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L109] main____CPAchecker_TMP_0 = 0 VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_0 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L96] __VERIFIER_error() VAL [__return_125=1, __return_main=0, _EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 56 SDtfs, 49 SDslu, 58 SDs, 0 SdLazy, 15 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:04:36,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:04:36,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:04:36,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:04:36,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:04:36,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:04:36,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:04:36,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:04:36,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:04:36,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:04:36,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:04:36,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:04:36,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:04:36,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:04:36,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:04:36,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:04:36,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:04:36,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:04:36,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:04:36,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:04:36,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:04:36,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:04:36,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:04:36,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:04:36,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:04:36,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:04:36,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:04:36,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:04:36,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:04:36,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:04:36,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:04:36,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:04:36,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:04:36,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:04:36,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:04:36,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:04:36,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:04:36,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:04:36,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:04:36,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:04:36,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:04:36,793 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:04:36,807 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:04:36,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:04:36,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:04:36,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:04:36,808 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:04:36,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:04:36,809 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:04:36,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:04:36,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:04:36,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:04:36,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:04:36,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:04:36,810 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:04:36,810 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:04:36,810 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:04:36,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:04:36,811 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:04:36,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:04:36,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:04:36,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:04:36,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:04:36,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:04:36,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:04:36,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:04:36,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:04:36,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:04:36,813 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:04:36,813 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:04:36,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:04:36,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:04:36,813 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2019-11-15 22:04:36,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:04:36,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:04:36,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:04:36,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:04:36,862 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:04:36,862 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2019-11-15 22:04:36,911 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/data/2ae727af7/1568ded8d86c486d8f71c8022d4d97e0/FLAGc10baf320 [2019-11-15 22:04:37,254 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:04:37,255 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2019-11-15 22:04:37,263 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/data/2ae727af7/1568ded8d86c486d8f71c8022d4d97e0/FLAGc10baf320 [2019-11-15 22:04:37,646 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/data/2ae727af7/1568ded8d86c486d8f71c8022d4d97e0 [2019-11-15 22:04:37,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:04:37,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:04:37,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:04:37,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:04:37,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:04:37,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:04:37" (1/1) ... [2019-11-15 22:04:37,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e253ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37, skipping insertion in model container [2019-11-15 22:04:37,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:04:37" (1/1) ... [2019-11-15 22:04:37,665 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:04:37,689 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:04:37,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:04:37,849 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:04:37,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:04:37,914 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:04:37,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37 WrapperNode [2019-11-15 22:04:37,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:04:37,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:04:37,916 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:04:37,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:04:37,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37" (1/1) ... [2019-11-15 22:04:37,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37" (1/1) ... [2019-11-15 22:04:38,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:04:38,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:04:38,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:04:38,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:04:38,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37" (1/1) ... [2019-11-15 22:04:38,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37" (1/1) ... [2019-11-15 22:04:38,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37" (1/1) ... [2019-11-15 22:04:38,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37" (1/1) ... [2019-11-15 22:04:38,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37" (1/1) ... [2019-11-15 22:04:38,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37" (1/1) ... [2019-11-15 22:04:38,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37" (1/1) ... [2019-11-15 22:04:38,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:04:38,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:04:38,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:04:38,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:04:38,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:04:38,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:04:38,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:04:47,551 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:04:47,552 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 22:04:47,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:04:47 BoogieIcfgContainer [2019-11-15 22:04:47,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:04:47,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:04:47,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:04:47,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:04:47,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:04:37" (1/3) ... [2019-11-15 22:04:47,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d27831d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:04:47, skipping insertion in model container [2019-11-15 22:04:47,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:37" (2/3) ... [2019-11-15 22:04:47,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d27831d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:04:47, skipping insertion in model container [2019-11-15 22:04:47,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:04:47" (3/3) ... [2019-11-15 22:04:47,560 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c.p+cfa-reducer.c [2019-11-15 22:04:47,569 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:04:47,576 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:04:47,586 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:04:47,607 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:04:47,607 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:04:47,608 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:04:47,608 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:04:47,608 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:04:47,608 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:04:47,609 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:04:47,609 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:04:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-15 22:04:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:04:47,628 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:47,629 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:47,631 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:04:47,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:47,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2001896247, now seen corresponding path program 1 times [2019-11-15 22:04:47,644 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:04:47,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858587421] [2019-11-15 22:04:47,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-15 22:04:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:49,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:04:49,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:49,854 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:04:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:49,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858587421] [2019-11-15 22:04:49,905 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:04:49,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 22:04:49,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036024888] [2019-11-15 22:04:49,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:04:49,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:04:49,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:04:49,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:04:49,920 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 6 states. [2019-11-15 22:04:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:56,710 INFO L93 Difference]: Finished difference Result 82 states and 114 transitions. [2019-11-15 22:04:56,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:04:56,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-15 22:04:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:56,721 INFO L225 Difference]: With dead ends: 82 [2019-11-15 22:04:56,722 INFO L226 Difference]: Without dead ends: 51 [2019-11-15 22:04:56,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:04:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-15 22:04:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 23. [2019-11-15 22:04:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 22:04:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-15 22:04:56,758 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-11-15 22:04:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:56,760 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-15 22:04:56,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:04:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-15 22:04:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:04:56,761 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:56,761 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:56,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 22:04:56,962 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:04:56,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:56,963 INFO L82 PathProgramCache]: Analyzing trace with hash 939018830, now seen corresponding path program 1 times [2019-11-15 22:04:56,963 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:04:56,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213714274] [2019-11-15 22:04:56,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-15 22:04:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:58,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:04:58,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:58,516 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:05:00,642 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_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 [2019-11-15 22:05:02,720 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_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 [2019-11-15 22:05:06,585 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 22:05:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:06,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213714274] [2019-11-15 22:05:06,588 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:05:06,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-15 22:05:06,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196040393] [2019-11-15 22:05:06,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:05:06,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:05:06,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:05:06,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2019-11-15 22:05:06,594 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 8 states. [2019-11-15 22:05:08,707 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_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))) (= c_ULTIMATE.start_main_~SqrtR__xn~0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) is different from true [2019-11-15 22:05:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:05:24,112 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2019-11-15 22:05:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:05:24,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-15 22:05:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:05:24,114 INFO L225 Difference]: With dead ends: 68 [2019-11-15 22:05:24,114 INFO L226 Difference]: Without dead ends: 49 [2019-11-15 22:05:24,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2019-11-15 22:05:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-15 22:05:24,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 25. [2019-11-15 22:05:24,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 22:05:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-15 22:05:24,121 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2019-11-15 22:05:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:05:24,121 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-15 22:05:24,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:05:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-11-15 22:05:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:05:24,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:05:24,122 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:05:24,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 22:05:24,327 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:05:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1251138159, now seen corresponding path program 1 times [2019-11-15 22:05:24,327 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:05:24,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388072917] [2019-11-15 22:05:24,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-15 22:05:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:25,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:05:25,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:05:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:25,781 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:05:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:25,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388072917] [2019-11-15 22:05:25,799 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:05:25,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 22:05:25,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338146639] [2019-11-15 22:05:25,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:05:25,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:05:25,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:05:25,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:05:25,801 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 6 states. [2019-11-15 22:05:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:05:35,090 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-11-15 22:05:35,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:05:35,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-15 22:05:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:05:35,092 INFO L225 Difference]: With dead ends: 46 [2019-11-15 22:05:35,092 INFO L226 Difference]: Without dead ends: 27 [2019-11-15 22:05:35,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:05:35,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-15 22:05:35,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 22:05:35,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:05:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-15 22:05:35,097 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2019-11-15 22:05:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:05:35,098 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 22:05:35,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:05:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-11-15 22:05:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 22:05:35,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:05:35,099 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:05:35,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 22:05:35,299 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:05:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:35,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1124243894, now seen corresponding path program 1 times [2019-11-15 22:05:35,300 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:05:35,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113614902] [2019-11-15 22:05:35,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-15 22:05:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:39,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:05:39,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:05:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:39,743 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:05:42,162 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from false [2019-11-15 22:05:44,498 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from true [2019-11-15 22:05:46,717 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.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_ULTIMATE.start_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_ULTIMATE.start_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 [2019-11-15 22:05:48,925 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.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_ULTIMATE.start_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_ULTIMATE.start_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 [2019-11-15 22:05:51,137 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.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_ULTIMATE.start_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_ULTIMATE.start_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 [2019-11-15 22:05:53,351 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.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_ULTIMATE.start_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_ULTIMATE.start_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 [2019-11-15 22:05:53,957 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-15 22:05:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:53,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113614902] [2019-11-15 22:05:53,962 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:05:53,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-15 22:05:53,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840615690] [2019-11-15 22:05:53,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:05:53,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:05:53,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:05:53,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=48, Unknown=6, NotChecked=48, Total=132 [2019-11-15 22:05:53,965 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 12 states. [2019-11-15 22:05:56,212 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (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_ULTIMATE.start_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_ULTIMATE.start_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))))) (= .cse1 c_ULTIMATE.start_main_~main__d~0))) is different from true [2019-11-15 22:05:58,441 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (let ((.cse1 (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_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 .cse0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1))))))) is different from true [2019-11-15 22:06:00,791 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_main_~SqrtR__xn~0 .cse0) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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 .cse1 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1))))))) is different from true [2019-11-15 22:06:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:10,944 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2019-11-15 22:06:10,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:06:10,954 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-15 22:06:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:10,957 INFO L225 Difference]: With dead ends: 78 [2019-11-15 22:06:10,957 INFO L226 Difference]: Without dead ends: 57 [2019-11-15 22:06:10,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=36, Invalid=51, Unknown=9, NotChecked=114, Total=210 [2019-11-15 22:06:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-15 22:06:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 31. [2019-11-15 22:06:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 22:06:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-11-15 22:06:10,966 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2019-11-15 22:06:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:10,966 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-15 22:06:10,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:06:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-11-15 22:06:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 22:06:10,967 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:10,967 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:11,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-15 22:06:11,168 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:06:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:11,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1669842835, now seen corresponding path program 1 times [2019-11-15 22:06:11,169 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:06:11,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287661299] [2019-11-15 22:06:11,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-15 22:06:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:15,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:06:15,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:15,356 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:06:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:15,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287661299] [2019-11-15 22:06:15,380 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:15,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 22:06:15,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949626249] [2019-11-15 22:06:15,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:06:15,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:06:15,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:06:15,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:06:15,382 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 6 states. [2019-11-15 22:06:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:25,549 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-11-15 22:06:25,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:06:25,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-15 22:06:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:25,551 INFO L225 Difference]: With dead ends: 64 [2019-11-15 22:06:25,551 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 22:06:25,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:06:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 22:06:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 33. [2019-11-15 22:06:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 22:06:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-15 22:06:25,561 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 18 [2019-11-15 22:06:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:25,562 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-15 22:06:25,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:06:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-11-15 22:06:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 22:06:25,563 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:25,563 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:25,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-15 22:06:25,782 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:06:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1686853496, now seen corresponding path program 1 times [2019-11-15 22:06:25,783 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:06:25,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408266734] [2019-11-15 22:06:25,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-15 22:06:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:29,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:06:29,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:06:30,036 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:06:33,922 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xnp1~0) .cse0)) is different from true [2019-11-15 22:06:36,552 WARN L838 $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_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2019-11-15 22:06:39,172 WARN L860 $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_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2019-11-15 22:06:41,694 WARN L838 $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_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2019-11-15 22:06:44,218 WARN L860 $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_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2019-11-15 22:06:46,759 WARN L838 $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_ULTIMATE.start_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_ULTIMATE.start_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2019-11-15 22:06:49,284 WARN L860 $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_ULTIMATE.start_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_ULTIMATE.start_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2019-11-15 22:06:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-11-15 22:06:49,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408266734] [2019-11-15 22:06:49,295 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:49,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-15 22:06:49,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868334268] [2019-11-15 22:06:49,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:06:49,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:06:49,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:06:49,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=42, Unknown=7, NotChecked=60, Total=132 [2019-11-15 22:06:49,297 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2019-11-15 22:06:51,800 WARN L860 $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_ULTIMATE.start_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_ULTIMATE.start_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_ULTIMATE.start_main_~main__d~0))) is different from true [2019-11-15 22:06:54,333 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~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_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0))) is different from true [2019-11-15 22:06:56,984 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= c_ULTIMATE.start_main_~SqrtR__xn~0 .cse0))) is different from true [2019-11-15 22:07:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:32,919 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2019-11-15 22:07:33,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:07:33,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-15 22:07:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:33,302 INFO L225 Difference]: With dead ends: 97 [2019-11-15 22:07:33,302 INFO L226 Difference]: Without dead ends: 74 [2019-11-15 22:07:33,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=10, NotChecked=140, Total=240 [2019-11-15 22:07:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-15 22:07:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 39. [2019-11-15 22:07:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 22:07:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-11-15 22:07:33,314 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 18 [2019-11-15 22:07:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:33,315 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-11-15 22:07:33,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:07:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-11-15 22:07:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 22:07:33,316 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:33,316 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:33,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-15 22:07:33,530 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:07:33,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1075575453, now seen corresponding path program 1 times [2019-11-15 22:07:33,531 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:07:33,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495076999] [2019-11-15 22:07:33,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-15 22:07:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:40,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:07:40,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:40,551 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:07:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:40,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495076999] [2019-11-15 22:07:40,554 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:40,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-15 22:07:40,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904840992] [2019-11-15 22:07:40,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:07:40,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:07:40,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:07:40,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:07:40,555 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 4 states. [2019-11-15 22:07:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:48,203 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2019-11-15 22:07:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:07:48,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-15 22:07:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:48,586 INFO L225 Difference]: With dead ends: 66 [2019-11-15 22:07:48,586 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 22:07:48,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:07:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 22:07:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-15 22:07:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 22:07:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-11-15 22:07:48,596 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 22 [2019-11-15 22:07:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:48,597 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-15 22:07:48,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:07:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-11-15 22:07:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:07:48,598 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:48,599 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:48,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-15 22:07:48,822 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:07:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:48,822 INFO L82 PathProgramCache]: Analyzing trace with hash 340173568, now seen corresponding path program 1 times [2019-11-15 22:07:48,822 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:07:48,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991335944] [2019-11-15 22:07:48,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/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 [2019-11-15 22:07:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:55,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:07:55,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:07:55,934 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:07:58,377 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from false [2019-11-15 22:08:00,748 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from true [2019-11-15 22:08:02,997 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.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_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))))) is different from false [2019-11-15 22:08:05,227 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.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_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))))) is different from true [2019-11-15 22:08:07,466 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.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_ULTIMATE.start_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_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))))) is different from false [2019-11-15 22:08:09,694 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.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_ULTIMATE.start_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_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))))) is different from true [2019-11-15 22:08:10,573 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-15 22:08:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:08:10,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991335944] [2019-11-15 22:08:10,577 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:10,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-15 22:08:10,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524788417] [2019-11-15 22:08:10,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:08:10,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:08:10,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:08:10,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=48, Unknown=6, NotChecked=48, Total=132 [2019-11-15 22:08:10,579 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-11-15 22:08:12,831 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (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_ULTIMATE.start_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_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse1 c_ULTIMATE.start_main_~main__d~0))) is different from true [2019-11-15 22:08:15,077 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (let ((.cse1 (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_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 .cse0)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1)))))))) is different from true [2019-11-15 22:08:17,461 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_main_~SqrtR__xn~0 .cse0) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.lt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.neg (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1)))))))) is different from true [2019-11-15 22:08:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:37,022 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2019-11-15 22:08:37,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:08:37,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-15 22:08:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:37,025 INFO L225 Difference]: With dead ends: 84 [2019-11-15 22:08:37,026 INFO L226 Difference]: Without dead ends: 54 [2019-11-15 22:08:37,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=36, Invalid=51, Unknown=9, NotChecked=114, Total=210 [2019-11-15 22:08:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-15 22:08:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2019-11-15 22:08:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 22:08:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-11-15 22:08:37,034 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 23 [2019-11-15 22:08:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:37,035 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-15 22:08:37,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:08:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-11-15 22:08:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:08:37,036 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:37,036 INFO L380 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] [2019-11-15 22:08:37,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-15 22:08:37,237 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:37,238 INFO L82 PathProgramCache]: Analyzing trace with hash 13709678, now seen corresponding path program 1 times [2019-11-15 22:08:37,238 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:08:37,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126485595] [2019-11-15 22:08:37,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/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 [2019-11-15 22:08:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:43,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:08:43,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:08:43,849 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:08:46,044 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_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 [2019-11-15 22:08:48,137 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_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 [2019-11-15 22:08:50,641 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_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 [2019-11-15 22:08:53,141 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_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 [2019-11-15 22:08:55,662 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_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 [2019-11-15 22:08:58,178 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_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 [2019-11-15 22:09:00,708 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_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 [2019-11-15 22:09:03,244 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_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 [2019-11-15 22:09:07,442 WARN L191 SmtUtils]: Spent 1.94 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 22:09:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2019-11-15 22:09:07,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126485595] [2019-11-15 22:09:07,448 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:07,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-15 22:09:07,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980780898] [2019-11-15 22:09:07,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:09:07,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:09:07,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:09:07,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=63, Unknown=8, NotChecked=76, Total=182 [2019-11-15 22:09:07,451 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 14 states. [2019-11-15 22:09:10,016 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse0 c_ULTIMATE.start_main_~main__d~0) (let ((.cse1 (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse2 .cse2)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse1) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse1))))) is different from true [2019-11-15 22:09:12,552 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_ULTIMATE.start_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_ULTIMATE.start_main_~main__d~0 (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) is different from true [2019-11-15 22:09:15,073 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~SqrtR__Input~0 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (let ((.cse1 (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse2 .cse2)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse1) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse1))))) is different from true [2019-11-15 22:09:17,181 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_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))) (= c_ULTIMATE.start_main_~SqrtR__xn~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))))))) is different from true [2019-11-15 22:09:30,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:30,960 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2019-11-15 22:09:30,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:09:30,961 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-11-15 22:09:30,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:30,962 INFO L225 Difference]: With dead ends: 90 [2019-11-15 22:09:30,962 INFO L226 Difference]: Without dead ends: 65 [2019-11-15 22:09:30,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=12, NotChecked=184, Total=306 [2019-11-15 22:09:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-15 22:09:30,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2019-11-15 22:09:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 22:09:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-11-15 22:09:30,973 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 29 [2019-11-15 22:09:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:30,973 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-11-15 22:09:30,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:09:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-11-15 22:09:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:09:30,975 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:30,975 INFO L380 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] [2019-11-15 22:09:31,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-15 22:09:31,182 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:31,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1340342541, now seen corresponding path program 1 times [2019-11-15 22:09:31,182 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:09:31,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944910058] [2019-11-15 22:09:31,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/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 [2019-11-15 22:09:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:36,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:09:36,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:09:36,803 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:09:38,318 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-11-15 22:09:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:09:38,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944910058] [2019-11-15 22:09:38,323 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:38,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-15 22:09:38,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529566665] [2019-11-15 22:09:38,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:09:38,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:09:38,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:09:38,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:09:38,324 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 8 states. [2019-11-15 22:09:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:48,956 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2019-11-15 22:09:48,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:09:48,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-15 22:09:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:48,957 INFO L225 Difference]: With dead ends: 85 [2019-11-15 22:09:48,957 INFO L226 Difference]: Without dead ends: 60 [2019-11-15 22:09:48,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:09:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-15 22:09:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2019-11-15 22:09:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 22:09:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-11-15 22:09:48,966 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 29 [2019-11-15 22:09:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:48,966 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-11-15 22:09:48,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:09:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-11-15 22:09:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:09:48,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:48,968 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:49,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-15 22:09:49,186 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:49,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:49,186 INFO L82 PathProgramCache]: Analyzing trace with hash -426284202, now seen corresponding path program 1 times [2019-11-15 22:09:49,186 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:09:49,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930872762] [2019-11-15 22:09:49,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/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 [2019-11-15 22:09:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:58,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:09:58,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:09:58,673 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:09:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:09:58,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930872762] [2019-11-15 22:09:58,703 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:09:58,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 22:09:58,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954805071] [2019-11-15 22:09:58,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:09:58,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:09:58,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:09:58,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:09:58,704 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 6 states. [2019-11-15 22:10:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:12,559 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2019-11-15 22:10:12,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:10:12,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-15 22:10:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:12,560 INFO L225 Difference]: With dead ends: 77 [2019-11-15 22:10:12,561 INFO L226 Difference]: Without dead ends: 52 [2019-11-15 22:10:12,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:10:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-15 22:10:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-11-15 22:10:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 22:10:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-11-15 22:10:12,569 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 33 [2019-11-15 22:10:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:12,572 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-11-15 22:10:12,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:10:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-11-15 22:10:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:10:12,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:12,574 INFO L380 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] [2019-11-15 22:10:12,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-15 22:10:12,776 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:10:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:12,776 INFO L82 PathProgramCache]: Analyzing trace with hash 119314739, now seen corresponding path program 1 times [2019-11-15 22:10:12,776 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:10:12,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775839360] [2019-11-15 22:10:12,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/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 [2019-11-15 22:10:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:21,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:10:21,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:36,208 WARN L191 SmtUtils]: Spent 7.48 s on a formula simplification that was a NOOP. DAG size: 16 [2019-11-15 22:10:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:10:36,255 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:10:38,705 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))) is different from false [2019-11-15 22:10:41,094 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))) is different from true [2019-11-15 22:10:43,924 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_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_ULTIMATE.start_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_ULTIMATE.start_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 [2019-11-15 22:10:46,660 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_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_ULTIMATE.start_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_ULTIMATE.start_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 [2019-11-15 22:10:49,491 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_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_ULTIMATE.start_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_ULTIMATE.start_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 [2019-11-15 22:10:52,276 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_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_ULTIMATE.start_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_ULTIMATE.start_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 [2019-11-15 22:10:55,110 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_ULTIMATE.start_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 [2019-11-15 22:10:57,932 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_ULTIMATE.start_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 [2019-11-15 22:10:58,793 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-15 22:10:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2019-11-15 22:10:58,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775839360] [2019-11-15 22:10:58,805 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:58,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-15 22:10:58,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687629275] [2019-11-15 22:10:58,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:10:58,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:10:58,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:10:58,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=61, Unknown=9, NotChecked=76, Total=182 [2019-11-15 22:10:58,807 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 14 states. [2019-11-15 22:11:01,644 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse0 c_ULTIMATE.start_main_~main__d~0) (let ((.cse3 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 .cse3))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse3) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1)))))))) is different from true [2019-11-15 22:11:04,446 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_ULTIMATE.start_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_ULTIMATE.start_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_ULTIMATE.start_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_ULTIMATE.start_main_~main__d~0 (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) is different from true [2019-11-15 22:11:07,230 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~SqrtR__Input~0 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1))))))) is different from true [2019-11-15 22:11:09,781 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~SqrtR__Input~0 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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 .cse1 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1)))))) is different from true [2019-11-15 22:11:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:38,536 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2019-11-15 22:11:38,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:11:38,537 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-11-15 22:11:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:38,538 INFO L225 Difference]: With dead ends: 83 [2019-11-15 22:11:38,538 INFO L226 Difference]: Without dead ends: 58 [2019-11-15 22:11:38,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=44, Invalid=65, Unknown=13, NotChecked=184, Total=306 [2019-11-15 22:11:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-15 22:11:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-11-15 22:11:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 22:11:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-11-15 22:11:38,550 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 33 [2019-11-15 22:11:38,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:38,550 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-11-15 22:11:38,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:11:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-11-15 22:11:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:11:38,552 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:38,552 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:38,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-15 22:11:38,768 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:11:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:38,769 INFO L82 PathProgramCache]: Analyzing trace with hash 346299736, now seen corresponding path program 2 times [2019-11-15 22:11:38,769 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:11:38,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398918257] [2019-11-15 22:11:38,769 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_743e57aa-2bf3-4a88-a086-90daacc749ef/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-15 22:11:50,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:11:50,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:11:51,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:11:51,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:58,585 WARN L191 SmtUtils]: Spent 1.83 s on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 22:12:11,201 WARN L191 SmtUtils]: Spent 5.95 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-15 22:12:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:12:11,258 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:12:13,678 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xnp1~0) .cse0)) is different from false [2019-11-15 22:12:17,882 WARN L838 $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_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2019-11-15 22:12:20,603 WARN L860 $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_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_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_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2019-11-15 22:12:23,643 WARN L838 $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_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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 [2019-11-15 22:12:26,615 WARN L860 $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_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_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 [2019-11-15 22:12:29,370 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-15 22:12:29,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-15 22:12:29,572 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:580) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 42 more [2019-11-15 22:12:29,576 INFO L168 Benchmark]: Toolchain (without parser) took 471926.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -64.7 MB). Peak memory consumption was 118.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:12:29,576 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:12:29,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 934.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:12:29,577 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 934.9 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:12:29,578 INFO L168 Benchmark]: Boogie Preprocessor took 49.02 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:12:29,578 INFO L168 Benchmark]: RCFGBuilder took 9484.39 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:12:29,579 INFO L168 Benchmark]: TraceAbstraction took 462020.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.7 MB). Peak memory consumption was 131.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:12:29,582 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 934.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 934.9 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.02 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 9484.39 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 462020.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.7 MB). Peak memory consumption was 131.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...