./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f9bb533a6ae968b56a3b4121531d019ea186c25a1e8156a6682080f16505ca3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:48:46,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:48:46,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:48:46,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:48:46,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:48:46,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:48:46,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:48:46,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:48:46,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:48:46,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:48:46,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:48:46,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:48:46,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:48:46,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:48:46,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:48:46,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:48:46,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:48:46,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:48:46,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:48:46,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:48:46,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:48:46,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:48:46,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:48:46,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:48:46,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:48:46,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:48:46,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:48:46,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:48:46,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:48:46,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:48:46,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:48:46,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:48:46,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:48:46,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:48:46,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:48:46,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:48:46,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:48:46,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:48:46,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:48:46,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:48:46,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:48:46,748 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 06:48:46,798 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:48:46,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:48:46,799 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:48:46,799 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:48:46,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:48:46,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:48:46,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:48:46,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:48:46,802 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:48:46,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:48:46,803 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:48:46,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:48:46,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:48:46,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:48:46,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 06:48:46,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:48:46,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 06:48:46,805 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:48:46,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:48:46,805 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:48:46,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 06:48:46,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:48:46,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:48:46,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:48:46,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:48:46,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:48:46,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:48:46,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 06:48:46,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:48:46,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 06:48:46,808 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 06:48:46,808 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 06:48:46,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 06:48:46,809 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:48:46,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF 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(reach_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 -> 6f9bb533a6ae968b56a3b4121531d019ea186c25a1e8156a6682080f16505ca3 [2021-11-20 06:48:47,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:48:47,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:48:47,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:48:47,152 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:48:47,153 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:48:47,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c [2021-11-20 06:48:47,258 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/data/ee67de315/e49f4e6f2f2747a698337929d9663d05/FLAG2e50f1b4f [2021-11-20 06:48:47,800 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:48:47,800 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c [2021-11-20 06:48:47,814 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/data/ee67de315/e49f4e6f2f2747a698337929d9663d05/FLAG2e50f1b4f [2021-11-20 06:48:48,140 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/data/ee67de315/e49f4e6f2f2747a698337929d9663d05 [2021-11-20 06:48:48,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:48:48,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:48:48,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:48:48,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:48:48,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:48:48,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:48:48" (1/1) ... [2021-11-20 06:48:48,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac84ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48, skipping insertion in model container [2021-11-20 06:48:48,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:48:48" (1/1) ... [2021-11-20 06:48:48,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:48:48,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:48:48,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c[321,334] [2021-11-20 06:48:48,441 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:48:48,450 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:48:48,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c[321,334] [2021-11-20 06:48:48,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:48:48,484 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:48:48,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48 WrapperNode [2021-11-20 06:48:48,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:48:48,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:48:48,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:48:48,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:48:48,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48" (1/1) ... [2021-11-20 06:48:48,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48" (1/1) ... [2021-11-20 06:48:48,523 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2021-11-20 06:48:48,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:48:48,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:48:48,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:48:48,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:48:48,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48" (1/1) ... [2021-11-20 06:48:48,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48" (1/1) ... [2021-11-20 06:48:48,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48" (1/1) ... [2021-11-20 06:48:48,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48" (1/1) ... [2021-11-20 06:48:48,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48" (1/1) ... [2021-11-20 06:48:48,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48" (1/1) ... [2021-11-20 06:48:48,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48" (1/1) ... [2021-11-20 06:48:48,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:48:48,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:48:48,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:48:48,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:48:48,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48" (1/1) ... [2021-11-20 06:48:48,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:48:48,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:48:48,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:48:48,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:48:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:48:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:48:48,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:48:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 06:48:48,721 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:48:48,724 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:48:48,917 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:48:48,924 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:48:48,924 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-20 06:48:48,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:48:48 BoogieIcfgContainer [2021-11-20 06:48:48,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:48:48,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:48:48,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:48:48,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:48:48,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:48:48" (1/3) ... [2021-11-20 06:48:48,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64860a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:48:48, skipping insertion in model container [2021-11-20 06:48:48,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:48" (2/3) ... [2021-11-20 06:48:48,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64860a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:48:48, skipping insertion in model container [2021-11-20 06:48:48,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:48:48" (3/3) ... [2021-11-20 06:48:48,937 INFO L111 eAbstractionObserver]: Analyzing ICFG digits_bad_while.c [2021-11-20 06:48:48,943 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:48:48,943 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 06:48:49,013 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:48:49,035 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 06:48:49,040 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 06:48:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:48:49,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-20 06:48:49,065 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:48:49,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-20 06:48:49,067 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:48:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:48:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-11-20 06:48:49,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:48:49,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461166275] [2021-11-20 06:48:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:48:49,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:48:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:48:49,227 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:48:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:48:49,288 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:48:49,290 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 06:48:49,292 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 06:48:49,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 06:48:49,301 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2021-11-20 06:48:49,305 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 06:48:49,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:48:49 BoogieIcfgContainer [2021-11-20 06:48:49,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 06:48:49,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 06:48:49,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 06:48:49,339 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 06:48:49,340 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:48:48" (3/4) ... [2021-11-20 06:48:49,345 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-20 06:48:49,345 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 06:48:49,348 INFO L158 Benchmark]: Toolchain (without parser) took 1201.05ms. Allocated memory is still 130.0MB. Free memory was 95.9MB in the beginning and 81.0MB in the end (delta: 14.9MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2021-11-20 06:48:49,350 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 86.0MB. Free memory was 57.8MB in the beginning and 57.7MB in the end (delta: 29.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:48:49,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.18ms. Allocated memory is still 130.0MB. Free memory was 95.7MB in the beginning and 106.2MB in the end (delta: -10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 06:48:49,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.06ms. Allocated memory is still 130.0MB. Free memory was 106.2MB in the beginning and 104.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 06:48:49,354 INFO L158 Benchmark]: Boogie Preprocessor took 25.80ms. Allocated memory is still 130.0MB. Free memory was 104.7MB in the beginning and 103.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 06:48:49,356 INFO L158 Benchmark]: RCFGBuilder took 375.20ms. Allocated memory is still 130.0MB. Free memory was 103.3MB in the beginning and 94.3MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 06:48:49,357 INFO L158 Benchmark]: TraceAbstraction took 405.50ms. Allocated memory is still 130.0MB. Free memory was 93.6MB in the beginning and 81.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-20 06:48:49,359 INFO L158 Benchmark]: Witness Printer took 7.05ms. Allocated memory is still 130.0MB. Free memory was 81.7MB in the beginning and 81.0MB in the end (delta: 648.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:48:49,371 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 86.0MB. Free memory was 57.8MB in the beginning and 57.7MB in the end (delta: 29.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.18ms. Allocated memory is still 130.0MB. Free memory was 95.7MB in the beginning and 106.2MB in the end (delta: -10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.06ms. Allocated memory is still 130.0MB. Free memory was 106.2MB in the beginning and 104.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.80ms. Allocated memory is still 130.0MB. Free memory was 104.7MB in the beginning and 103.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.20ms. Allocated memory is still 130.0MB. Free memory was 103.3MB in the beginning and 94.3MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 405.50ms. Allocated memory is still 130.0MB. Free memory was 93.6MB in the beginning and 81.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 7.05ms. Allocated memory is still 130.0MB. Free memory was 81.7MB in the beginning and 81.0MB in the end (delta: 648.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 4]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryLONGDOUBLEComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L8] long double x = 1.0/7.0; [L9] long long res = 0; [L11] int i = 1; VAL [i=1, res=0] [L12] COND FALSE !(x != 0) VAL [i=1, res=0] [L19] CALL __VERIFIER_assert(res > 67050) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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 [2021-11-20 06:48:49,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f9bb533a6ae968b56a3b4121531d019ea186c25a1e8156a6682080f16505ca3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:48:52,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:48:52,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:48:52,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:48:52,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:48:52,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:48:52,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:48:52,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:48:52,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:48:52,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:48:52,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:48:52,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:48:52,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:48:52,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:48:52,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:48:52,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:48:52,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:48:52,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:48:52,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:48:52,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:48:52,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:48:52,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:48:52,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:48:52,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:48:52,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:48:52,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:48:52,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:48:52,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:48:52,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:48:52,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:48:52,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:48:52,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:48:52,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:48:52,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:48:52,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:48:52,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:48:52,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:48:52,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:48:52,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:48:52,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:48:52,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:48:52,645 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-20 06:48:52,699 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:48:52,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:48:52,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:48:52,701 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:48:52,702 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:48:52,702 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:48:52,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:48:52,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:48:52,704 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:48:52,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:48:52,705 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:48:52,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:48:52,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:48:52,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 06:48:52,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:48:52,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 06:48:52,707 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 06:48:52,707 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-20 06:48:52,707 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-20 06:48:52,708 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:48:52,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:48:52,708 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:48:52,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 06:48:52,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:48:52,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:48:52,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:48:52,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:48:52,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:48:52,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:48:52,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 06:48:52,710 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-20 06:48:52,711 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-20 06:48:52,711 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 06:48:52,711 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 06:48:52,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 06:48:52,712 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:48:52,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 06:48:52,712 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF 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(reach_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 -> 6f9bb533a6ae968b56a3b4121531d019ea186c25a1e8156a6682080f16505ca3 [2021-11-20 06:48:53,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:48:53,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:48:53,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:48:53,266 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:48:53,267 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:48:53,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c [2021-11-20 06:48:53,356 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/data/e9b06ced4/c1e29f7bae204795b03c817fba639894/FLAG14d968d70 [2021-11-20 06:48:53,964 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:48:53,965 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c [2021-11-20 06:48:53,972 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/data/e9b06ced4/c1e29f7bae204795b03c817fba639894/FLAG14d968d70 [2021-11-20 06:48:54,305 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/data/e9b06ced4/c1e29f7bae204795b03c817fba639894 [2021-11-20 06:48:54,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:48:54,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:48:54,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:48:54,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:48:54,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:48:54,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:48:54" (1/1) ... [2021-11-20 06:48:54,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a01c066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54, skipping insertion in model container [2021-11-20 06:48:54,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:48:54" (1/1) ... [2021-11-20 06:48:54,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:48:54,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:48:54,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c[321,334] [2021-11-20 06:48:54,544 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:48:54,559 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:48:54,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c[321,334] [2021-11-20 06:48:54,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:48:54,613 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:48:54,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54 WrapperNode [2021-11-20 06:48:54,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:48:54,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:48:54,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:48:54,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:48:54,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54" (1/1) ... [2021-11-20 06:48:54,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54" (1/1) ... [2021-11-20 06:48:54,694 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2021-11-20 06:48:54,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:48:54,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:48:54,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:48:54,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:48:54,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54" (1/1) ... [2021-11-20 06:48:54,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54" (1/1) ... [2021-11-20 06:48:54,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54" (1/1) ... [2021-11-20 06:48:54,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54" (1/1) ... [2021-11-20 06:48:54,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54" (1/1) ... [2021-11-20 06:48:54,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54" (1/1) ... [2021-11-20 06:48:54,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54" (1/1) ... [2021-11-20 06:48:54,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:48:54,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:48:54,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:48:54,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:48:54,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54" (1/1) ... [2021-11-20 06:48:54,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:48:54,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:48:54,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:48:54,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:48:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:48:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:48:54,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:48:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-20 06:48:54,964 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:48:54,967 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:48:57,223 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:48:57,230 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:48:57,231 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-20 06:48:57,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:48:57 BoogieIcfgContainer [2021-11-20 06:48:57,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:48:57,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:48:57,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:48:57,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:48:57,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:48:54" (1/3) ... [2021-11-20 06:48:57,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774eb854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:48:57, skipping insertion in model container [2021-11-20 06:48:57,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:48:54" (2/3) ... [2021-11-20 06:48:57,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774eb854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:48:57, skipping insertion in model container [2021-11-20 06:48:57,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:48:57" (3/3) ... [2021-11-20 06:48:57,244 INFO L111 eAbstractionObserver]: Analyzing ICFG digits_bad_while.c [2021-11-20 06:48:57,250 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:48:57,251 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 06:48:57,310 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:48:57,319 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 06:48:57,320 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 06:48:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:48:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-20 06:48:57,365 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:48:57,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-20 06:48:57,367 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:48:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:48:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-11-20 06:48:57,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:48:57,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242298559] [2021-11-20 06:48:57,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:48:57,391 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:48:57,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:48:57,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:48:57,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-20 06:48:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:48:57,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 06:48:57,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:48:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:48:57,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:48:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:48:57,767 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:48:57,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242298559] [2021-11-20 06:48:57,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242298559] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:48:57,769 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:48:57,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-20 06:48:57,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886070682] [2021-11-20 06:48:57,773 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:48:57,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:48:57,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:48:57,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:48:57,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:48:57,818 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:49:00,083 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:49:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:49:00,163 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-11-20 06:49:00,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:49:00,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-20 06:49:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:49:00,188 INFO L225 Difference]: With dead ends: 20 [2021-11-20 06:49:00,189 INFO L226 Difference]: Without dead ends: 8 [2021-11-20 06:49:00,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:49:00,196 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:49:00,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-11-20 06:49:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-11-20 06:49:00,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-11-20 06:49:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:49:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-11-20 06:49:00,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-11-20 06:49:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:49:00,235 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-11-20 06:49:00,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:49:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-11-20 06:49:00,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-20 06:49:00,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:49:00,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:49:00,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-20 06:49:00,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:49:00,452 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:49:00,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:49:00,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2021-11-20 06:49:00,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:49:00,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884074882] [2021-11-20 06:49:00,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:49:00,454 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:49:00,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:49:00,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:49:00,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-20 06:49:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:49:01,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:49:01,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:49:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:49:02,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:49:09,138 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:49:11,189 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:49:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-20 06:49:11,434 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:49:11,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884074882] [2021-11-20 06:49:11,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884074882] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:49:11,435 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:49:11,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-11-20 06:49:11,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394269564] [2021-11-20 06:49:11,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:49:11,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:49:11,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:49:11,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:49:11,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=17, Unknown=2, NotChecked=8, Total=42 [2021-11-20 06:49:11,440 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:49:13,473 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:49:15,587 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:49:17,791 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:49:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:49:18,172 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2021-11-20 06:49:18,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:49:18,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-20 06:49:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:49:18,174 INFO L225 Difference]: With dead ends: 13 [2021-11-20 06:49:18,174 INFO L226 Difference]: Without dead ends: 9 [2021-11-20 06:49:18,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=17, Invalid=18, Unknown=3, NotChecked=18, Total=56 [2021-11-20 06:49:18,177 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:49:18,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 2 Unknown, 6 Unchecked, 4.6s Time] [2021-11-20 06:49:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-11-20 06:49:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-11-20 06:49:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:49:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-11-20 06:49:18,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2021-11-20 06:49:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:49:18,184 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-11-20 06:49:18,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:49:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-11-20 06:49:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-20 06:49:18,185 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:49:18,185 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2021-11-20 06:49:18,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-20 06:49:18,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:49:18,386 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:49:18,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:49:18,388 INFO L85 PathProgramCache]: Analyzing trace with hash 292915403, now seen corresponding path program 2 times [2021-11-20 06:49:18,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:49:18,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281934940] [2021-11-20 06:49:18,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:49:18,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:49:18,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:49:18,397 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:49:18,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-20 06:49:19,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:49:19,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:49:19,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:49:19,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:49:27,852 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:49:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-20 06:49:27,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:49:34,143 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:49:36,195 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:49:42,560 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:49:44,682 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:49:50,920 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:49:52,991 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:49:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-20 06:49:52,992 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:49:52,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281934940] [2021-11-20 06:49:52,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281934940] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:49:52,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:49:52,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-11-20 06:49:52,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384493394] [2021-11-20 06:49:52,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:49:52,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 06:49:52,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:49:52,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:49:52,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=18, Unknown=7, NotChecked=44, Total=90 [2021-11-20 06:49:52,996 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:49:55,121 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:49:57,263 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0)))) (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:49:59,329 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse1) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:50:01,474 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:50:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:50:01,990 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2021-11-20 06:50:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:50:01,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-20 06:50:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:50:01,992 INFO L225 Difference]: With dead ends: 14 [2021-11-20 06:50:01,992 INFO L226 Difference]: Without dead ends: 10 [2021-11-20 06:50:01,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=29, Invalid=22, Unknown=11, NotChecked=120, Total=182 [2021-11-20 06:50:01,995 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:50:01,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 23 Unchecked, 0.6s Time] [2021-11-20 06:50:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-11-20 06:50:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-11-20 06:50:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:50:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2021-11-20 06:50:02,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2021-11-20 06:50:02,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:50:02,002 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2021-11-20 06:50:02,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:50:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-11-20 06:50:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-20 06:50:02,003 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:50:02,003 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2021-11-20 06:50:02,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-20 06:50:02,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:50:02,211 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:50:02,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:50:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 492108272, now seen corresponding path program 3 times [2021-11-20 06:50:02,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:50:02,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698049906] [2021-11-20 06:50:02,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:50:02,213 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:50:02,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:50:02,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:50:02,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-20 06:50:04,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 06:50:04,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:50:04,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 06:50:04,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:50:12,624 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:50:19,431 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:50:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-11-20 06:50:19,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:50:25,775 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:50:27,845 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:50:34,262 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:50:36,395 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:50:42,992 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:50:45,200 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:50:51,666 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:50:53,819 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:50:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-20 06:50:53,820 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:50:53,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698049906] [2021-11-20 06:50:53,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698049906] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:50:53,821 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:50:53,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-11-20 06:50:53,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754058800] [2021-11-20 06:50:53,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:50:53,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 06:50:53,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:50:53,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 06:50:53,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=19, Unknown=10, NotChecked=78, Total=132 [2021-11-20 06:50:53,823 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:50:56,010 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:50:58,235 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0)))) (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:51:00,386 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:51:02,499 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse1) (_ bv10 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:51:04,634 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:51:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:51:05,015 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2021-11-20 06:51:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:51:05,016 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-20 06:51:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:51:05,017 INFO L225 Difference]: With dead ends: 15 [2021-11-20 06:51:05,017 INFO L226 Difference]: Without dead ends: 11 [2021-11-20 06:51:05,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=35, Invalid=24, Unknown=15, NotChecked=198, Total=272 [2021-11-20 06:51:05,020 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:51:05,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 34 Unchecked, 0.4s Time] [2021-11-20 06:51:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-11-20 06:51:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-11-20 06:51:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:51:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2021-11-20 06:51:05,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2021-11-20 06:51:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:51:05,026 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2021-11-20 06:51:05,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:51:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2021-11-20 06:51:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-20 06:51:05,027 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:51:05,027 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2021-11-20 06:51:05,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-20 06:51:05,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:51:05,228 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:51:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:51:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 4 times [2021-11-20 06:51:05,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:51:05,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026667282] [2021-11-20 06:51:05,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:51:05,230 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:51:05,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:51:05,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:51:05,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-20 06:51:08,154 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:51:08,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:51:08,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:51:08,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:51:16,460 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:51:23,233 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:51:30,296 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))))) is different from true [2021-11-20 06:51:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-11-20 06:51:30,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:51:36,681 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:51:38,751 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:51:45,192 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:51:47,333 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:51:53,987 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:51:56,205 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:52:03,044 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:52:05,319 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:52:12,021 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:52:14,257 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:52:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-11-20 06:52:14,257 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:52:14,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026667282] [2021-11-20 06:52:14,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026667282] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:52:14,258 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:52:14,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-11-20 06:52:14,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664231320] [2021-11-20 06:52:14,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:52:14,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 06:52:14,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:52:14,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 06:52:14,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=20, Unknown=13, NotChecked=120, Total=182 [2021-11-20 06:52:14,261 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:52:16,529 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:52:18,837 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0)))) (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:52:21,116 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:52:23,364 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (not (fp.eq (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:52:25,556 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse1) (_ bv10 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:52:27,787 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))))) is different from true [2021-11-20 06:52:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:52:28,275 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2021-11-20 06:52:28,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:52:28,276 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-20 06:52:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:52:28,277 INFO L225 Difference]: With dead ends: 16 [2021-11-20 06:52:28,277 INFO L226 Difference]: Without dead ends: 12 [2021-11-20 06:52:28,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 43.3s TimeCoverageRelationStatistics Valid=41, Invalid=26, Unknown=19, NotChecked=294, Total=380 [2021-11-20 06:52:28,296 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 06:52:28,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 45 Unchecked, 0.5s Time] [2021-11-20 06:52:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-20 06:52:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-20 06:52:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:52:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2021-11-20 06:52:28,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2021-11-20 06:52:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:52:28,307 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2021-11-20 06:52:28,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:52:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2021-11-20 06:52:28,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 06:52:28,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:52:28,309 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2021-11-20 06:52:28,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-20 06:52:28,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:52:28,536 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:52:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:52:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash 522938704, now seen corresponding path program 5 times [2021-11-20 06:52:28,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:52:28,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105658059] [2021-11-20 06:52:28,538 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:52:28,538 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:52:28,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:52:28,539 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:52:28,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-20 06:52:33,428 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-11-20 06:52:33,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:52:33,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 06:52:33,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:52:42,078 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:52:48,899 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:52:56,075 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))))) is different from true [2021-11-20 06:53:01,265 WARN L227 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:53:03,550 WARN L860 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:53:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2021-11-20 06:53:03,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:53:09,955 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:53:12,027 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:53:21,421 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse0) (not (fp.eq (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse1) (_ bv10 32)))))) .cse0)))) is different from false [2021-11-20 06:53:23,566 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse0) (not (fp.eq (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse1) (_ bv10 32)))))) .cse0)))) is different from true [2021-11-20 06:53:35,130 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) .cse1))))) is different from false [2021-11-20 06:53:37,370 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) .cse1))))) is different from true [2021-11-20 06:53:47,180 WARN L227 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 18 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:53:49,483 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse2 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse3)) (fp.eq .cse2 .cse3)))) is different from false [2021-11-20 06:53:51,783 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse2 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse3)) (fp.eq .cse2 .cse3)))) is different from true [2021-11-20 06:53:56,870 WARN L227 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 34 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:54:02,124 WARN L227 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 23 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:54:04,494 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse3)) (fp.eq .cse2 .cse3)))) is different from false [2021-11-20 06:54:06,864 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse3)) (fp.eq .cse2 .cse3)))) is different from true [2021-11-20 06:54:16,912 WARN L227 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 28 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:54:19,236 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse3)) (fp.eq .cse2 .cse3)))) is different from false [2021-11-20 06:54:21,564 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse3)) (fp.eq .cse2 .cse3)))) is different from true [2021-11-20 06:54:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2021-11-20 06:54:21,565 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:54:21,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105658059] [2021-11-20 06:54:21,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105658059] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:54:21,566 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:54:21,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-11-20 06:54:21,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660877226] [2021-11-20 06:54:21,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:54:21,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-20 06:54:21,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:54:21,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 06:54:21,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=21, Unknown=16, NotChecked=170, Total=240 [2021-11-20 06:54:21,568 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:54:23,931 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse3)) (fp.eq .cse2 .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:54:26,330 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse3)) (fp.eq .cse2 .cse3)))) (= |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:54:28,640 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (let ((.cse2 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse3)) (fp.eq .cse2 .cse3))) (= (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:54:30,934 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) .cse1)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:54:33,374 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse0) (not (fp.eq (let ((.cse1 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse1) (_ bv10 32))))) .cse0)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:54:35,457 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse1) (_ bv10 32)))))))) is different from false [2021-11-20 06:54:37,779 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse1) (_ bv10 32)))))))) is different from true [2021-11-20 06:54:40,085 WARN L860 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:54:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:54:40,141 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2021-11-20 06:54:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:54:40,143 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-20 06:54:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:54:40,144 INFO L225 Difference]: With dead ends: 17 [2021-11-20 06:54:40,144 INFO L226 Difference]: Without dead ends: 13 [2021-11-20 06:54:40,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 55.9s TimeCoverageRelationStatistics Valid=47, Invalid=27, Unknown=24, NotChecked=408, Total=506 [2021-11-20 06:54:40,146 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:54:40,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 56 Unchecked, 0.1s Time] [2021-11-20 06:54:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-20 06:54:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-20 06:54:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:54:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2021-11-20 06:54:40,153 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2021-11-20 06:54:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:54:40,154 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2021-11-20 06:54:40,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:54:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2021-11-20 06:54:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 06:54:40,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:54:40,155 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2021-11-20 06:54:40,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-20 06:54:40,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:54:40,360 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:54:40,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:54:40,361 INFO L85 PathProgramCache]: Analyzing trace with hash -967103989, now seen corresponding path program 6 times [2021-11-20 06:54:40,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:54:40,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606089146] [2021-11-20 06:54:40,362 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:54:40,362 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:54:40,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:54:40,363 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:54:40,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-20 06:54:44,925 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-11-20 06:54:44,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:54:45,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 06:54:45,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:54:53,549 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:55:00,298 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:55:07,535 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))))) is different from true [2021-11-20 06:55:12,708 WARN L227 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:55:15,010 WARN L860 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:55:20,380 WARN L227 SmtUtils]: Spent 5.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:55:22,776 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:55:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2021-11-20 06:55:22,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:55:29,278 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:55:31,353 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:55:37,794 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:55:39,943 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:55:50,202 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) .cse3)) (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse3))) is different from false [2021-11-20 06:55:52,419 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) .cse3)) (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse3))) is different from true [2021-11-20 06:55:57,427 WARN L227 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 13 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:56:04,437 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) .cse1))))) is different from false [2021-11-20 06:56:06,734 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) .cse1))))) is different from true [2021-11-20 06:56:16,905 WARN L227 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 18 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:56:19,268 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32)))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from false [2021-11-20 06:56:21,631 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32)))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from true [2021-11-20 06:56:26,790 WARN L227 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 39 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:56:32,234 WARN L227 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 23 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:56:34,660 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32)))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from false [2021-11-20 06:56:37,102 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32)))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from true [2021-11-20 06:56:42,150 WARN L227 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 44 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:56:47,476 WARN L227 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 28 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:56:49,868 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32)))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from false [2021-11-20 06:56:52,268 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32)))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from true [2021-11-20 06:56:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2021-11-20 06:56:52,268 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:56:52,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606089146] [2021-11-20 06:56:52,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606089146] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:56:52,269 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:56:52,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-11-20 06:56:52,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992770215] [2021-11-20 06:56:52,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:56:52,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 06:56:52,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:56:52,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 06:56:52,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=22, Unknown=19, NotChecked=228, Total=306 [2021-11-20 06:56:52,270 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:56:54,711 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32)))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse4)) (fp.eq .cse3 .cse4)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:56:57,176 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0)))) (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32)))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse4)) (fp.eq .cse3 .cse4)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:56:59,577 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse4 (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32)))))) (.cse5 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) .cse5)) (fp.eq .cse4 .cse5))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:57:02,065 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) .cse1)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:57:04,503 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) .cse3)) (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse3))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:57:06,669 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))))))) is different from false [2021-11-20 06:57:09,014 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))))))) is different from true [2021-11-20 06:57:11,454 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:57:13,832 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:57:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:57:13,871 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2021-11-20 06:57:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 06:57:13,872 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-20 06:57:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:57:13,873 INFO L225 Difference]: With dead ends: 18 [2021-11-20 06:57:13,873 INFO L226 Difference]: Without dead ends: 14 [2021-11-20 06:57:13,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 66.3s TimeCoverageRelationStatistics Valid=53, Invalid=29, Unknown=28, NotChecked=540, Total=650 [2021-11-20 06:57:13,875 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:57:13,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 67 Unchecked, 0.1s Time] [2021-11-20 06:57:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-20 06:57:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-20 06:57:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:57:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-11-20 06:57:13,880 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2021-11-20 06:57:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:57:13,881 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-11-20 06:57:13,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:57:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-11-20 06:57:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 06:57:13,882 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:57:13,882 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2021-11-20 06:57:13,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-20 06:57:14,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:57:14,084 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:57:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:57:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash 86212784, now seen corresponding path program 7 times [2021-11-20 06:57:14,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:57:14,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476839405] [2021-11-20 06:57:14,086 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 06:57:14,086 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:57:14,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:57:14,087 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:57:14,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-20 06:57:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:57:19,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 06:57:19,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:57:27,680 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:57:34,451 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:57:41,495 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))))) is different from true [2021-11-20 06:57:46,540 WARN L227 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:57:48,881 WARN L860 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:57:54,218 WARN L227 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:57:56,640 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:58:02,328 WARN L227 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:58:04,774 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:58:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 27 not checked. [2021-11-20 06:58:04,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:58:11,271 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:58:13,341 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:58:19,805 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:58:21,956 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:58:28,633 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:58:30,860 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:58:37,785 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:58:40,085 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:58:47,234 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:58:49,606 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:58:56,982 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:58:59,427 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:59:04,444 WARN L227 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 44 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:59:06,937 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:59:09,445 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:59:16,844 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 06:59:19,297 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 06:59:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2021-11-20 06:59:19,300 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:59:19,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476839405] [2021-11-20 06:59:19,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476839405] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:59:19,301 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:59:19,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2021-11-20 06:59:19,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185145223] [2021-11-20 06:59:19,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:59:19,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-20 06:59:19,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:59:19,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 06:59:19,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=23, Unknown=22, NotChecked=294, Total=380 [2021-11-20 06:59:19,302 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:59:21,841 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:59:24,375 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:59:26,846 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:59:29,402 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:59:31,848 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:59:34,098 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))))) is different from false [2021-11-20 06:59:36,529 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))))) is different from true [2021-11-20 06:59:38,971 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:59:41,550 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse1) (_ bv10 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 06:59:44,128 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 06:59:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:59:44,610 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2021-11-20 06:59:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:59:44,611 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-20 06:59:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:59:44,612 INFO L225 Difference]: With dead ends: 19 [2021-11-20 06:59:44,612 INFO L226 Difference]: Without dead ends: 15 [2021-11-20 06:59:44,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 77.3s TimeCoverageRelationStatistics Valid=59, Invalid=31, Unknown=32, NotChecked=690, Total=812 [2021-11-20 06:59:44,614 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 06:59:44,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 78 Unchecked, 0.5s Time] [2021-11-20 06:59:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-11-20 06:59:44,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-11-20 06:59:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:59:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2021-11-20 06:59:44,620 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2021-11-20 06:59:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:59:44,621 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-11-20 06:59:44,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:59:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2021-11-20 06:59:44,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-20 06:59:44,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:59:44,622 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2021-11-20 06:59:44,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-11-20 06:59:44,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:59:44,846 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:59:44,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:59:44,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1620705621, now seen corresponding path program 8 times [2021-11-20 06:59:44,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:59:44,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079772604] [2021-11-20 06:59:44,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:59:44,846 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:59:44,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:59:44,847 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:59:44,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-20 06:59:49,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:59:49,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:59:50,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 06:59:50,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:59:59,006 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 07:00:05,780 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 07:00:12,903 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))))) is different from true [2021-11-20 07:00:18,019 WARN L227 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 07:00:20,342 WARN L860 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 07:00:25,710 WARN L227 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 07:00:28,091 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 07:00:33,744 WARN L227 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 07:00:36,211 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 07:00:42,307 WARN L227 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 07:00:45,032 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse8) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|)) is different from true [2021-11-20 07:00:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 35 not checked. [2021-11-20 07:00:45,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:00:51,606 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 07:00:53,675 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 07:01:00,144 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 07:01:02,293 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 07:01:08,972 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 07:01:11,191 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 07:01:18,107 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 07:01:20,425 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 07:01:27,578 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 07:01:29,966 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 07:01:37,289 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 07:01:39,722 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 07:01:44,785 WARN L227 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 44 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 07:01:47,333 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 07:01:49,895 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 07:01:55,150 WARN L227 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 49 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 07:01:57,811 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 07:02:00,417 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 07:02:05,563 WARN L227 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 54 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 07:02:08,123 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse8) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-11-20 07:02:10,707 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse8) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-11-20 07:02:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2021-11-20 07:02:10,708 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 07:02:10,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079772604] [2021-11-20 07:02:10,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079772604] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:02:10,709 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 07:02:10,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2021-11-20 07:02:10,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180166323] [2021-11-20 07:02:10,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 07:02:10,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 07:02:10,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 07:02:10,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 07:02:10,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=24, Unknown=25, NotChecked=368, Total=462 [2021-11-20 07:02:10,711 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:02:13,341 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse8) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 07:02:15,971 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32))))) is different from true [2021-11-20 07:02:18,539 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 07:02:21,049 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (not (fp.eq (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 07:02:23,615 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 07:02:25,942 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))))) is different from false [2021-11-20 07:02:28,600 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32)))))))) is different from true [2021-11-20 07:02:31,184 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse6 (let ((.cse7 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 07:02:33,854 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (not (fp.eq (let ((.cse7 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 07:02:36,442 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse1) (_ bv10 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 07:02:38,981 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse8) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse7) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|)) is different from true [2021-11-20 07:02:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:02:39,418 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2021-11-20 07:02:39,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 07:02:39,419 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-20 07:02:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:02:39,420 INFO L225 Difference]: With dead ends: 20 [2021-11-20 07:02:39,420 INFO L226 Difference]: Without dead ends: 16 [2021-11-20 07:02:39,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 89.4s TimeCoverageRelationStatistics Valid=65, Invalid=33, Unknown=36, NotChecked=858, Total=992 [2021-11-20 07:02:39,423 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 07:02:39,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 89 Unchecked, 0.5s Time] [2021-11-20 07:02:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-20 07:02:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-11-20 07:02:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:02:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-11-20 07:02:39,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2021-11-20 07:02:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:02:39,447 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-11-20 07:02:39,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:02:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-11-20 07:02:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-20 07:02:39,449 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:02:39,449 INFO L514 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2021-11-20 07:02:39,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-20 07:02:39,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 07:02:39,676 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:02:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:02:39,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1299398672, now seen corresponding path program 9 times [2021-11-20 07:02:39,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 07:02:39,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364488012] [2021-11-20 07:02:39,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 07:02:39,677 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 07:02:39,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 07:02:39,678 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 07:02:39,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7beadaf-3dc9-442c-8f60-c814ef608119/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process