./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 2329fc70 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_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 13:11:44,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:11:44,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:11:44,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:11:44,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:11:44,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:11:44,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:11:44,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:11:44,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:11:44,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:11:44,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:11:44,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:11:44,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:11:44,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:11:44,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:11:44,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:11:44,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:11:44,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:11:44,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:11:44,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:11:44,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:11:44,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:11:44,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:11:44,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:11:44,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:11:44,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:11:44,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:11:44,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:11:44,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:11:44,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:11:44,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:11:44,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:11:44,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:11:44,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:11:44,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:11:44,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:11:44,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:11:44,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:11:44,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:11:44,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:11:44,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:11:44,400 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 13:11:44,415 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:11:44,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:11:44,415 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:11:44,415 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:11:44,416 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:11:44,416 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:11:44,416 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:11:44,416 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:11:44,416 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:11:44,417 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 13:11:44,417 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:11:44,417 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:11:44,417 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 13:11:44,417 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 13:11:44,417 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:11:44,418 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 13:11:44,418 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 13:11:44,418 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 13:11:44,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:11:44,419 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:11:44,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:11:44,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:11:44,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:11:44,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 13:11:44,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:11:44,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 13:11:44,420 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:11:44,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 13:11:44,420 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:11:44,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 13:11:44,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:11:44,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:11:44,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:11:44,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:11:44,421 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 13:11:44,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:11:44,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 13:11:44,422 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 13:11:44,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 13:11:44,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 13:11:44,422 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:11:44,422 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_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh 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-12-14 13:11:44,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:11:44,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:11:44,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:11:44,606 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:11:44,607 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:11:44,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2022-12-14 13:11:47,176 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:11:47,319 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:11:47,320 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/sv-benchmarks/c/float-benchs/zonotope_2.c [2022-12-14 13:11:47,323 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/data/cc0fd0fef/312d095c49714c888e32a29d41fdf4db/FLAG87c934075 [2022-12-14 13:11:47,732 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/data/cc0fd0fef/312d095c49714c888e32a29d41fdf4db [2022-12-14 13:11:47,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:11:47,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:11:47,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:11:47,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:11:47,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:11:47,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f31cd77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47, skipping insertion in model container [2022-12-14 13:11:47,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:11:47,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:11:47,865 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_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-12-14 13:11:47,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:11:47,885 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:11:47,893 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_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-12-14 13:11:47,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:11:47,906 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:11:47,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47 WrapperNode [2022-12-14 13:11:47,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:11:47,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:11:47,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:11:47,908 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:11:47,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,929 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-12-14 13:11:47,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:11:47,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:11:47,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:11:47,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:11:47,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,944 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:11:47,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:11:47,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:11:47,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:11:47,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47" (1/1) ... [2022-12-14 13:11:47,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:11:47,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:11:47,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:11:47,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:11:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:11:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:11:48,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:11:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 13:11:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 13:11:48,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 13:11:48,054 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:11:48,056 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:11:48,137 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:11:48,157 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:11:48,158 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 13:11:48,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:11:48 BoogieIcfgContainer [2022-12-14 13:11:48,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:11:48,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:11:48,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:11:48,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:11:48,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:11:47" (1/3) ... [2022-12-14 13:11:48,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1e0098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:11:48, skipping insertion in model container [2022-12-14 13:11:48,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:47" (2/3) ... [2022-12-14 13:11:48,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1e0098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:11:48, skipping insertion in model container [2022-12-14 13:11:48,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:11:48" (3/3) ... [2022-12-14 13:11:48,170 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2022-12-14 13:11:48,190 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:11:48,190 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 13:11:48,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:11:48,243 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;@2805ed0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:11:48,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 13:11:48,247 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-12-14 13:11:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 13:11:48,254 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:48,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 13:11:48,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:11:48,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:48,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2071569913, now seen corresponding path program 1 times [2022-12-14 13:11:48,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:48,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038979105] [2022-12-14 13:11:48,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:48,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:11:48,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 13:11:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:11:48,393 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 13:11:48,395 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 13:11:48,396 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 13:11:48,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 13:11:48,402 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-12-14 13:11:48,405 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 13:11:48,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:11:48 BoogieIcfgContainer [2022-12-14 13:11:48,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 13:11:48,420 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 13:11:48,420 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 13:11:48,420 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 13:11:48,421 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:11:48" (3/4) ... [2022-12-14 13:11:48,424 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 13:11:48,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 13:11:48,425 INFO L158 Benchmark]: Toolchain (without parser) took 689.12ms. Allocated memory is still 138.4MB. Free memory was 107.7MB in the beginning and 70.2MB in the end (delta: 37.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-14 13:11:48,426 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:11:48,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.84ms. Allocated memory is still 138.4MB. Free memory was 107.1MB in the beginning and 97.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 13:11:48,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.23ms. Allocated memory is still 138.4MB. Free memory was 97.5MB in the beginning and 95.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:11:48,428 INFO L158 Benchmark]: Boogie Preprocessor took 16.34ms. Allocated memory is still 138.4MB. Free memory was 95.9MB in the beginning and 94.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:11:48,428 INFO L158 Benchmark]: RCFGBuilder took 212.99ms. Allocated memory is still 138.4MB. Free memory was 94.5MB in the beginning and 84.9MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 13:11:48,429 INFO L158 Benchmark]: TraceAbstraction took 256.50ms. Allocated memory is still 138.4MB. Free memory was 84.1MB in the beginning and 70.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 13:11:48,429 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 138.4MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:11:48,432 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.15ms. Allocated memory is still 138.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.84ms. Allocated memory is still 138.4MB. Free memory was 107.1MB in the beginning and 97.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.23ms. Allocated memory is still 138.4MB. Free memory was 97.5MB in the beginning and 95.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.34ms. Allocated memory is still 138.4MB. Free memory was 95.9MB in the beginning and 94.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 212.99ms. Allocated memory is still 138.4MB. Free memory was 94.5MB in the beginning and 84.9MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 256.50ms. Allocated memory is still 138.4MB. Free memory was 84.1MB in the beginning and 70.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 138.4MB. Free memory is still 70.2MB. 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.2s, 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-12-14 13:11:48,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 13:11:50,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:11:50,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:11:50,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:11:50,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:11:50,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:11:50,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:11:50,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:11:50,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:11:50,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:11:50,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:11:50,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:11:50,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:11:50,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:11:50,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:11:50,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:11:50,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:11:50,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:11:50,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:11:50,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:11:50,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:11:50,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:11:50,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:11:50,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:11:50,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:11:50,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:11:50,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:11:50,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:11:50,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:11:50,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:11:50,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:11:50,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:11:50,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:11:50,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:11:50,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:11:50,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:11:50,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:11:50,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:11:50,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:11:50,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:11:50,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:11:50,163 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 13:11:50,184 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:11:50,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:11:50,184 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:11:50,185 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:11:50,185 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:11:50,185 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:11:50,185 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:11:50,186 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:11:50,186 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:11:50,186 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:11:50,186 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:11:50,186 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:11:50,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:11:50,187 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:11:50,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:11:50,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:11:50,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 13:11:50,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:11:50,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 13:11:50,188 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 13:11:50,188 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 13:11:50,188 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 13:11:50,188 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:11:50,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 13:11:50,189 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:11:50,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 13:11:50,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:11:50,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 13:11:50,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:11:50,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:11:50,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:11:50,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:11:50,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 13:11:50,190 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 13:11:50,191 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 13:11:50,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 13:11:50,191 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:11:50,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 13:11:50,191 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_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh 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-12-14 13:11:50,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:11:50,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:11:50,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:11:50,437 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:11:50,438 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:11:50,439 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2022-12-14 13:11:53,004 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:11:53,151 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:11:53,152 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/sv-benchmarks/c/float-benchs/zonotope_2.c [2022-12-14 13:11:53,157 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/data/79d003ddc/579aa03bdd6a4b1287f1011c2707b319/FLAG3d6ab1851 [2022-12-14 13:11:53,168 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/data/79d003ddc/579aa03bdd6a4b1287f1011c2707b319 [2022-12-14 13:11:53,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:11:53,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:11:53,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:11:53,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:11:53,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:11:53,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b81305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53, skipping insertion in model container [2022-12-14 13:11:53,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:11:53,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:11:53,289 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_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-12-14 13:11:53,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:11:53,316 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:11:53,327 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_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-12-14 13:11:53,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:11:53,346 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:11:53,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53 WrapperNode [2022-12-14 13:11:53,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:11:53,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:11:53,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:11:53,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:11:53,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,387 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2022-12-14 13:11:53,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:11:53,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:11:53,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:11:53,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:11:53,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,410 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:11:53,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:11:53,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:11:53,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:11:53,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53" (1/1) ... [2022-12-14 13:11:53,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:11:53,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:11:53,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:11:53,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:11:53,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:11:53,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:11:53,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:11:53,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 13:11:53,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 13:11:53,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 13:11:53,543 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:11:53,544 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:11:55,686 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:11:55,690 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:11:55,690 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 13:11:55,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:11:55 BoogieIcfgContainer [2022-12-14 13:11:55,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:11:55,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:11:55,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:11:55,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:11:55,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:11:53" (1/3) ... [2022-12-14 13:11:55,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251d2dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:11:55, skipping insertion in model container [2022-12-14 13:11:55,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:53" (2/3) ... [2022-12-14 13:11:55,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251d2dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:11:55, skipping insertion in model container [2022-12-14 13:11:55,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:11:55" (3/3) ... [2022-12-14 13:11:55,701 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2022-12-14 13:11:55,722 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:11:55,722 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 13:11:55,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:11:55,772 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;@24e7da13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:11:55,772 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 13:11:55,776 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-12-14 13:11:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 13:11:55,783 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:55,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:55,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:11:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:55,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2022-12-14 13:11:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:11:55,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565542114] [2022-12-14 13:11:55,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:55,798 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-12-14 13:11:55,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:11:55,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:11:55,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:11:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:55,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 13:11:55,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:11:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:55,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:11:55,935 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:11:55,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565542114] [2022-12-14 13:11:55,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565542114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:55,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:55,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:11:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981667725] [2022-12-14 13:11:55,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:55,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 13:11:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:11:55,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 13:11:55,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 13:11:55,962 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-12-14 13:11:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:55,975 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-12-14 13:11:55,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 13:11:55,977 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-12-14 13:11:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:55,981 INFO L225 Difference]: With dead ends: 32 [2022-12-14 13:11:55,981 INFO L226 Difference]: Without dead ends: 13 [2022-12-14 13:11:55,983 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-12-14 13:11:55,986 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-12-14 13:11:55,986 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-12-14 13:11:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-12-14 13:11:56,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-12-14 13:11:56,010 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-12-14 13:11:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-12-14 13:11:56,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-12-14 13:11:56,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:56,012 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-12-14 13:11:56,012 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-12-14 13:11:56,012 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-12-14 13:11:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 13:11:56,012 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:56,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:56,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:11:56,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:11:56,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:11:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:56,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2022-12-14 13:11:56,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:11:56,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270559563] [2022-12-14 13:11:56,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:56,219 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-12-14 13:11:56,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:11:56,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:11:56,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:11:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:56,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 13:11:56,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:11:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:56,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:11:56,339 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:11:56,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270559563] [2022-12-14 13:11:56,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270559563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:56,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:56,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:11:56,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14938164] [2022-12-14 13:11:56,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:56,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:11:56,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:11:56,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:11:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:11:56,341 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-12-14 13:11:58,431 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-12-14 13:11:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:58,472 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-12-14 13:11:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:11:58,473 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-12-14 13:11:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:58,473 INFO L225 Difference]: With dead ends: 21 [2022-12-14 13:11:58,473 INFO L226 Difference]: Without dead ends: 14 [2022-12-14 13:11:58,473 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-12-14 13:11:58,474 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:58,475 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.1s Time] [2022-12-14 13:11:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-12-14 13:11:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-12-14 13:11:58,478 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-12-14 13:11:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-12-14 13:11:58,479 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2022-12-14 13:11:58,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:58,479 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-12-14 13:11:58,479 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-12-14 13:11:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-12-14 13:11:58,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 13:11:58,479 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:58,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:58,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:11:58,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:11:58,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:11:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2022-12-14 13:11:58,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:11:58,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445588569] [2022-12-14 13:11:58,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:58,686 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-12-14 13:11:58,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:11:58,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:11:58,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:11:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:58,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 13:11:58,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:11:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:59,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:11:59,767 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:11:59,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445588569] [2022-12-14 13:11:59,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445588569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:59,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:59,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 13:11:59,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711545385] [2022-12-14 13:11:59,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:59,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 13:11:59,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:11:59,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 13:11:59,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:11:59,770 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-12-14 13:12:01,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 13:12:04,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 13:12:06,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 13:12:08,564 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-12-14 13:12:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:08,565 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-12-14 13:12:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:12:08,601 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-12-14 13:12:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:08,601 INFO L225 Difference]: With dead ends: 31 [2022-12-14 13:12:08,602 INFO L226 Difference]: Without dead ends: 29 [2022-12-14 13:12:08,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:12:08,603 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 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, 8.7s IncrementalHoareTripleChecker+Time [2022-12-14 13:12:08,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 8.7s Time] [2022-12-14 13:12:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-14 13:12:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-12-14 13:12:08,610 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-12-14 13:12:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-12-14 13:12:08,610 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 7 [2022-12-14 13:12:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:08,611 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-12-14 13:12:08,611 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-12-14 13:12:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-12-14 13:12:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 13:12:08,612 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:12:08,612 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:08,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:12:08,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:12:08,814 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:12:08,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:12:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1269539930, now seen corresponding path program 1 times [2022-12-14 13:12:08,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:12:08,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968975196] [2022-12-14 13:12:08,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:08,818 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-12-14 13:12:08,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:12:08,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:12:08,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:12:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:09,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 13:12:09,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:12:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:12:10,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:12:18,676 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-12-14 13:12:20,696 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-12-14 13:12:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:12:20,708 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:12:20,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968975196] [2022-12-14 13:12:20,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968975196] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 13:12:20,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 13:12:20,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-12-14 13:12:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576734316] [2022-12-14 13:12:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:12:20,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:12:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:12:20,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:12:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=67, Unknown=2, NotChecked=16, Total=110 [2022-12-14 13:12:20,711 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-12-14 13:12:22,738 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-12-14 13:12:24,759 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-12-14 13:12:26,914 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-12-14 13:12:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:27,036 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-12-14 13:12:27,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:12:27,036 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-12-14 13:12:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:27,037 INFO L225 Difference]: With dead ends: 33 [2022-12-14 13:12:27,037 INFO L226 Difference]: Without dead ends: 29 [2022-12-14 13:12:27,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2022-12-14 13:12:27,038 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-12-14 13:12:27,038 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-12-14 13:12:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-14 13:12:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-12-14 13:12:27,044 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-12-14 13:12:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-12-14 13:12:27,044 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2022-12-14 13:12:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:27,045 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-12-14 13:12:27,045 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-12-14 13:12:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-12-14 13:12:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 13:12:27,045 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:12:27,045 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:27,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 13:12:27,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:12:27,247 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:12:27,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:12:27,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1102679400, now seen corresponding path program 1 times [2022-12-14 13:12:27,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:12:27,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700827620] [2022-12-14 13:12:27,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:27,250 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-12-14 13:12:27,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:12:27,253 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:12:27,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:12:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:27,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 13:12:27,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:12:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:12:27,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:12:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:12:27,590 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:12:27,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700827620] [2022-12-14 13:12:27,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700827620] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:12:27,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [184781510] [2022-12-14 13:12:27,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:27,590 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 13:12:27,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 13:12:27,591 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 13:12:27,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-12-14 13:12:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:27,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 13:12:27,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:12:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:12:27,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:12:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:12:27,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [184781510] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:12:27,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238338347] [2022-12-14 13:12:27,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:27,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:12:27,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:12:27,937 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:12:27,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 13:12:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:28,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 13:12:28,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:12:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:12:28,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:12:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:12:28,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238338347] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:12:28,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 13:12:28,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2022-12-14 13:12:28,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799171378] [2022-12-14 13:12:28,181 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 13:12:28,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:12:28,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:12:28,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:12:28,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:12:28,182 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-12-14 13:12:30,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 13:12:32,270 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-12-14 13:12:34,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 13:12:36,411 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-12-14 13:12:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:36,529 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-12-14 13:12:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:12:36,530 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-12-14 13:12:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:36,531 INFO L225 Difference]: With dead ends: 44 [2022-12-14 13:12:36,531 INFO L226 Difference]: Without dead ends: 34 [2022-12-14 13:12:36,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:12:36,532 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:12:36,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 4 Unknown, 0 Unchecked, 8.3s Time] [2022-12-14 13:12:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-14 13:12:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-12-14 13:12:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 13:12:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-12-14 13:12:36,537 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2022-12-14 13:12:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:36,537 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-12-14 13:12:36,537 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-12-14 13:12:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-12-14 13:12:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 13:12:36,538 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:12:36,538 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:36,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 13:12:36,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2022-12-14 13:12:36,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 13:12:37,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:12:37,141 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:12:37,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:12:37,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1100951522, now seen corresponding path program 1 times [2022-12-14 13:12:37,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:12:37,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007260215] [2022-12-14 13:12:37,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:37,144 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-12-14 13:12:37,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:12:37,145 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:12:37,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:12:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:37,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 13:12:37,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:12:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:12:42,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:12:52,810 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-12-14 13:13:26,317 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-12-14 13:13:28,379 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-12-14 13:13:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-12-14 13:13:28,402 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:13:28,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007260215] [2022-12-14 13:13:28,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007260215] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:13:28,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1096342313] [2022-12-14 13:13:28,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:28,402 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 13:13:28,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 13:13:28,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 13:13:28,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-12-14 13:13:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:28,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 13:13:28,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:13:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:13:29,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:14:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-12-14 13:14:08,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1096342313] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:14:08,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664456828] [2022-12-14 13:14:08,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:14:08,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:14:08,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:14:08,046 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:14:08,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 13:14:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:14:15,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 13:14:15,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:14:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:14:15,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:14:50,521 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-12-14 13:15:15,024 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-12-14 13:15:47,773 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-12-14 13:16:09,049 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-12-14 13:16:11,071 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-12-14 13:18:17,142 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-12-14 13:19:13,298 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-12-14 13:20:16,200 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-12-14 13:20:18,298 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-12-14 13:20:41,445 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-12-14 13:20:43,513 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-12-14 13:20:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2022-12-14 13:20:43,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664456828] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:20:43,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 13:20:43,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 9, 14] total 23 [2022-12-14 13:20:43,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355308226] [2022-12-14 13:20:43,529 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 13:20:43,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 13:20:43,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:20:43,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 13:20:43,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=126, Unknown=16, NotChecked=310, Total=506 [2022-12-14 13:20:43,532 INFO L87 Difference]: Start difference. First operand 34 states and 40 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-12-14 13:20:45,571 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-12-14 13:20:47,615 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-12-14 13:20:49,731 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-12-14 13:20:51,799 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-12-14 13:20:54,467 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-12-14 13:20:56,672 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-12-14 13:20:58,859 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-12-14 13:21:01,059 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-12-14 13:21:03,817 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-12-14 13:21:12,033 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-12-14 13:21:14,510 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-12-14 13:21:16,588 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-12-14 13:21:18,769 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-12-14 13:21:20,972 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-12-14 13:21:23,001 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-12-14 13:21:25,187 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-12-14 13:21:27,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 13:21:29,300 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-12-14 13:21:31,303 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-12-14 13:21:33,306 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-12-14 13:21:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:21:33,503 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-12-14 13:21:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 13:21:33,509 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-12-14 13:21:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:21:33,509 INFO L225 Difference]: With dead ends: 40 [2022-12-14 13:21:33,509 INFO L226 Difference]: Without dead ends: 38 [2022-12-14 13:21:33,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 74.6s TimeCoverageRelationStatistics Valid=82, Invalid=154, Unknown=30, NotChecked=924, Total=1190 [2022-12-14 13:21:33,511 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-12-14 13:21:33,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 6 Unknown, 255 Unchecked, 12.6s Time] [2022-12-14 13:21:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-14 13:21:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-12-14 13:21:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 13:21:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-12-14 13:21:33,519 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 19 [2022-12-14 13:21:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:21:33,520 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-12-14 13:21:33,520 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-12-14 13:21:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-12-14 13:21:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 13:21:33,520 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:21:33,521 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 13:21:33,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:21:33,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 13:21:33,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-12-14 13:21:34,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 13:21:34,125 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:21:34,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:21:34,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1943528346, now seen corresponding path program 2 times [2022-12-14 13:21:34,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:21:34,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482222165] [2022-12-14 13:21:34,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 13:21:34,128 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-12-14 13:21:34,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:21:34,130 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:21:34,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/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-12-14 13:21:34,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 13:21:34,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:21:34,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 13:21:34,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:21:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 13:21:40,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:21:51,202 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-12-14 13:21:53,228 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-12-14 13:22:27,084 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-12-14 13:22:29,157 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-12-14 13:22:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2022-12-14 13:22:29,182 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:22:29,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482222165] [2022-12-14 13:22:29,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482222165] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:22:29,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1572516000] [2022-12-14 13:22:29,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 13:22:29,182 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 13:22:29,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 13:22:29,183 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 13:22:29,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-12-14 13:22:29,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 13:22:29,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:22:29,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 13:22:29,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:22:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 13:22:30,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:23:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2022-12-14 13:23:10,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1572516000] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:23:10,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083376978] [2022-12-14 13:23:10,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 13:23:10,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:23:10,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:23:10,977 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:23:10,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35d1f5ab-9fcf-4ff1-ae5e-98358b5017ec/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 13:23:29,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 13:23:29,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:23:29,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 13:23:29,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:23:57,798 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-12-14 13:24:26,023 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-12-14 13:26:25,127 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