./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9 --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 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 19:43:52,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 19:43:52,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 19:43:52,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 19:43:52,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 19:43:52,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 19:43:52,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 19:43:52,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 19:43:52,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 19:43:52,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 19:43:52,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 19:43:52,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 19:43:52,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 19:43:52,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 19:43:52,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 19:43:52,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 19:43:52,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 19:43:52,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 19:43:52,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 19:43:52,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 19:43:52,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 19:43:52,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 19:43:52,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 19:43:52,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 19:43:52,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 19:43:52,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 19:43:52,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 19:43:52,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 19:43:52,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 19:43:52,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 19:43:52,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 19:43:52,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 19:43:52,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 19:43:52,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 19:43:52,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 19:43:52,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 19:43:52,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 19:43:52,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 19:43:52,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 19:43:52,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 19:43:52,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 19:43:52,264 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 19:43:52,302 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 19:43:52,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 19:43:52,303 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 19:43:52,303 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 19:43:52,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 19:43:52,305 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 19:43:52,305 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 19:43:52,306 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 19:43:52,306 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 19:43:52,306 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 19:43:52,307 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 19:43:52,307 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 19:43:52,308 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 19:43:52,308 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 19:43:52,308 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 19:43:52,308 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 19:43:52,308 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 19:43:52,309 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 19:43:52,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 19:43:52,310 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 19:43:52,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 19:43:52,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 19:43:52,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 19:43:52,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 19:43:52,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 19:43:52,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 19:43:52,312 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 19:43:52,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 19:43:52,312 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 19:43:52,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 19:43:52,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 19:43:52,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 19:43:52,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:43:52,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 19:43:52,314 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 19:43:52,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 19:43:52,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 19:43:52,314 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 19:43:52,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 19:43:52,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 19:43:52,315 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 19:43:52,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/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_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9 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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2022-11-20 19:43:52,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 19:43:52,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 19:43:52,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 19:43:52,687 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 19:43:52,688 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 19:43:52,689 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2022-11-20 19:43:55,825 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 19:43:55,995 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 19:43:55,996 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/sv-benchmarks/c/float-benchs/zonotope_2.c [2022-11-20 19:43:56,002 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/data/6b9b51b7f/0796fd76956b43bbb2d7914838d9aeb3/FLAG00c724c30 [2022-11-20 19:43:56,015 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/data/6b9b51b7f/0796fd76956b43bbb2d7914838d9aeb3 [2022-11-20 19:43:56,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 19:43:56,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 19:43:56,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 19:43:56,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 19:43:56,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 19:43:56,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65ab7742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56, skipping insertion in model container [2022-11-20 19:43:56,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 19:43:56,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 19:43:56,214 WARN L237 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_95f85680-4f41-4ae8-b48d-a0267a47bdf6/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-11-20 19:43:56,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:43:56,240 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 19:43:56,252 WARN L237 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_95f85680-4f41-4ae8-b48d-a0267a47bdf6/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-11-20 19:43:56,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:43:56,269 INFO L208 MainTranslator]: Completed translation [2022-11-20 19:43:56,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56 WrapperNode [2022-11-20 19:43:56,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 19:43:56,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 19:43:56,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 19:43:56,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 19:43:56,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,303 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-11-20 19:43:56,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 19:43:56,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 19:43:56,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 19:43:56,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 19:43:56,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,325 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 19:43:56,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 19:43:56,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 19:43:56,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 19:43:56,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56" (1/1) ... [2022-11-20 19:43:56,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:43:56,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:43:56,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 19:43:56,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 19:43:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 19:43:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 19:43:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 19:43:56,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 19:43:56,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 19:43:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 19:43:56,492 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 19:43:56,494 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 19:43:56,656 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 19:43:56,695 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 19:43:56,695 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 19:43:56,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:43:56 BoogieIcfgContainer [2022-11-20 19:43:56,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 19:43:56,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 19:43:56,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 19:43:56,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 19:43:56,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:43:56" (1/3) ... [2022-11-20 19:43:56,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285e09e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:43:56, skipping insertion in model container [2022-11-20 19:43:56,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:56" (2/3) ... [2022-11-20 19:43:56,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285e09e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:43:56, skipping insertion in model container [2022-11-20 19:43:56,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:43:56" (3/3) ... [2022-11-20 19:43:56,712 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2022-11-20 19:43:56,735 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 19:43:56,735 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 19:43:56,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 19:43:56,816 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4a2fa513, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 19:43:56,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 19:43:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 19:43:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 19:43:56,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:43:56,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 19:43:56,831 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:43:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:43:56,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2071569913, now seen corresponding path program 1 times [2022-11-20 19:43:56,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:43:56,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771278352] [2022-11-20 19:43:56,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:56,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:43:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 19:43:56,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 19:43:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 19:43:57,051 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-20 19:43:57,053 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 19:43:57,055 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 19:43:57,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 19:43:57,062 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-20 19:43:57,067 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 19:43:57,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:43:57 BoogieIcfgContainer [2022-11-20 19:43:57,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 19:43:57,092 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 19:43:57,092 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 19:43:57,093 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 19:43:57,093 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:43:56" (3/4) ... [2022-11-20 19:43:57,097 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 19:43:57,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 19:43:57,099 INFO L158 Benchmark]: Toolchain (without parser) took 1078.40ms. Allocated memory is still 159.4MB. Free memory was 124.3MB in the beginning and 96.5MB in the end (delta: 27.8MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2022-11-20 19:43:57,099 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 19:43:57,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.42ms. Allocated memory is still 159.4MB. Free memory was 123.6MB in the beginning and 124.4MB in the end (delta: -740.5kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 19:43:57,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.19ms. Allocated memory is still 159.4MB. Free memory was 124.4MB in the beginning and 123.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 19:43:57,101 INFO L158 Benchmark]: Boogie Preprocessor took 23.11ms. Allocated memory is still 159.4MB. Free memory was 123.0MB in the beginning and 121.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 19:43:57,107 INFO L158 Benchmark]: RCFGBuilder took 370.54ms. Allocated memory is still 159.4MB. Free memory was 121.3MB in the beginning and 111.1MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 19:43:57,108 INFO L158 Benchmark]: TraceAbstraction took 388.04ms. Allocated memory is still 159.4MB. Free memory was 110.5MB in the beginning and 96.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 19:43:57,110 INFO L158 Benchmark]: Witness Printer took 5.00ms. Allocated memory is still 159.4MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 19:43:57,114 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.19ms. Allocated memory is still 117.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.42ms. Allocated memory is still 159.4MB. Free memory was 123.6MB in the beginning and 124.4MB in the end (delta: -740.5kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.19ms. Allocated memory is still 159.4MB. Free memory was 124.4MB in the beginning and 123.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.11ms. Allocated memory is still 159.4MB. Free memory was 123.0MB in the beginning and 121.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 370.54ms. Allocated memory is still 159.4MB. Free memory was 121.3MB in the beginning and 111.1MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 388.04ms. Allocated memory is still 159.4MB. Free memory was 110.5MB in the beginning and 96.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 5.00ms. Allocated memory is still 159.4MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 10]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 25, overapproximation of someBinaryArithmeticFLOAToperation at line 22. Possible FailurePath: [L14] float x = 12.f; [L15] float x1 = 12.f; [L16] float y = 16.f; [L17] float y1 = 16.f; [L18] int i; [L19] i = 0 VAL [i=0, x=12, x1=12, y=16, y1=16] [L19] COND TRUE i < 100000 [L20] x = x1 [L21] y = y1 [L22] x1 = 3.f * x / 4.f + y / 4.f [L23] y1 = x / 4.f + 3.f * y / 4.f VAL [i=0, x=12, y=16] [L25] CALL __VERIFIER_assert(x1 >= 0.f && x1 <= 100.f) VAL [\old(cond)=0] [L10] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L10] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 19:43:57,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9 --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 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 19:43:59,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 19:43:59,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 19:43:59,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 19:43:59,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 19:43:59,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 19:43:59,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 19:43:59,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 19:43:59,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 19:43:59,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 19:43:59,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 19:43:59,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 19:43:59,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 19:43:59,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 19:43:59,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 19:43:59,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 19:43:59,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 19:43:59,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 19:43:59,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 19:43:59,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 19:43:59,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 19:43:59,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 19:43:59,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 19:43:59,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 19:43:59,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 19:43:59,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 19:43:59,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 19:43:59,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 19:43:59,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 19:43:59,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 19:43:59,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 19:43:59,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 19:43:59,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 19:43:59,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 19:43:59,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 19:43:59,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 19:43:59,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 19:43:59,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 19:43:59,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 19:43:59,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 19:43:59,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 19:43:59,814 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-20 19:43:59,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 19:43:59,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 19:43:59,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 19:43:59,857 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 19:43:59,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 19:43:59,858 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 19:43:59,858 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 19:43:59,858 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 19:43:59,858 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 19:43:59,859 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 19:43:59,860 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 19:43:59,860 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 19:43:59,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 19:43:59,861 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 19:43:59,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 19:43:59,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 19:43:59,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 19:43:59,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 19:43:59,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 19:43:59,862 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 19:43:59,862 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 19:43:59,863 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 19:43:59,863 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 19:43:59,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 19:43:59,863 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 19:43:59,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 19:43:59,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 19:43:59,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 19:43:59,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 19:43:59,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:43:59,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 19:43:59,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 19:43:59,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 19:43:59,865 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-20 19:43:59,866 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 19:43:59,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 19:43:59,866 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 19:43:59,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 19:43:59,866 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_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/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_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9 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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2022-11-20 19:44:00,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 19:44:00,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 19:44:00,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 19:44:00,263 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 19:44:00,264 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 19:44:00,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2022-11-20 19:44:03,537 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 19:44:03,712 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 19:44:03,712 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/sv-benchmarks/c/float-benchs/zonotope_2.c [2022-11-20 19:44:03,719 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/data/0cf387be9/709fcf707afc413a99225b8ff5bce2b4/FLAGf108817ac [2022-11-20 19:44:03,738 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/data/0cf387be9/709fcf707afc413a99225b8ff5bce2b4 [2022-11-20 19:44:03,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 19:44:03,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 19:44:03,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 19:44:03,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 19:44:03,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 19:44:03,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:44:03" (1/1) ... [2022-11-20 19:44:03,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3094bdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:03, skipping insertion in model container [2022-11-20 19:44:03,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:44:03" (1/1) ... [2022-11-20 19:44:03,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 19:44:03,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 19:44:03,929 WARN L237 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_95f85680-4f41-4ae8-b48d-a0267a47bdf6/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-11-20 19:44:03,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:44:03,961 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 19:44:03,973 WARN L237 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_95f85680-4f41-4ae8-b48d-a0267a47bdf6/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-11-20 19:44:03,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:44:04,007 INFO L208 MainTranslator]: Completed translation [2022-11-20 19:44:04,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04 WrapperNode [2022-11-20 19:44:04,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 19:44:04,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 19:44:04,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 19:44:04,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 19:44:04,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04" (1/1) ... [2022-11-20 19:44:04,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04" (1/1) ... [2022-11-20 19:44:04,057 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2022-11-20 19:44:04,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 19:44:04,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 19:44:04,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 19:44:04,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 19:44:04,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04" (1/1) ... [2022-11-20 19:44:04,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04" (1/1) ... [2022-11-20 19:44:04,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04" (1/1) ... [2022-11-20 19:44:04,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04" (1/1) ... [2022-11-20 19:44:04,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04" (1/1) ... [2022-11-20 19:44:04,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04" (1/1) ... [2022-11-20 19:44:04,101 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04" (1/1) ... [2022-11-20 19:44:04,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04" (1/1) ... [2022-11-20 19:44:04,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 19:44:04,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 19:44:04,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 19:44:04,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 19:44:04,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04" (1/1) ... [2022-11-20 19:44:04,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:44:04,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:44:04,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 19:44:04,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 19:44:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 19:44:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 19:44:04,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 19:44:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 19:44:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 19:44:04,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 19:44:04,285 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 19:44:04,288 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 19:44:06,551 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 19:44:06,557 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 19:44:06,558 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 19:44:06,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:44:06 BoogieIcfgContainer [2022-11-20 19:44:06,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 19:44:06,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 19:44:06,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 19:44:06,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 19:44:06,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:44:03" (1/3) ... [2022-11-20 19:44:06,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcbce37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:44:06, skipping insertion in model container [2022-11-20 19:44:06,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:04" (2/3) ... [2022-11-20 19:44:06,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcbce37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:44:06, skipping insertion in model container [2022-11-20 19:44:06,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:44:06" (3/3) ... [2022-11-20 19:44:06,576 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2022-11-20 19:44:06,597 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 19:44:06,597 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 19:44:06,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 19:44:06,662 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@271dad79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 19:44:06,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 19:44:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 19:44:06,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 19:44:06,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:44:06,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:44:06,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:44:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:44:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2022-11-20 19:44:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 19:44:06,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438547443] [2022-11-20 19:44:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:44:06,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 19:44:06,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 19:44:06,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 19:44:06,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 19:44:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:44:06,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 19:44:06,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:44:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:44:06,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 19:44:06,851 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 19:44:06,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438547443] [2022-11-20 19:44:06,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438547443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:44:06,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:44:06,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 19:44:06,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392407388] [2022-11-20 19:44:06,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:44:06,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 19:44:06,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 19:44:06,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 19:44:06,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 19:44:06,891 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:44:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:44:06,912 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-11-20 19:44:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 19:44:06,914 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 19:44:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:44:06,922 INFO L225 Difference]: With dead ends: 32 [2022-11-20 19:44:06,923 INFO L226 Difference]: Without dead ends: 13 [2022-11-20 19:44:06,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 19:44:06,929 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 19:44:06,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 19:44:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-20 19:44:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-20 19:44:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 19:44:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-11-20 19:44:06,979 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-11-20 19:44:06,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:44:06,979 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-11-20 19:44:06,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:44:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-11-20 19:44:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 19:44:06,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:44:06,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:44:07,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-20 19:44:07,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 19:44:07,205 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:44:07,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:44:07,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2022-11-20 19:44:07,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 19:44:07,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587771084] [2022-11-20 19:44:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:44:07,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 19:44:07,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 19:44:07,208 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 19:44:07,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 19:44:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:44:07,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 19:44:07,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:44:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:44:07,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 19:44:07,346 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 19:44:07,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587771084] [2022-11-20 19:44:07,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587771084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:44:07,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:44:07,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:44:07,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285569502] [2022-11-20 19:44:07,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:44:07,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 19:44:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 19:44:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 19:44:07,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:44:07,350 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:44:09,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 19:44:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:44:09,511 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-11-20 19:44:09,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 19:44:09,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 19:44:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:44:09,513 INFO L225 Difference]: With dead ends: 21 [2022-11-20 19:44:09,513 INFO L226 Difference]: Without dead ends: 14 [2022-11-20 19:44:09,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:44:09,515 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:44:09,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-11-20 19:44:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-20 19:44:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-20 19:44:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 19:44:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-11-20 19:44:09,521 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2022-11-20 19:44:09,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:44:09,521 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-20 19:44:09,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:44:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-11-20 19:44:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 19:44:09,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:44:09,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:44:09,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 19:44:09,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 19:44:09,723 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:44:09,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:44:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2022-11-20 19:44:09,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 19:44:09,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685172372] [2022-11-20 19:44:09,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:44:09,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 19:44:09,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 19:44:09,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 19:44:09,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 19:44:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:44:09,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 19:44:09,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:44:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:44:10,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 19:44:10,985 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 19:44:10,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685172372] [2022-11-20 19:44:10,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685172372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:44:10,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:44:10,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 19:44:10,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449935133] [2022-11-20 19:44:10,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:44:10,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 19:44:10,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 19:44:10,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 19:44:10,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 19:44:10,987 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:44:13,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 19:44:16,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 19:44:18,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 19:44:20,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 19:44:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:44:20,284 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-11-20 19:44:20,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 19:44:20,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 19:44:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:44:20,321 INFO L225 Difference]: With dead ends: 31 [2022-11-20 19:44:20,322 INFO L226 Difference]: Without dead ends: 29 [2022-11-20 19:44:20,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-20 19:44:20,324 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:44:20,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 48 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 9.2s Time] [2022-11-20 19:44:20,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-20 19:44:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-20 19:44:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 19:44:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-20 19:44:20,335 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 7 [2022-11-20 19:44:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:44:20,335 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-20 19:44:20,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:44:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-20 19:44:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 19:44:20,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:44:20,337 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:44:20,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-20 19:44:20,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 19:44:20,553 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:44:20,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:44:20,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1269539930, now seen corresponding path program 1 times [2022-11-20 19:44:20,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 19:44:20,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518440804] [2022-11-20 19:44:20,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:44:20,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 19:44:20,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 19:44:20,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 19:44:20,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 19:44:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:44:20,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 19:44:20,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:44:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:44:21,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:44:31,904 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-11-20 19:44:33,924 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-11-20 19:44:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:44:33,946 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 19:44:33,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518440804] [2022-11-20 19:44:33,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518440804] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 19:44:33,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 19:44:33,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-11-20 19:44:33,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324575075] [2022-11-20 19:44:33,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:44:33,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 19:44:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 19:44:33,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 19:44:33,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=67, Unknown=2, NotChecked=16, Total=110 [2022-11-20 19:44:33,948 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 19:44:35,984 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq .cse0 .cse1) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1))) is different from false [2022-11-20 19:44:38,007 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq .cse0 .cse1) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1))) is different from true [2022-11-20 19:44:40,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 19:44:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:44:40,338 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-11-20 19:44:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 19:44:40,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-20 19:44:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:44:40,340 INFO L225 Difference]: With dead ends: 33 [2022-11-20 19:44:40,340 INFO L226 Difference]: Without dead ends: 29 [2022-11-20 19:44:40,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2022-11-20 19:44:40,342 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-20 19:44:40,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 46 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 1 Unknown, 23 Unchecked, 2.3s Time] [2022-11-20 19:44:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-20 19:44:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-20 19:44:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 19:44:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-20 19:44:40,357 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2022-11-20 19:44:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:44:40,358 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-20 19:44:40,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 19:44:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-20 19:44:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 19:44:40,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:44:40,362 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:44:40,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-20 19:44:40,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 19:44:40,579 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:44:40,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:44:40,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1102679400, now seen corresponding path program 1 times [2022-11-20 19:44:40,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 19:44:40,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010548950] [2022-11-20 19:44:40,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:44:40,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 19:44:40,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 19:44:40,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 19:44:40,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-20 19:44:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:44:40,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 19:44:40,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:44:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:44:40,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:44:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:44:41,042 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 19:44:41,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010548950] [2022-11-20 19:44:41,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010548950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:44:41,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [645869341] [2022-11-20 19:44:41,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:44:41,043 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 19:44:41,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 19:44:41,045 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 19:44:41,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-20 19:44:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:44:41,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 19:44:41,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:44:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:44:41,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:44:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:44:41,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [645869341] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:44:41,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654640458] [2022-11-20 19:44:41,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:44:41,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:44:41,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:44:41,498 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:44:41,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 19:44:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:44:41,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 19:44:41,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:44:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:44:41,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:44:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:44:41,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654640458] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:44:41,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-20 19:44:41,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2022-11-20 19:44:41,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248673016] [2022-11-20 19:44:41,848 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-20 19:44:41,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 19:44:41,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 19:44:41,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 19:44:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:44:41,850 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 19:44:43,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 19:44:46,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 19:44:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:44:46,202 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-11-20 19:44:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 19:44:46,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2022-11-20 19:44:46,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:44:46,206 INFO L225 Difference]: With dead ends: 40 [2022-11-20 19:44:46,206 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 19:44:46,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:44:46,208 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-20 19:44:46,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-11-20 19:44:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 19:44:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 19:44:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 19:44:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-20 19:44:46,224 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2022-11-20 19:44:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:44:46,225 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-20 19:44:46,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 19:44:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-20 19:44:46,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 19:44:46,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:44:46,228 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:44:46,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-20 19:44:46,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 19:44:46,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-20 19:44:46,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 19:44:46,833 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:44:46,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:44:46,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1100951522, now seen corresponding path program 1 times [2022-11-20 19:44:46,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 19:44:46,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112844528] [2022-11-20 19:44:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:44:46,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 19:44:46,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 19:44:46,835 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 19:44:46,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-20 19:44:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:44:47,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 19:44:47,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:44:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:44:53,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:45:03,654 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2022-11-20 19:45:05,678 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2022-11-20 19:45:39,203 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-11-20 19:45:41,272 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-11-20 19:45:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-11-20 19:45:41,312 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 19:45:41,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112844528] [2022-11-20 19:45:41,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112844528] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:45:41,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [273569088] [2022-11-20 19:45:41,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:41,313 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 19:45:41,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 19:45:41,314 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 19:45:41,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-11-20 19:45:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:42,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 19:45:42,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:45:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:45:42,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:46:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-11-20 19:46:22,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [273569088] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:46:22,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38944821] [2022-11-20 19:46:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:46:22,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:46:22,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:46:22,850 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:46:22,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 19:46:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:46:31,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 19:46:31,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:46:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:46:31,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:47:04,647 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse0))) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))))) is different from false [2022-11-20 19:47:06,673 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse0))) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))))) is different from true [2022-11-20 19:47:33,180 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) is different from true [2022-11-20 19:48:07,119 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) (= (_ bv0 32) c___VERIFIER_assert_~cond)) is different from false [2022-11-20 19:48:09,213 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) (= (_ bv0 32) c___VERIFIER_assert_~cond)) is different from true [2022-11-20 19:48:31,937 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))) (fp.leq (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) .cse0))) is different from false [2022-11-20 19:48:33,962 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))) (fp.leq (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) .cse0))) is different from true [2022-11-20 19:50:52,149 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-20 19:51:48,094 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-20 19:52:50,186 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-11-20 19:52:52,279 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-20 19:53:15,583 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) (.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2)) .cse4) (not (fp.leq .cse3 .cse4)) (not (fp.leq .cse1 .cse4)) (not (fp.geq .cse3 (_ +zero 8 24))) (not (fp.geq .cse1 (_ +zero 8 24)))))) is different from false [2022-11-20 19:53:17,649 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) (.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2)) .cse4) (not (fp.leq .cse3 .cse4)) (not (fp.leq .cse1 .cse4)) (not (fp.geq .cse3 (_ +zero 8 24))) (not (fp.geq .cse1 (_ +zero 8 24)))))) is different from true [2022-11-20 19:53:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2022-11-20 19:53:17,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38944821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:53:17,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-20 19:53:17,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 9, 14] total 23 [2022-11-20 19:53:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612069244] [2022-11-20 19:53:17,669 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-20 19:53:17,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 19:53:17,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 19:53:17,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 19:53:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=123, Unknown=19, NotChecked=310, Total=506 [2022-11-20 19:53:17,672 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 23 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 19:53:19,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 19:53:21,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 19:53:23,869 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~x1~0#1|) .cse6) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse6))) (.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~y1~0#1|) .cse6)))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) .cse6) (fp.div c_currentRoundingMode .cse2 .cse6))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (let ((.cse0 (fp.leq .cse1 .cse3))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse0 (fp.geq .cse1 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (or .cse0 (not (fp.leq .cse2 .cse3)) (not (fp.leq .cse4 .cse3)) (not (fp.geq .cse2 (_ +zero 8 24))) (not (fp.geq .cse4 (_ +zero 8 24)))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from false [2022-11-20 19:53:25,936 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~x1~0#1|) .cse6) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse6))) (.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~y1~0#1|) .cse6)))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) .cse6) (fp.div c_currentRoundingMode .cse2 .cse6))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (let ((.cse0 (fp.leq .cse1 .cse3))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse0 (fp.geq .cse1 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (or .cse0 (not (fp.leq .cse2 .cse3)) (not (fp.leq .cse4 .cse3)) (not (fp.geq .cse2 (_ +zero 8 24))) (not (fp.geq .cse4 (_ +zero 8 24)))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2022-11-20 19:53:28,906 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse5 (fp.leq .cse4 .cse6))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) .cse5 (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse6)) (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse6)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))) .cse5))))) is different from true [2022-11-20 19:53:31,129 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse4 .cse5) (or (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse5) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0)))))) .cse4) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 19:53:33,342 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse4 .cse2)) (fp.geq .cse4 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse3) .cse3 (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 19:53:35,560 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse4 .cse2)) (fp.geq .cse4 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))) .cse3 (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 19:53:39,080 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.geq .cse7 (_ +zero 8 24))) (.cse6 (fp.leq .cse7 .cse5))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) .cse4 (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse5)) (and .cse4 .cse6) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)))) .cse6 (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2022-11-20 19:53:42,086 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-20 19:53:44,568 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse5 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse4 .cse5) (or (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse5) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0)))))) .cse4) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) .cse5 (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 19:53:46,648 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse4 .cse5) (or (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse5) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0)))))) .cse4))) is different from false [2022-11-20 19:53:48,849 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse4 .cse5) (or (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse5) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0)))))) .cse4))) is different from true [2022-11-20 19:53:51,087 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse4 .cse2)) (fp.geq .cse4 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse3))) is different from true [2022-11-20 19:53:53,120 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse4 .cse2)) (fp.geq .cse4 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) is different from false [2022-11-20 19:53:55,295 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse4 .cse2)) (fp.geq .cse4 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) is different from true [2022-11-20 19:53:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:53:55,437 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-20 19:53:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 19:53:55,442 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 19 [2022-11-20 19:53:55,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:53:55,443 INFO L225 Difference]: With dead ends: 36 [2022-11-20 19:53:55,443 INFO L226 Difference]: Without dead ends: 34 [2022-11-20 19:53:55,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 74.5s TimeCoverageRelationStatistics Valid=82, Invalid=151, Unknown=33, NotChecked=924, Total=1190 [2022-11-20 19:53:55,446 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-20 19:53:55,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 38 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 2 Unknown, 165 Unchecked, 4.4s Time] [2022-11-20 19:53:55,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-20 19:53:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-20 19:53:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 19:53:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-20 19:53:55,455 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 19 [2022-11-20 19:53:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:53:55,455 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-20 19:53:55,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 19:53:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-11-20 19:53:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 19:53:55,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:55,457 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:55,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-11-20 19:53:55,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-20 19:53:55,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 19:53:56,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:53:56,058 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:53:56,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:56,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1943528346, now seen corresponding path program 2 times [2022-11-20 19:53:56,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 19:53:56,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428986183] [2022-11-20 19:53:56,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 19:53:56,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 19:53:56,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 19:53:56,061 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 19:53:56,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-20 19:53:56,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 19:53:56,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:53:56,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 19:53:56,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:54:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 19:54:02,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:54:13,509 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-11-20 19:54:15,535 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-11-20 19:54:50,321 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-11-20 19:54:52,397 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-11-20 19:54:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2022-11-20 19:54:52,422 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 19:54:52,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428986183] [2022-11-20 19:54:52,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428986183] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:54:52,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1836744152] [2022-11-20 19:54:52,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 19:54:52,423 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 19:54:52,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 19:54:52,424 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 19:54:52,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-11-20 19:54:53,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 19:54:53,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:54:53,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 19:54:53,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:54:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 19:54:53,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:55:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2022-11-20 19:55:34,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1836744152] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:55:34,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166439259] [2022-11-20 19:55:34,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 19:55:34,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:55:34,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:55:34,594 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:55:34,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95f85680-4f41-4ae8-b48d-a0267a47bdf6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 19:55:57,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 19:55:57,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:55:57,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 19:55:57,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:56:26,780 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (and (fp.geq |ULTIMATE.start_main_~y~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~y~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~x~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~x~0#1| .cse0) (= (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |ULTIMATE.start_main_~x~0#1|) .cse2) (fp.div c_currentRoundingMode |ULTIMATE.start_main_~y~0#1| .cse2)) |c_ULTIMATE.start_main_~x1~0#1|) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |ULTIMATE.start_main_~y~0#1|) .cse2)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 19:56:53,467 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (and (fp.geq |ULTIMATE.start_main_~y~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~y~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~x~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~x~0#1| .cse0) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |ULTIMATE.start_main_~x~0#1|) .cse2) (fp.div c_currentRoundingMode |ULTIMATE.start_main_~y~0#1| .cse2)) .cse0) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |ULTIMATE.start_main_~y~0#1|) .cse2)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 19:58:52,851 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 4.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (and (exists ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.leq (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse0) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~y~0#1|) .cse0)) .cse2) (fp.geq |ULTIMATE.start_main_~y~0#1| (_ +zero 8 24)) (fp.leq (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|) .cse0) (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~y~0#1| .cse0)) .cse2) (fp.leq |ULTIMATE.start_main_~y~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~x~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~x~0#1| .cse2))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (or (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main_~x~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~x~0#1| .cse2) (exists ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main_~y~0#1| (_ +zero 8 24)) (fp.leq (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|) .cse0) (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~y~0#1| .cse0)) .cse2) (fp.leq |ULTIMATE.start_main_~y~0#1| .cse2) (not (fp.geq (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse0) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~y~0#1|) .cse0)) (_ +zero 8 24))))))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main_~x~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~x~0#1| .cse2) (exists ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main_~y~0#1| (_ +zero 8 24)) (fp.leq (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|) .cse0) (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~y~0#1| .cse0)) .cse2) (fp.leq |ULTIMATE.start_main_~y~0#1| .cse2) (not (fp.leq (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse0) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~y~0#1|) .cse0)) .cse2)))))))))) is different from false