./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:00:50,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:00:50,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:00:50,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:00:50,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:00:50,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:00:50,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:00:50,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:00:50,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:00:50,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:00:50,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:00:50,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:00:50,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:00:50,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:00:50,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:00:50,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:00:50,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:00:50,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:00:50,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:00:50,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:00:50,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:00:50,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:00:50,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:00:50,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:00:50,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:00:50,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:00:50,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:00:50,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:00:50,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:00:50,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:00:50,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:00:50,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:00:50,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:00:50,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:00:50,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:00:50,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:00:50,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:00:50,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:00:50,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:00:50,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:00:50,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:00:50,928 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 02:00:50,951 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:00:50,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:00:50,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:00:50,953 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:00:50,953 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:00:50,954 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:00:50,954 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:00:50,954 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:00:50,955 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:00:50,955 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:00:50,955 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:00:50,956 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:00:50,956 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:00:50,957 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:00:50,957 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:00:50,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:00:50,958 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:00:50,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:00:50,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:00:50,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:00:50,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:00:50,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:00:50,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:00:50,960 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:00:50,960 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:00:50,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:00:50,961 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:00:50,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:00:50,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:00:50,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:00:50,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:00:50,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:00:50,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:00:50,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:00:50,963 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:00:50,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:00:50,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:00:50,963 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:00:50,963 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:00:50,964 INFO L138 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_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/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_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 [2021-11-07 02:00:51,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:00:51,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:00:51,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:00:51,240 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:00:51,241 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:00:51,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2021-11-07 02:00:51,324 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/data/7a3cf2bfd/4ac3434bf4484c0d9cd321ea709a6457/FLAGa2dc5d75d [2021-11-07 02:00:51,821 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:00:51,821 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2021-11-07 02:00:51,835 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/data/7a3cf2bfd/4ac3434bf4484c0d9cd321ea709a6457/FLAGa2dc5d75d [2021-11-07 02:00:52,189 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/data/7a3cf2bfd/4ac3434bf4484c0d9cd321ea709a6457 [2021-11-07 02:00:52,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:00:52,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:00:52,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:00:52,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:00:52,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:00:52,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:00:52" (1/1) ... [2021-11-07 02:00:52,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f8d33e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52, skipping insertion in model container [2021-11-07 02:00:52,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:00:52" (1/1) ... [2021-11-07 02:00:52,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:00:52,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:00:52,390 WARN L228 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_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2021-11-07 02:00:52,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:00:52,419 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:00:52,431 WARN L228 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_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2021-11-07 02:00:52,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:00:52,449 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:00:52,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52 WrapperNode [2021-11-07 02:00:52,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:00:52,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:00:52,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:00:52,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:00:52,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52" (1/1) ... [2021-11-07 02:00:52,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52" (1/1) ... [2021-11-07 02:00:52,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:00:52,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:00:52,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:00:52,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:00:52,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52" (1/1) ... [2021-11-07 02:00:52,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52" (1/1) ... [2021-11-07 02:00:52,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52" (1/1) ... [2021-11-07 02:00:52,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52" (1/1) ... [2021-11-07 02:00:52,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52" (1/1) ... [2021-11-07 02:00:52,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52" (1/1) ... [2021-11-07 02:00:52,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52" (1/1) ... [2021-11-07 02:00:52,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:00:52,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:00:52,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:00:52,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:00:52,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52" (1/1) ... [2021-11-07 02:00:52,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:00:52,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:00:52,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:00:52,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:00:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:00:52,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:00:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:00:52,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:00:52,839 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:00:52,840 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-11-07 02:00:52,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:00:52 BoogieIcfgContainer [2021-11-07 02:00:52,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:00:52,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:00:52,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:00:52,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:00:52,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:00:52" (1/3) ... [2021-11-07 02:00:52,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc015ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:00:52, skipping insertion in model container [2021-11-07 02:00:52,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:52" (2/3) ... [2021-11-07 02:00:52,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc015ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:00:52, skipping insertion in model container [2021-11-07 02:00:52,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:00:52" (3/3) ... [2021-11-07 02:00:52,850 INFO L111 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2021-11-07 02:00:52,855 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:00:52,856 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 02:00:52,902 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:00:52,909 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 02:00:52,909 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 02:00:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:00:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-07 02:00:52,936 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:00:52,937 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-07 02:00:52,938 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:00:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:00:52,943 INFO L85 PathProgramCache]: Analyzing trace with hash 82078274, now seen corresponding path program 1 times [2021-11-07 02:00:52,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:00:52,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387002329] [2021-11-07 02:00:52,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:00:52,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:00:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:00:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:00:53,124 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:00:53,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387002329] [2021-11-07 02:00:53,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387002329] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:00:53,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:00:53,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:00:53,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002504281] [2021-11-07 02:00:53,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 02:00:53,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:00:53,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 02:00:53,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 02:00:53,148 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:00:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:00:53,161 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-11-07 02:00:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 02:00:53,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2021-11-07 02:00:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:00:53,170 INFO L225 Difference]: With dead ends: 15 [2021-11-07 02:00:53,171 INFO L226 Difference]: Without dead ends: 7 [2021-11-07 02:00:53,173 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 02:00:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2021-11-07 02:00:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-11-07 02:00:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) [2021-11-07 02:00:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2021-11-07 02:00:53,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2021-11-07 02:00:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:00:53,202 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2021-11-07 02:00:53,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:00:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2021-11-07 02:00:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-07 02:00:53,203 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:00:53,203 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-07 02:00:53,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:00:53,204 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:00:53,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:00:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1780275126, now seen corresponding path program 1 times [2021-11-07 02:00:53,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:00:53,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81567926] [2021-11-07 02:00:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:00:53,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:00:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:00:53,238 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 02:00:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:00:53,293 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 02:00:53,294 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 02:00:53,296 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:00:53,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:00:53,302 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-07 02:00:53,305 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:00:53,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:00:53 BoogieIcfgContainer [2021-11-07 02:00:53,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:00:53,335 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:00:53,335 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:00:53,336 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:00:53,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:00:52" (3/4) ... [2021-11-07 02:00:53,340 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 02:00:53,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:00:53,343 INFO L168 Benchmark]: Toolchain (without parser) took 1148.73 ms. Allocated memory is still 113.2 MB. Free memory was 77.4 MB in the beginning and 50.2 MB in the end (delta: 27.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 16.1 GB. [2021-11-07 02:00:53,344 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 113.2 MB. Free memory was 84.6 MB in the beginning and 84.6 MB in the end (delta: 26.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:00:53,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.38 ms. Allocated memory is still 113.2 MB. Free memory was 77.2 MB in the beginning and 87.7 MB in the end (delta: -10.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 02:00:53,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.97 ms. Allocated memory is still 113.2 MB. Free memory was 87.7 MB in the beginning and 86.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:00:53,352 INFO L168 Benchmark]: Boogie Preprocessor took 21.74 ms. Allocated memory is still 113.2 MB. Free memory was 86.3 MB in the beginning and 85.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:00:53,354 INFO L168 Benchmark]: RCFGBuilder took 335.38 ms. Allocated memory is still 113.2 MB. Free memory was 85.3 MB in the beginning and 72.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 02:00:53,354 INFO L168 Benchmark]: TraceAbstraction took 490.26 ms. Allocated memory is still 113.2 MB. Free memory was 72.2 MB in the beginning and 50.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-11-07 02:00:53,355 INFO L168 Benchmark]: Witness Printer took 6.01 ms. Allocated memory is still 113.2 MB. Free memory is still 50.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:00:53,362 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 113.2 MB. Free memory was 84.6 MB in the beginning and 84.6 MB in the end (delta: 26.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 255.38 ms. Allocated memory is still 113.2 MB. Free memory was 77.2 MB in the beginning and 87.7 MB in the end (delta: -10.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 32.97 ms. Allocated memory is still 113.2 MB. Free memory was 87.7 MB in the beginning and 86.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.74 ms. Allocated memory is still 113.2 MB. Free memory was 86.3 MB in the beginning and 85.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 335.38 ms. Allocated memory is still 113.2 MB. Free memory was 85.3 MB in the beginning and 72.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 490.26 ms. Allocated memory is still 113.2 MB. Free memory was 72.2 MB in the beginning and 50.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Witness Printer took 6.01 ms. Allocated memory is still 113.2 MB. Free memory is still 50.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * 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: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 21, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryArithmeticFLOAToperation at line 31. Possible FailurePath: [L20] float x = __VERIFIER_nondet_float() ; [L11] COND FALSE !(!cond) [L11] COND FALSE !(!cond) [L23] float exp = 1.0 ; [L24] float term = 1.0 ; [L25] unsigned int count = 1 ; [L26] float result = 2*(1/(1-x)) ; [L27] int temp ; [L29] COND TRUE 1 [L31] term = term * (x/count) [L32] exp = exp + term [L33] count++ [L35] temp = __VERIFIER_nondet_int() [L36] COND TRUE temp ==0 [L13] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 9 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 2, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 4 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 [2021-11-07 02:00:53,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:00:55,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:00:55,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:00:55,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:00:55,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:00:55,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:00:55,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:00:55,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:00:55,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:00:55,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:00:55,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:00:55,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:00:55,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:00:55,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:00:55,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:00:55,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:00:55,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:00:55,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:00:55,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:00:55,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:00:55,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:00:55,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:00:55,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:00:55,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:00:55,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:00:55,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:00:55,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:00:55,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:00:55,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:00:55,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:00:55,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:00:55,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:00:55,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:00:55,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:00:55,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:00:55,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:00:55,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:00:55,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:00:55,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:00:55,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:00:55,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:00:55,910 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-07 02:00:55,951 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:00:55,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:00:55,953 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:00:55,953 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:00:55,954 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:00:55,954 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:00:55,954 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:00:55,954 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:00:55,954 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:00:55,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:00:55,957 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:00:55,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:00:55,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:00:55,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:00:55,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:00:55,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:00:55,959 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:00:55,959 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 02:00:55,959 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 02:00:55,959 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:00:55,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:00:55,960 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:00:55,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:00:55,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:00:55,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 02:00:55,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:00:55,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:00:55,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:00:55,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:00:55,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:00:55,962 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-07 02:00:55,962 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 02:00:55,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:00:55,963 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:00:55,963 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:00:55,963 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/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_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 [2021-11-07 02:00:56,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:00:56,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:00:56,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:00:56,323 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:00:56,328 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:00:56,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2021-11-07 02:00:56,404 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/data/37993156f/8b813108d608407899c683bf9185df05/FLAG79e14b1bd [2021-11-07 02:00:56,961 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:00:56,962 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2021-11-07 02:00:56,969 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/data/37993156f/8b813108d608407899c683bf9185df05/FLAG79e14b1bd [2021-11-07 02:00:57,407 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/data/37993156f/8b813108d608407899c683bf9185df05 [2021-11-07 02:00:57,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:00:57,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:00:57,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:00:57,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:00:57,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:00:57,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:00:57" (1/1) ... [2021-11-07 02:00:57,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b73d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57, skipping insertion in model container [2021-11-07 02:00:57,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:00:57" (1/1) ... [2021-11-07 02:00:57,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:00:57,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:00:57,629 WARN L228 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_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2021-11-07 02:00:57,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:00:57,655 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:00:57,667 WARN L228 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_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2021-11-07 02:00:57,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:00:57,703 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:00:57,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57 WrapperNode [2021-11-07 02:00:57,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:00:57,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:00:57,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:00:57,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:00:57,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57" (1/1) ... [2021-11-07 02:00:57,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57" (1/1) ... [2021-11-07 02:00:57,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:00:57,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:00:57,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:00:57,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:00:57,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57" (1/1) ... [2021-11-07 02:00:57,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57" (1/1) ... [2021-11-07 02:00:57,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57" (1/1) ... [2021-11-07 02:00:57,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57" (1/1) ... [2021-11-07 02:00:57,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57" (1/1) ... [2021-11-07 02:00:57,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57" (1/1) ... [2021-11-07 02:00:57,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57" (1/1) ... [2021-11-07 02:00:57,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:00:57,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:00:57,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:00:57,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:00:57,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57" (1/1) ... [2021-11-07 02:00:57,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:00:57,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:00:57,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:00:57,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:00:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 02:00:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:00:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:00:57,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:01:02,128 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:01:02,128 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-11-07 02:01:02,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:01:02 BoogieIcfgContainer [2021-11-07 02:01:02,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:01:02,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:01:02,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:01:02,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:01:02,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:00:57" (1/3) ... [2021-11-07 02:01:02,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0a8529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:01:02, skipping insertion in model container [2021-11-07 02:01:02,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:00:57" (2/3) ... [2021-11-07 02:01:02,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0a8529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:01:02, skipping insertion in model container [2021-11-07 02:01:02,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:01:02" (3/3) ... [2021-11-07 02:01:02,139 INFO L111 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2021-11-07 02:01:02,144 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:01:02,145 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 02:01:02,192 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:01:02,199 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 02:01:02,199 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 02:01:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:01:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 02:01:02,218 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:02,219 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:02,219 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:01:02,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1235864049, now seen corresponding path program 1 times [2021-11-07 02:01:02,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:01:02,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212398596] [2021-11-07 02:01:02,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:02,256 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:01:02,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:01:02,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:01:02,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 02:01:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:02,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-07 02:01:02,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:02,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:01:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:02,732 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:01:02,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212398596] [2021-11-07 02:01:02,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212398596] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:01:02,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:01:02,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-07 02:01:02,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133705573] [2021-11-07 02:01:02,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 02:01:02,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:01:02,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 02:01:02,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 02:01:02,756 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:01:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:02,770 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-11-07 02:01:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 02:01:02,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 02:01:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:02,779 INFO L225 Difference]: With dead ends: 29 [2021-11-07 02:01:02,780 INFO L226 Difference]: Without dead ends: 12 [2021-11-07 02:01:02,782 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 02:01:02,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-07 02:01:02,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-07 02:01:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:01:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2021-11-07 02:01:02,812 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2021-11-07 02:01:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:02,812 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2021-11-07 02:01:02,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:01:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2021-11-07 02:01:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:01:02,813 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:02,814 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:02,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-07 02:01:03,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:01:03,030 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:01:03,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1503627718, now seen corresponding path program 1 times [2021-11-07 02:01:03,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:01:03,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749474368] [2021-11-07 02:01:03,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:03,033 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:01:03,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:01:03,044 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:01:03,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 02:01:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:04,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-07 02:01:04,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:34,355 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (and (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= .cse1 c_ULTIMATE.start_main_~exp~0) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.gt .cse2 (fp.neg .cse3)) (fp.lt .cse2 .cse3) (= c_ULTIMATE.start_main_~term~0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-07 02:01:53,246 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0))))) (fp.gt .cse0 (fp.neg .cse1)) (= (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) c_ULTIMATE.start_main_~exp~0)))) is different from false [2021-11-07 02:01:55,285 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0))))) (fp.gt .cse0 (fp.neg .cse1)) (= (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) c_ULTIMATE.start_main_~exp~0)))) is different from true [2021-11-07 02:02:58,939 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse3))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))) (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.lt .cse4 .cse3) (fp.gt .cse4 (fp.neg .cse3))))) is different from false [2021-11-07 02:03:00,983 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse3))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))) (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.lt .cse4 .cse3) (fp.gt .cse4 (fp.neg .cse3))))) is different from true [2021-11-07 02:03:17,631 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))))) (fp.gt .cse0 (fp.neg .cse1))))) is different from false [2021-11-07 02:03:19,673 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))))) (fp.gt .cse0 (fp.neg .cse1))))) is different from true [2021-11-07 02:03:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:03:19,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:03:26,572 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) is different from false [2021-11-07 02:03:28,631 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) is different from true [2021-11-07 02:03:34,814 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) is different from false [2021-11-07 02:03:36,870 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) is different from true [2021-11-07 02:03:47,276 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) is different from false [2021-11-07 02:03:49,328 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) is different from true [2021-11-07 02:03:59,785 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))))) is different from false [2021-11-07 02:04:01,846 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))))) is different from true [2021-11-07 02:04:16,488 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from false [2021-11-07 02:04:18,555 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from true [2021-11-07 02:04:33,289 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_7)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))))) is different from false [2021-11-07 02:04:35,354 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_7)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))))) is different from true [2021-11-07 02:04:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:04:35,355 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:04:35,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749474368] [2021-11-07 02:04:35,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749474368] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:04:35,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:04:35,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-07 02:04:35,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001138887] [2021-11-07 02:04:35,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-07 02:04:35,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:04:35,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-07 02:04:35,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=52, Unknown=19, NotChecked=230, Total=342 [2021-11-07 02:04:35,361 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:04:37,787 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_7)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 02:04:39,849 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_7)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 02:04:41,913 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) .cse4) (let ((.cse5 (fp.gt .cse0 (fp.neg .cse1)))) (or (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5) (and (not .cse5) .cse4))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-07 02:04:43,979 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) .cse4) (let ((.cse5 (fp.gt .cse0 (fp.neg .cse1)))) (or (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5) (and (not .cse5) .cse4))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-07 02:04:46,044 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))))) is different from false [2021-11-07 02:04:48,117 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))))) is different from true [2021-11-07 02:04:50,187 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) .cse3) (fp.gt .cse4 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.lt .cse4 .cse2))) (or (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5) (and (not .cse5) .cse3))))) is different from false [2021-11-07 02:04:52,257 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) .cse3) (fp.gt .cse4 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.lt .cse4 .cse2))) (or (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5) (and (not .cse5) .cse3))))) is different from true [2021-11-07 02:04:54,339 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (fp.gt .cse3 (fp.neg .cse2)) (fp.lt .cse3 .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-07 02:04:56,398 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (fp.gt .cse3 (fp.neg .cse2)) (fp.lt .cse3 .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-07 02:04:58,466 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (and (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= .cse1 c_ULTIMATE.start_main_~exp~0) (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.gt .cse2 (fp.neg .cse3)) (fp.lt .cse2 .cse3) (= c_ULTIMATE.start_main_~term~0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-07 02:05:00,535 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (and (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= .cse1 c_ULTIMATE.start_main_~exp~0) (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.gt .cse2 (fp.neg .cse3)) (fp.lt .cse2 .cse3) (= c_ULTIMATE.start_main_~term~0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-07 02:05:02,608 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0))))) (fp.gt .cse0 (fp.neg .cse1)) (= (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) c_ULTIMATE.start_main_~exp~0)))) (fp.geq c_ULTIMATE.start_main_~result~0 c_ULTIMATE.start_main_~exp~0)) is different from false [2021-11-07 02:05:04,684 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse3))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))) (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.lt .cse4 .cse3) (fp.gt .cse4 (fp.neg .cse3)))))) is different from false [2021-11-07 02:05:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:10,934 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2021-11-07 02:05:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 02:05:10,948 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:05:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:10,948 INFO L225 Difference]: With dead ends: 18 [2021-11-07 02:05:10,949 INFO L226 Difference]: Without dead ends: 14 [2021-11-07 02:05:10,950 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 72.5s TimeCoverageRelationStatistics Valid=57, Invalid=54, Unknown=33, NotChecked=558, Total=702 [2021-11-07 02:05:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-07 02:05:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-07 02:05:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-11-07 02:05:10,954 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2021-11-07 02:05:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:10,954 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-11-07 02:05:10,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-11-07 02:05:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 02:05:10,957 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:10,958 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:05:10,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 02:05:11,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:05:11,170 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:05:11,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1828550667, now seen corresponding path program 1 times [2021-11-07 02:05:11,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:05:11,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266406047] [2021-11-07 02:05:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:11,172 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:05:11,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:05:11,174 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:05:11,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 02:05:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:16,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-07 02:05:16,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:06:19,210 WARN L207 SmtUtils]: Spent 23.24 s on a formula simplification that was a NOOP. DAG size: 27 [2021-11-07 02:07:24,996 WARN L207 SmtUtils]: Spent 30.86 s on a formula simplification that was a NOOP. DAG size: 33 [2021-11-07 02:08:10,238 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (= (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))) c_ULTIMATE.start_main_~exp~0) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 ULTIMATE.start_main_~x~0))))) (fp.gt .cse0 (fp.neg .cse1))))) is different from false [2021-11-07 02:08:12,297 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (= (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))) c_ULTIMATE.start_main_~exp~0) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 ULTIMATE.start_main_~x~0))))) (fp.gt .cse0 (fp.neg .cse1))))) is different from true [2021-11-07 02:09:23,146 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0))) (fp.lt .cse5 .cse4) (fp.gt .cse5 (fp.neg .cse4))))) is different from false [2021-11-07 02:09:25,210 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0))) (fp.lt .cse5 .cse4) (fp.gt .cse5 (fp.neg .cse4))))) is different from true [2021-11-07 02:09:42,126 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))))))) is different from false [2021-11-07 02:09:44,188 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))))))) is different from true [2021-11-07 02:09:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-07 02:09:44,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:09:58,123 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) is different from false [2021-11-07 02:10:00,184 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) is different from true [2021-11-07 02:10:10,659 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0))))))) is different from false [2021-11-07 02:10:12,775 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) c_ULTIMATE.start_main_~count~0))))))) is different from true [2021-11-07 02:10:18,989 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) is different from false [2021-11-07 02:10:21,066 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) is different from true [2021-11-07 02:10:31,577 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) is different from false [2021-11-07 02:10:33,657 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) is different from true [2021-11-07 02:10:44,174 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))))) is different from false [2021-11-07 02:10:46,251 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))))) is different from true [2021-11-07 02:11:01,044 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from false [2021-11-07 02:11:16,673 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_8 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~x~0_8)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.lt .cse4 .cse3)) (not (fp.gt .cse4 (fp.neg .cse3)))))) is different from false [2021-11-07 02:11:18,747 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_8 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~x~0_8)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.lt .cse4 .cse3)) (not (fp.gt .cse4 (fp.neg .cse3)))))) is different from true [2021-11-07 02:11:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-07 02:11:18,747 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:11:18,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266406047] [2021-11-07 02:11:18,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266406047] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:11:18,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1036564046] [2021-11-07 02:11:18,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:11:18,749 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-07 02:11:18,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/cvc4 [2021-11-07 02:11:18,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-07 02:11:18,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44ea314d-ca3f-48f6-9bff-2c116d1ef45a/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2021-11-07 02:11:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:11:21,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-07 02:11:21,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:12:14,438 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0))) (and (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (= (fp.add c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))) (fp.gt .cse2 (fp.neg .cse3)) (fp.lt .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-07 02:14:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-07 02:14:28,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:15:29,740 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet7_6| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_#t~nondet7_6|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~nondet7_6|)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_#t~nondet7_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_#t~nondet7_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) is different from false