./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:20:06,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:20:07,004 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 17:20:07,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:20:07,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:20:07,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:20:07,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:20:07,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:20:07,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:20:07,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:20:07,040 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:20:07,040 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:20:07,041 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:20:07,041 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:20:07,042 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:20:07,042 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:20:07,043 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:20:07,043 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:20:07,044 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:20:07,044 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:20:07,045 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:20:07,045 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:20:07,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:20:07,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:20:07,047 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:20:07,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:20:07,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:20:07,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:20:07,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:20:07,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:20:07,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:20:07,050 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:20:07,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:20:07,050 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:20:07,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:20:07,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:20:07,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:20:07,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:20:07,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:20:07,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:20:07,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:20:07,052 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:20:07,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:20:07,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:20:07,053 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:20:07,053 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:20:07,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:20:07,053 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/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_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 [2023-12-02 17:20:07,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:20:07,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:20:07,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:20:07,295 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:20:07,296 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:20:07,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2023-12-02 17:20:10,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:20:10,214 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:20:10,214 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2023-12-02 17:20:10,221 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/data/69915f4b2/2810334d3f7a4737bcf3a91846c87c62/FLAG259511479 [2023-12-02 17:20:10,233 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/data/69915f4b2/2810334d3f7a4737bcf3a91846c87c62 [2023-12-02 17:20:10,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:20:10,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:20:10,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:20:10,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:20:10,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:20:10,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b60c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10, skipping insertion in model container [2023-12-02 17:20:10,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,261 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:20:10,379 WARN L240 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_41b20e9a-5dd0-49e7-a691-6de7cce7f440/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2023-12-02 17:20:10,396 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:20:10,404 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:20:10,414 WARN L240 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_41b20e9a-5dd0-49e7-a691-6de7cce7f440/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2023-12-02 17:20:10,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:20:10,435 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:20:10,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10 WrapperNode [2023-12-02 17:20:10,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:20:10,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:20:10,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:20:10,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:20:10,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,468 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 76 [2023-12-02 17:20:10,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:20:10,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:20:10,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:20:10,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:20:10,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:20:10,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:20:10,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:20:10,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:20:10,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10" (1/1) ... [2023-12-02 17:20:10,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:20:10,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:20:10,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:20:10,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:20:10,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:20:10,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 17:20:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 17:20:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-12-02 17:20:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 17:20:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-12-02 17:20:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:20:10,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:20:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 17:20:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:20:10,629 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:20:10,631 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:20:10,753 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:20:10,842 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:20:10,842 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 17:20:10,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:20:10 BoogieIcfgContainer [2023-12-02 17:20:10,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:20:10,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:20:10,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:20:10,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:20:10,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:20:10" (1/3) ... [2023-12-02 17:20:10,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbe0cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:20:10, skipping insertion in model container [2023-12-02 17:20:10,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:10" (2/3) ... [2023-12-02 17:20:10,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbe0cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:20:10, skipping insertion in model container [2023-12-02 17:20:10,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:20:10" (3/3) ... [2023-12-02 17:20:10,854 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2023-12-02 17:20:10,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:20:10,873 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 17:20:10,938 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:20:10,945 INFO L357 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13fdd6c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:20:10,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 17:20:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2023-12-02 17:20:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 17:20:10,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:20:10,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 17:20:10,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:20:10,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:20:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2890016, now seen corresponding path program 1 times [2023-12-02 17:20:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:20:10,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420141857] [2023-12-02 17:20:10,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:20:10,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:20:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:20:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:20:11,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:20:11,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420141857] [2023-12-02 17:20:11,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420141857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:20:11,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:20:11,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:20:11,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424166463] [2023-12-02 17:20:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:20:11,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:20:11,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:20:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:20:11,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:20:11,263 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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) [2023-12-02 17:20:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:20:11,291 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2023-12-02 17:20:11,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:20:11,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2023-12-02 17:20:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:20:11,300 INFO L225 Difference]: With dead ends: 13 [2023-12-02 17:20:11,300 INFO L226 Difference]: Without dead ends: 6 [2023-12-02 17:20:11,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:20:11,306 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:20:11,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 17:20:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2023-12-02 17:20:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2023-12-02 17:20:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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) [2023-12-02 17:20:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2023-12-02 17:20:11,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2023-12-02 17:20:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:20:11,330 INFO L495 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2023-12-02 17:20:11,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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) [2023-12-02 17:20:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2023-12-02 17:20:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 17:20:11,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:20:11,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 17:20:11,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 17:20:11,332 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:20:11,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:20:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash 88688096, now seen corresponding path program 1 times [2023-12-02 17:20:11,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:20:11,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480280477] [2023-12-02 17:20:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:20:11,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:20:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 17:20:11,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 17:20:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 17:20:11,437 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 17:20:11,437 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 17:20:11,439 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 17:20:11,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 17:20:11,443 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-02 17:20:11,446 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 17:20:11,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:20:11 BoogieIcfgContainer [2023-12-02 17:20:11,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 17:20:11,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 17:20:11,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 17:20:11,465 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 17:20:11,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:20:10" (3/4) ... [2023-12-02 17:20:11,467 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 17:20:11,468 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 17:20:11,469 INFO L158 Benchmark]: Toolchain (without parser) took 1232.54ms. Allocated memory is still 138.4MB. Free memory was 101.2MB in the beginning and 81.4MB in the end (delta: 19.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2023-12-02 17:20:11,469 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 102.8MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:20:11,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.56ms. Allocated memory is still 138.4MB. Free memory was 101.2MB in the beginning and 90.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 17:20:11,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.26ms. Allocated memory is still 138.4MB. Free memory was 90.0MB in the beginning and 88.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:20:11,471 INFO L158 Benchmark]: Boogie Preprocessor took 22.28ms. Allocated memory is still 138.4MB. Free memory was 88.3MB in the beginning and 86.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:20:11,472 INFO L158 Benchmark]: RCFGBuilder took 352.08ms. Allocated memory is still 138.4MB. Free memory was 86.9MB in the beginning and 69.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 17:20:11,472 INFO L158 Benchmark]: TraceAbstraction took 616.94ms. Allocated memory is still 138.4MB. Free memory was 68.3MB in the beginning and 81.4MB in the end (delta: -13.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:20:11,472 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 138.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:20:11,475 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 102.8MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.56ms. Allocated memory is still 138.4MB. Free memory was 101.2MB in the beginning and 90.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.26ms. Allocated memory is still 138.4MB. Free memory was 90.0MB in the beginning and 88.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.28ms. Allocated memory is still 138.4MB. Free memory was 88.3MB in the beginning and 86.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.08ms. Allocated memory is still 138.4MB. Free memory was 86.9MB in the beginning and 69.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 616.94ms. Allocated memory is still 138.4MB. Free memory was 68.3MB in the beginning and 81.4MB in the end (delta: -13.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 138.4MB. Free memory is still 81.4MB. 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: 16]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 31. Possible FailurePath: [L46] double a,r; [L48] a = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not(a >= 20. && a <= 30.) [L14] COND FALSE !(!cond) [L49] RET assume_abort_if_not(a >= 20. && a <= 30.) [L51] CALL, EXPR inv(a) [L26] double xi, xsi, temp; [L27] signed int cond, exp; [L28] union double_int A_u, xi_u; [L29] A_u.d = A [L30] EXPR A_u.i [L30] EXPR A_u.i & 0x7FF0000000000000 [L30] exp = (signed int) ((A_u.i & 0x7FF0000000000000) >> 52) - 1023 [L31] xi_u.d = 1 [L32] xi_u.i = (((long long)(1023-exp)) << 52) [L33] EXPR xi_u.d [L33] xi = xi_u.d [L34] cond = 1 VAL [A=9218868437227405325, A_u={5:0}, \old(A)=9218868437227405325, cond=1, exp=-1023, xi=9218868437227405327, xi_u={4:0}] [L35] COND TRUE \read(cond) [L36] xsi = 2*xi-A*xi*xi [L37] temp = xsi-xi [L38] cond = ((temp > 1e-10) || (temp < -1e-10)) [L39] xi = xsi VAL [A=9218868437227405325, A_u={5:0}, \old(A)=9218868437227405325, cond=0, exp=-1023, xi=9218868437227405326, xi_u={4:0}, xsi=9218868437227405326] [L35] COND FALSE !(\read(cond)) [L41] return xi; [L41] return xi; [L41] return xi; [L51] RET, EXPR inv(a) [L51] r = inv(a) [L53] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 3 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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 [2023-12-02 17:20:11,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:20:13,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:20:13,586 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 17:20:13,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:20:13,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:20:13,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:20:13,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:20:13,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:20:13,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:20:13,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:20:13,629 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:20:13,630 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:20:13,630 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:20:13,631 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:20:13,631 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:20:13,632 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:20:13,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:20:13,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:20:13,634 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:20:13,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:20:13,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:20:13,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:20:13,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:20:13,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:20:13,637 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:20:13,638 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 17:20:13,638 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 17:20:13,639 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:20:13,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:20:13,640 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:20:13,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:20:13,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 17:20:13,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:20:13,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:20:13,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:20:13,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:20:13,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:20:13,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:20:13,642 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 17:20:13,643 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 17:20:13,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:20:13,644 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:20:13,644 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:20:13,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:20:13,644 INFO L153 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_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/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_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 [2023-12-02 17:20:13,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:20:13,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:20:13,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:20:13,973 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:20:13,973 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:20:13,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2023-12-02 17:20:16,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:20:16,979 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:20:16,980 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2023-12-02 17:20:16,986 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/data/882cc6fab/83b32051d5de40bd9e59595a5b3f2a77/FLAG1745989fe [2023-12-02 17:20:16,997 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/data/882cc6fab/83b32051d5de40bd9e59595a5b3f2a77 [2023-12-02 17:20:17,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:20:17,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:20:17,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:20:17,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:20:17,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:20:17,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb75bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17, skipping insertion in model container [2023-12-02 17:20:17,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,032 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:20:17,199 WARN L240 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_41b20e9a-5dd0-49e7-a691-6de7cce7f440/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2023-12-02 17:20:17,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:20:17,233 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:20:17,246 WARN L240 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_41b20e9a-5dd0-49e7-a691-6de7cce7f440/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2023-12-02 17:20:17,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:20:17,276 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:20:17,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17 WrapperNode [2023-12-02 17:20:17,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:20:17,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:20:17,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:20:17,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:20:17,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,318 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2023-12-02 17:20:17,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:20:17,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:20:17,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:20:17,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:20:17,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:20:17,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:20:17,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:20:17,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:20:17,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17" (1/1) ... [2023-12-02 17:20:17,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:20:17,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:20:17,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:20:17,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:20:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:20:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-12-02 17:20:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-12-02 17:20:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 17:20:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 17:20:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2023-12-02 17:20:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:20:17,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:20:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2023-12-02 17:20:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:20:17,508 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:20:17,510 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:20:19,767 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:20:19,795 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:20:19,795 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 17:20:19,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:20:19 BoogieIcfgContainer [2023-12-02 17:20:19,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:20:19,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:20:19,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:20:19,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:20:19,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:20:17" (1/3) ... [2023-12-02 17:20:19,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c34d89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:20:19, skipping insertion in model container [2023-12-02 17:20:19,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:17" (2/3) ... [2023-12-02 17:20:19,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c34d89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:20:19, skipping insertion in model container [2023-12-02 17:20:19,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:20:19" (3/3) ... [2023-12-02 17:20:19,805 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2023-12-02 17:20:19,831 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:20:19,831 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 17:20:19,878 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:20:19,885 INFO L357 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@326f5e46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:20:19,885 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 17:20:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) 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) [2023-12-02 17:20:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 17:20:19,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:20:19,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:20:19,897 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:20:19,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:20:19,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1259772761, now seen corresponding path program 1 times [2023-12-02 17:20:19,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:20:19,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049984399] [2023-12-02 17:20:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:20:19,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:20:19,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:20:19,916 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:20:19,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 17:20:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:20:20,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 17:20:20,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:20:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:20:20,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:20:20,052 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:20:20,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049984399] [2023-12-02 17:20:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049984399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:20:20,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:20:20,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:20:20,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789893595] [2023-12-02 17:20:20,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:20:20,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 17:20:20,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:20:20,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 17:20:20,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 17:20:20,086 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-12-02 17:20:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:20:20,118 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2023-12-02 17:20:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 17:20:20,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 [2023-12-02 17:20:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:20:20,126 INFO L225 Difference]: With dead ends: 18 [2023-12-02 17:20:20,126 INFO L226 Difference]: Without dead ends: 8 [2023-12-02 17:20:20,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 17:20:20,131 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:20:20,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 17:20:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-12-02 17:20:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-12-02 17:20:20,153 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) [2023-12-02 17:20:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-02 17:20:20,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2023-12-02 17:20:20,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:20:20,155 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-02 17:20:20,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-12-02 17:20:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-02 17:20:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 17:20:20,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:20:20,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:20:20,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:20:20,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:20:20,357 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:20:20,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:20:20,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1202514459, now seen corresponding path program 1 times [2023-12-02 17:20:20,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:20:20,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576735963] [2023-12-02 17:20:20,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:20:20,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:20:20,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:20:20,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:20:20,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 17:20:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:20:20,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 17:20:20,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:20:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:20:20,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:20:20,503 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:20:20,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576735963] [2023-12-02 17:20:20,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576735963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:20:20,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:20:20,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:20:20,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771696538] [2023-12-02 17:20:20,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:20:20,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:20:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:20:20,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:20:20,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:20:20,507 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-12-02 17:20:22,756 WARN L539 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 [] [2023-12-02 17:20:24,759 WARN L539 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 [] [2023-12-02 17:20:27,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 17:20:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:20:27,124 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2023-12-02 17:20:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:20:27,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 [2023-12-02 17:20:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:20:27,126 INFO L225 Difference]: With dead ends: 13 [2023-12-02 17:20:27,126 INFO L226 Difference]: Without dead ends: 9 [2023-12-02 17:20:27,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:20:27,128 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:20:27,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 3 Unknown, 0 Unchecked, 6.6s Time] [2023-12-02 17:20:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-02 17:20:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-02 17:20:27,132 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) [2023-12-02 17:20:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-12-02 17:20:27,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2023-12-02 17:20:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:20:27,133 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-12-02 17:20:27,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-12-02 17:20:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-12-02 17:20:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 17:20:27,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:20:27,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:20:27,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-02 17:20:27,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:20:27,338 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:20:27,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:20:27,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1377844293, now seen corresponding path program 1 times [2023-12-02 17:20:27,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:20:27,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270681094] [2023-12-02 17:20:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:20:27,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:20:27,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:20:27,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:20:27,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 17:20:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:20:28,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 17:20:28,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:21:39,443 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse7 (fp.neg .cse6)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (or (and (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse1 (let ((.cse8 (let ((.cse9 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))) (.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse1))) (and (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) .cse1)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse4) (not (fp.gt .cse5 .cse6)) (not (fp.lt .cse5 .cse7))))))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse10 .cse3) (fp.leq .cse10 .cse4) (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse11 (let ((.cse12 (let ((.cse13 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (and (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse11) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse10 .cse11) .cse11)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.gt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse11) .cse6))))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse15 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse14 (let ((.cse16 (let ((.cse17 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17))))) (fp ((_ extract 63 63) .cse16) ((_ extract 62 52) .cse16) ((_ extract 51 0) .cse16))))) (and (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse14) .cse7) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse14) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse15 .cse14) .cse14)) |c_ULTIMATE.start_inv_~xi~0#1|)))) (fp.geq .cse15 .cse3) (fp.leq .cse15 .cse4))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 17:22:02,954 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse0 (let ((.cse4 (let ((.cse5 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse0) .cse0)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.gt .cse2 .cse3)) (not (fp.lt .cse2 (fp.neg .cse3))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 17:23:34,486 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse2 (fp.neg .cse1)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_46 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))) (.cse8 (let ((.cse10 (let ((.cse11 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11))))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse8) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse8) .cse8)))) (let ((.cse0 (fp.sub roundNearestTiesToEven .cse5 .cse8))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 .cse2)) (fp.geq .cse3 .cse4) (fp.leq .cse5 .cse6) (fp.leq .cse3 .cse7)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse12 .cse4) (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse15 (let ((.cse16 (let ((.cse17 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17))))) (fp ((_ extract 63 63) .cse16) ((_ extract 62 52) .cse16) ((_ extract 51 0) .cse16))))) (let ((.cse14 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse15) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 .cse15) .cse15)))) (let ((.cse13 (fp.sub roundNearestTiesToEven .cse14 .cse15))) (and (not (fp.gt .cse13 .cse1)) (not (fp.lt .cse13 .cse2)) (not (fp.leq .cse14 .cse6))))))) (fp.leq .cse12 .cse7)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse18 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse18 .cse4) (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse20 (let ((.cse21 (let ((.cse22 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))))) (fp ((_ extract 63 63) .cse21) ((_ extract 62 52) .cse21) ((_ extract 51 0) .cse21))))) (let ((.cse19 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse20) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse18 .cse20) .cse20)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse19 .cse20) .cse2)) (not (fp.geq .cse19 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.leq .cse18 .cse7))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2023-12-02 17:24:02,982 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse4 (fp.neg .cse3)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse0 .cse1) (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse6 (let ((.cse8 (let ((.cse9 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse6) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse6) .cse6)))) (let ((.cse2 (fp.sub roundNearestTiesToEven .cse5 .cse6))) (and (not (fp.gt .cse2 .cse3)) (not (fp.lt .cse2 .cse4)) (not (fp.leq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.leq .cse0 .cse10)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse11 .cse1) (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse13 (let ((.cse14 (let ((.cse15 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (let ((.cse12 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse13) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 .cse13) .cse13)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse12 .cse13) .cse4)) (not (fp.geq .cse12 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.leq .cse11 .cse10))))))) is different from false [2023-12-02 17:24:05,029 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse4 (fp.neg .cse3)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse0 .cse1) (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse6 (let ((.cse8 (let ((.cse9 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse6) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse6) .cse6)))) (let ((.cse2 (fp.sub roundNearestTiesToEven .cse5 .cse6))) (and (not (fp.gt .cse2 .cse3)) (not (fp.lt .cse2 .cse4)) (not (fp.leq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.leq .cse0 .cse10)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse11 .cse1) (exists ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse13 (let ((.cse14 (let ((.cse15 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (let ((.cse12 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse13) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 .cse13) .cse13)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse12 .cse13) .cse4)) (not (fp.geq .cse12 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.leq .cse11 .cse10))))))) is different from true [2023-12-02 17:24:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 17:24:05,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:24:25,439 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1) (and (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from false [2023-12-02 17:24:27,561 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1) (and (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from true [2023-12-02 17:25:22,748 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse4 (let ((.cse7 (let ((.cse8 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse4) .cse4)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse4))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.gt .cse1 .cse2) (fp.lt .cse1 .cse3)))))) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse6))))) (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse9 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse11) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse12 .cse11) .cse11)))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse9 .cse11))) (or (fp.geq .cse9 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse10 .cse2) (fp.lt .cse10 .cse3)))))) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse12)))))))) is different from true [2023-12-02 17:25:52,090 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse4 (let ((.cse7 (let ((.cse8 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse4) .cse4)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse4))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.gt .cse1 .cse2) (fp.lt .cse1 .cse3)))))) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse6))))) (forall ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (or (forall ((v_ArrVal_46 (_ BitVec 32))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_46) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse9 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse11) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse12 .cse11) .cse11)))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse9 .cse11))) (or (fp.geq .cse9 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse10 .cse2) (fp.lt .cse10 .cse3)))))) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse12)))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2023-12-02 17:25:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 17:25:52,092 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:25:52,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270681094] [2023-12-02 17:25:52,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270681094] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:25:52,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [31260654] [2023-12-02 17:25:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:25:52,093 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:25:52,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:25:52,094 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:25:52,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-02 17:25:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:25:55,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 17:25:55,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:27:08,956 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse1 (fp.neg .cse4)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (and (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)) (exists ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse7 (let ((.cse8 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse7)) (.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (and (not (fp.lt .cse0 .cse1)) (fp.leq .cse2 .cse3) (not (fp.gt .cse0 .cse4)) (fp.geq .cse2 .cse5) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse7) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse7) .cse7)) |c_ULTIMATE.start_inv_~xi~0#1|)))))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (and (fp.leq .cse9 .cse3) (exists ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (let ((.cse10 (let ((.cse11 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))))) (and (fp.gt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse10) .cse4) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse10) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse9 .cse10) .cse10)) |c_ULTIMATE.start_inv_~xi~0#1|)))) (fp.geq .cse9 .cse5)))) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (and (fp.leq .cse12 .cse3) (fp.geq .cse12 .cse5) (exists ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (let ((.cse13 (let ((.cse14 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (and (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse13) .cse1) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse13) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse12 .cse13) .cse13)) |c_ULTIMATE.start_inv_~xi~0#1|)))))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 17:27:33,261 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))) (.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.gt .cse0 .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) |c_ULTIMATE.start_inv_~xi~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 17:29:08,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (.cse5 (fp.neg .cse17)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (and (exists ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))) (.cse4 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse4) .cse4)))) (and (fp.geq .cse0 .cse1) (fp.geq .cse2 .cse3) (not (fp.lt (fp.sub roundNearestTiesToEven .cse2 .cse4) .cse5)) (fp.leq .cse2 .cse6) (fp.leq .cse0 .cse7))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (and (exists ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (let ((.cse11 (let ((.cse13 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse10 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse11) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 .cse11) .cse11)))) (and (not (fp.geq .cse10 .cse3)) (not (fp.lt (fp.sub roundNearestTiesToEven .cse10 .cse11) .cse5)))))) (fp.geq .cse12 .cse1) (fp.leq .cse12 .cse7)))) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse14 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (and (fp.geq .cse14 .cse1) (exists ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (let ((.cse18 (let ((.cse19 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse19) ((_ extract 62 52) .cse19) ((_ extract 51 0) .cse19))))) (let ((.cse15 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse18) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse14 .cse18) .cse18)))) (let ((.cse16 (fp.sub roundNearestTiesToEven .cse15 .cse18))) (and (not (fp.leq .cse15 .cse6)) (not (fp.lt .cse16 .cse5)) (not (fp.gt .cse16 .cse17))))))) (fp.leq .cse14 .cse7))))))))) is different from false [2023-12-02 17:29:37,615 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse2 (fp.neg .cse11)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (and (exists ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (let ((.cse1 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1)))) (and (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) .cse2)))))) (fp.geq .cse4 .cse6) (fp.leq .cse4 .cse7)))) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (and (fp.geq .cse8 .cse6) (exists ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (let ((.cse12 (let ((.cse13 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse12) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse12) .cse12)))) (let ((.cse10 (fp.sub roundNearestTiesToEven .cse9 .cse12))) (and (not (fp.leq .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (not (fp.lt .cse10 .cse2)) (not (fp.gt .cse10 .cse11))))))) (fp.leq .cse8 .cse7))))))) is different from false [2023-12-02 17:29:39,701 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse2 (fp.neg .cse11)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (and (exists ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (let ((.cse1 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1)))) (and (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) .cse2)))))) (fp.geq .cse4 .cse6) (fp.leq .cse4 .cse7)))) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (and (fp.geq .cse8 .cse6) (exists ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (let ((.cse12 (let ((.cse13 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse12) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse12) .cse12)))) (let ((.cse10 (fp.sub roundNearestTiesToEven .cse9 .cse12))) (and (not (fp.leq .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (not (fp.lt .cse10 .cse2)) (not (fp.gt .cse10 .cse11))))))) (fp.leq .cse8 .cse7))))))) is different from true [2023-12-02 17:29:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 17:29:39,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:54,044 WARN L293 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 17:30:57,025 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse2 (fp.neg .cse4)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (or (not (= |c_ULTIMATE.start_main_~a~0#1| .cse0)) (forall ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (let ((.cse5 (let ((.cse7 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse5) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse5) .cse5)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5))) (or (fp.lt .cse1 .cse2) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.gt .cse1 .cse4))))))))) (forall ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (or (not (= |c_ULTIMATE.start_main_~a~0#1| .cse8)) (forall ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (let ((.cse11 (let ((.cse12 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (let ((.cse9 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse11) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse11) .cse11)))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse9 .cse11))) (or (fp.geq .cse9 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt .cse10 .cse2) (fp.gt .cse10 .cse4)))))))))))) is different from true [2023-12-02 17:31:26,656 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse2 (fp.neg .cse4)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (forall ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (or (not (= |c_ULTIMATE.start_main_~a~0#1| .cse0)) (forall ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (let ((.cse5 (let ((.cse7 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse5) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse5) .cse5)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5))) (or (fp.lt .cse1 .cse2) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.gt .cse1 .cse4))))))))) (forall ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (or (not (= |c_ULTIMATE.start_main_~a~0#1| .cse8)) (forall ((v_ArrVal_65 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (let ((.cse11 (let ((.cse12 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd (_ bv4294966273 32) ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) v_ArrVal_65) (_ bv9218868437227405312 64)) (_ bv52 64))))))) (_ bv52 64))) v_ArrVal_67))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (let ((.cse9 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse11) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse11) .cse11)))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse9 .cse11))) (or (fp.geq .cse9 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt .cse10 .cse2) (fp.gt .cse10 .cse4)))))))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2023-12-02 17:31:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 17:31:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [31260654] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:31:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608378697] [2023-12-02 17:31:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:26,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:26,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:26,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:26,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41b20e9a-5dd0-49e7-a691-6de7cce7f440/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 17:31:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:36,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 17:31:36,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:32:51,995 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse5 (fp.neg .cse6)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (and (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)) (exists ((v_ArrVal_87 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))) (.cse7 (let ((.cse9 (let ((.cse10 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) v_ArrVal_87) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse7) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse7) .cse7)))) (let ((.cse4 (fp.sub c_currentRoundingMode .cse0 .cse7))) (and (= |c_ULTIMATE.start_inv_~xi~0#1| .cse0) (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse3) (not (fp.lt .cse4 .cse5)) (not (fp.gt .cse4 .cse6)))))))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))) (and (fp.geq .cse11 .cse2) (fp.leq .cse11 .cse3) (exists ((v_ArrVal_87 (_ BitVec 32))) (let ((.cse13 (let ((.cse14 (let ((.cse15 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) v_ArrVal_87) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (let ((.cse12 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse13) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse11 .cse13) .cse13)))) (and (= |c_ULTIMATE.start_inv_~xi~0#1| .cse12) (fp.lt (fp.sub c_currentRoundingMode .cse12 .cse13) .cse5)))))))) (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse16 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))) (and (fp.geq .cse16 .cse2) (fp.leq .cse16 .cse3) (exists ((v_ArrVal_87 (_ BitVec 32))) (let ((.cse18 (let ((.cse19 (let ((.cse20 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) v_ArrVal_87) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20))))) (fp ((_ extract 63 63) .cse19) ((_ extract 62 52) .cse19) ((_ extract 51 0) .cse19))))) (let ((.cse17 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 .cse18) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse16 .cse18) .cse18)))) (and (fp.gt (fp.sub c_currentRoundingMode .cse17 .cse18) .cse6) (= |c_ULTIMATE.start_inv_~xi~0#1| .cse17))))))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 17:33:16,852 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_87 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))) (.cse4 (let ((.cse5 (let ((.cse6 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) v_ArrVal_87) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse4)))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse0 .cse4)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (= |c_ULTIMATE.start_inv_~xi~0#1| .cse0) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.lt .cse2 (fp.neg .cse3))) (not (fp.gt .cse2 .cse3))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 17:34:22,207 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (.cse5 (fp.neg .cse11)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 20.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2) (exists ((v_ArrVal_87 (_ BitVec 32))) (let ((.cse4 (let ((.cse7 (let ((.cse8 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) v_ArrVal_87) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse4) .cse4)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse3 .cse4) .cse5)) (not (fp.geq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))))))) (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))) (and (fp.leq .cse9 .cse1) (exists ((v_ArrVal_87 (_ BitVec 32))) (let ((.cse13 (let ((.cse14 (let ((.cse15 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) v_ArrVal_87) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (let ((.cse12 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse13) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse13) .cse13)))) (let ((.cse10 (fp.sub roundNearestTiesToEven .cse12 .cse13))) (and (not (fp.gt .cse10 .cse11)) (not (fp.lt .cse10 .cse5)) (not (fp.leq .cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.geq .cse9 .cse2))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from false [2023-12-02 17:34:51,664 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (.cse5 (fp.neg .cse11)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 20.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2) (exists ((v_ArrVal_87 (_ BitVec 32))) (let ((.cse4 (let ((.cse7 (let ((.cse8 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) v_ArrVal_87) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse4) .cse4)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse3 .cse4) .cse5)) (not (fp.geq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))))))) (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))) (and (fp.leq .cse9 .cse1) (exists ((v_ArrVal_87 (_ BitVec 32))) (let ((.cse13 (let ((.cse14 (let ((.cse15 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) v_ArrVal_87) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (let ((.cse12 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse13) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse13) .cse13)))) (let ((.cse10 (fp.sub roundNearestTiesToEven .cse12 .cse13))) (and (not (fp.gt .cse10 .cse11)) (not (fp.lt .cse10 .cse5)) (not (fp.leq .cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.geq .cse9 .cse2))))))) is different from false [2023-12-02 17:34:53,723 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (.cse5 (fp.neg .cse11)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 20.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2) (exists ((v_ArrVal_87 (_ BitVec 32))) (let ((.cse4 (let ((.cse7 (let ((.cse8 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) v_ArrVal_87) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse4) .cse4)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse3 .cse4) .cse5)) (not (fp.geq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))))))) (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))) (and (fp.leq .cse9 .cse1) (exists ((v_ArrVal_87 (_ BitVec 32))) (let ((.cse13 (let ((.cse14 (let ((.cse15 (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) v_ArrVal_87) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64)))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (let ((.cse12 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse13) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse13) .cse13)))) (let ((.cse10 (fp.sub roundNearestTiesToEven .cse12 .cse13))) (and (not (fp.gt .cse10 .cse11)) (not (fp.lt .cse10 .cse5)) (not (fp.leq .cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.geq .cse9 .cse2))))))) is different from true [2023-12-02 17:34:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 17:34:53,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:35:19,175 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)) (fp.gt .cse0 .cse1) (and (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from false [2023-12-02 17:35:21,303 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)) (fp.gt .cse0 .cse1) (and (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from true