./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:39:28,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:39:28,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:39:28,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:39:28,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:39:28,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:39:28,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:39:28,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:39:28,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:39:28,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:39:28,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:39:28,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:39:28,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:39:28,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:39:28,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:39:28,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:39:28,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:39:28,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:39:28,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:39:28,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:39:28,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:39:28,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:39:28,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:39:28,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:39:28,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:39:28,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:39:28,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:39:28,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:39:28,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:39:28,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:39:28,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:39:28,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:39:28,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:39:28,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:39:28,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:39:28,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:39:28,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:39:28,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:39:28,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:39:28,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:39:28,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:39:28,432 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 01:39:28,477 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:39:28,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:39:28,484 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:39:28,484 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:39:28,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:39:28,485 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:39:28,486 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:39:28,486 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:39:28,486 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:39:28,486 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:39:28,487 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:39:28,488 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:39:28,488 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:39:28,488 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:39:28,488 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:39:28,489 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:39:28,489 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:39:28,489 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:39:28,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:39:28,491 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:39:28,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:39:28,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:39:28,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:39:28,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:39:28,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:39:28,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:39:28,493 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:39:28,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:39:28,494 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:39:28,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:39:28,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:39:28,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:39:28,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:39:28,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:39:28,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:39:28,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:39:28,495 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:39:28,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:39:28,496 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:39:28,496 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:39:28,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:39:28,496 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/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_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 [2021-11-21 01:39:28,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:39:28,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:39:28,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:39:28,847 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:39:28,848 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:39:28,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2021-11-21 01:39:28,924 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/data/cdaba3c40/7283d85160204bf89752cf154a6c1d14/FLAG9c7c14826 [2021-11-21 01:39:29,452 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:39:29,452 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2021-11-21 01:39:29,473 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/data/cdaba3c40/7283d85160204bf89752cf154a6c1d14/FLAG9c7c14826 [2021-11-21 01:39:29,818 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/data/cdaba3c40/7283d85160204bf89752cf154a6c1d14 [2021-11-21 01:39:29,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:39:29,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:39:29,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:39:29,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:39:29,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:39:29,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:39:29" (1/1) ... [2021-11-21 01:39:29,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0d26ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:29, skipping insertion in model container [2021-11-21 01:39:29,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:39:29" (1/1) ... [2021-11-21 01:39:29,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:39:29,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:39:30,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2021-11-21 01:39:30,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:39:30,054 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:39:30,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2021-11-21 01:39:30,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:39:30,092 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:39:30,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:30 WrapperNode [2021-11-21 01:39:30,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:39:30,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:39:30,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:39:30,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:39:30,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:30" (1/1) ... [2021-11-21 01:39:30,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:30" (1/1) ... [2021-11-21 01:39:30,131 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2021-11-21 01:39:30,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:39:30,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:39:30,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:39:30,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:39:30,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:30" (1/1) ... [2021-11-21 01:39:30,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:30" (1/1) ... [2021-11-21 01:39:30,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:30" (1/1) ... [2021-11-21 01:39:30,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:30" (1/1) ... [2021-11-21 01:39:30,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:30" (1/1) ... [2021-11-21 01:39:30,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:30" (1/1) ... [2021-11-21 01:39:30,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:30" (1/1) ... [2021-11-21 01:39:30,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:39:30,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:39:30,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:39:30,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:39:30,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:30" (1/1) ... [2021-11-21 01:39:30,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:39:30,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:39:30,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:39:30,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:39:30,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:39:30,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-21 01:39:30,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-21 01:39:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:39:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:39:30,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:39:30,285 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:39:30,287 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:39:30,447 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:39:30,463 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:39:30,464 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-21 01:39:30,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:39:30 BoogieIcfgContainer [2021-11-21 01:39:30,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:39:30,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:39:30,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:39:30,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:39:30,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:39:29" (1/3) ... [2021-11-21 01:39:30,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b597950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:39:30, skipping insertion in model container [2021-11-21 01:39:30,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:30" (2/3) ... [2021-11-21 01:39:30,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b597950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:39:30, skipping insertion in model container [2021-11-21 01:39:30,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:39:30" (3/3) ... [2021-11-21 01:39:30,474 INFO L111 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2021-11-21 01:39:30,479 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:39:30,479 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 01:39:30,526 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:39:30,534 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:39:30,534 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 01:39:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:39:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-21 01:39:30,573 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:39:30,574 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:39:30,575 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:39:30,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:39:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1286672979, now seen corresponding path program 1 times [2021-11-21 01:39:30,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:39:30,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560159245] [2021-11-21 01:39:30,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:39:30,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:39:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:39:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-21 01:39:30,803 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:39:30,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560159245] [2021-11-21 01:39:30,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560159245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:39:30,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:39:30,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:39:30,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939695207] [2021-11-21 01:39:30,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:39:30,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 01:39:30,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:39:30,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 01:39:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 01:39:30,867 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:39:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:39:30,890 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2021-11-21 01:39:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 01:39:30,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2021-11-21 01:39:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:39:30,899 INFO L225 Difference]: With dead ends: 20 [2021-11-21 01:39:30,900 INFO L226 Difference]: Without dead ends: 12 [2021-11-21 01:39:30,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 01:39:30,906 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:39:30,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:39:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-21 01:39:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-21 01:39:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:39:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-11-21 01:39:30,957 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 12 [2021-11-21 01:39:30,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:39:30,959 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-11-21 01:39:30,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:39:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2021-11-21 01:39:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:39:30,961 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:39:30,962 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:39:30,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:39:30,962 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:39:30,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:39:30,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1194110661, now seen corresponding path program 1 times [2021-11-21 01:39:30,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:39:30,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041099441] [2021-11-21 01:39:30,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:39:30,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:39:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 01:39:30,993 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-21 01:39:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 01:39:31,029 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-21 01:39:31,029 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-21 01:39:31,031 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 01:39:31,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 01:39:31,037 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-21 01:39:31,040 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 01:39:31,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:39:31 BoogieIcfgContainer [2021-11-21 01:39:31,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 01:39:31,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 01:39:31,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 01:39:31,063 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 01:39:31,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:39:30" (3/4) ... [2021-11-21 01:39:31,067 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-21 01:39:31,067 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 01:39:31,068 INFO L158 Benchmark]: Toolchain (without parser) took 1245.17ms. Allocated memory is still 148.9MB. Free memory was 116.6MB in the beginning and 88.2MB in the end (delta: 28.4MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2021-11-21 01:39:31,068 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 92.3MB. Free memory was 45.7MB in the beginning and 45.6MB in the end (delta: 45.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:39:31,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.22ms. Allocated memory is still 148.9MB. Free memory was 116.2MB in the beginning and 125.2MB in the end (delta: -9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 01:39:31,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.05ms. Allocated memory is still 148.9MB. Free memory was 125.2MB in the beginning and 123.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:39:31,070 INFO L158 Benchmark]: Boogie Preprocessor took 20.70ms. Allocated memory is still 148.9MB. Free memory was 123.4MB in the beginning and 122.6MB in the end (delta: 745.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:39:31,071 INFO L158 Benchmark]: RCFGBuilder took 312.21ms. Allocated memory is still 148.9MB. Free memory was 122.6MB in the beginning and 112.6MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 01:39:31,071 INFO L158 Benchmark]: TraceAbstraction took 594.52ms. Allocated memory is still 148.9MB. Free memory was 112.1MB in the beginning and 88.6MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-21 01:39:31,072 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 148.9MB. Free memory was 88.6MB in the beginning and 88.2MB in the end (delta: 450.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:39:31,075 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.27ms. Allocated memory is still 92.3MB. Free memory was 45.7MB in the beginning and 45.6MB in the end (delta: 45.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.22ms. Allocated memory is still 148.9MB. Free memory was 116.2MB in the beginning and 125.2MB in the end (delta: -9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.05ms. Allocated memory is still 148.9MB. Free memory was 125.2MB in the beginning and 123.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.70ms. Allocated memory is still 148.9MB. Free memory was 123.4MB in the beginning and 122.6MB in the end (delta: 745.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 312.21ms. Allocated memory is still 148.9MB. Free memory was 122.6MB in the beginning and 112.6MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 594.52ms. Allocated memory is still 148.9MB. Free memory was 112.1MB in the beginning and 88.6MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 148.9MB. Free memory was 88.6MB in the beginning and 88.2MB in the end (delta: 450.6kB). 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: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 22, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryArithmeticFLOAToperation at line 31. Possible FailurePath: [L20] float x = __VERIFIER_nondet_float() ; [L21] CALL assume_abort_if_not(x > -1.0) VAL [\old(cond)=1] [L11] COND FALSE !(!cond) [L21] RET assume_abort_if_not(x > -1.0) [L22] CALL assume_abort_if_not(x < 1.0) VAL [\old(cond)=1] [L11] COND FALSE !(!cond) [L22] RET assume_abort_if_not(x < 1.0) [L23] float exp = 1.0 ; [L24] float term = 1.0 ; [L25] unsigned int count = 1 ; [L26] float result = 2*(1/(1-x)) ; [L27] int temp ; VAL [count=1, exp=1, term=1] [L29] COND TRUE 1 [L31] term = term * (x/count) [L32] exp = exp + term [L33] count++ [L35] temp = __VERIFIER_nondet_int() [L36] COND TRUE temp ==0 VAL [count=2, temp=0] [L39] CALL __VERIFIER_assert( result >= exp ) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L13] 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.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 12 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-21 01:39:31,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:39:33,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:39:33,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:39:33,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:39:33,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:39:33,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:39:33,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:39:33,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:39:33,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:39:33,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:39:33,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:39:33,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:39:33,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:39:33,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:39:33,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:39:33,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:39:33,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:39:33,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:39:33,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:39:33,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:39:33,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:39:33,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:39:33,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:39:33,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:39:33,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:39:33,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:39:33,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:39:33,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:39:33,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:39:33,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:39:33,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:39:33,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:39:33,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:39:33,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:39:33,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:39:33,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:39:33,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:39:33,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:39:33,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:39:33,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:39:33,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:39:33,649 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-21 01:39:33,696 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:39:33,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:39:33,697 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:39:33,698 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:39:33,699 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:39:33,699 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:39:33,699 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:39:33,699 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:39:33,701 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:39:33,701 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:39:33,702 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:39:33,702 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:39:33,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:39:33,704 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:39:33,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:39:33,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:39:33,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:39:33,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:39:33,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:39:33,706 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 01:39:33,706 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 01:39:33,706 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:39:33,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:39:33,707 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:39:33,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:39:33,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:39:33,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 01:39:33,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:39:33,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:39:33,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:39:33,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:39:33,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:39:33,709 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 01:39:33,709 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 01:39:33,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:39:33,710 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:39:33,710 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:39:33,711 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_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/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_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 [2021-11-21 01:39:34,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:39:34,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:39:34,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:39:34,095 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:39:34,096 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:39:34,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2021-11-21 01:39:34,176 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/data/ddd7f6e11/8ce13fe302224b8494e5df353a2d4c14/FLAGcfe0fd9bc [2021-11-21 01:39:34,685 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:39:34,685 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2021-11-21 01:39:34,692 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/data/ddd7f6e11/8ce13fe302224b8494e5df353a2d4c14/FLAGcfe0fd9bc [2021-11-21 01:39:35,080 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/data/ddd7f6e11/8ce13fe302224b8494e5df353a2d4c14 [2021-11-21 01:39:35,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:39:35,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:39:35,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:39:35,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:39:35,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:39:35,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:39:35" (1/1) ... [2021-11-21 01:39:35,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2884d843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35, skipping insertion in model container [2021-11-21 01:39:35,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:39:35" (1/1) ... [2021-11-21 01:39:35,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:39:35,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:39:35,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2021-11-21 01:39:35,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:39:35,359 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:39:35,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2021-11-21 01:39:35,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:39:35,443 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:39:35,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35 WrapperNode [2021-11-21 01:39:35,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:39:35,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:39:35,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:39:35,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:39:35,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35" (1/1) ... [2021-11-21 01:39:35,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35" (1/1) ... [2021-11-21 01:39:35,486 INFO L137 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2021-11-21 01:39:35,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:39:35,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:39:35,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:39:35,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:39:35,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35" (1/1) ... [2021-11-21 01:39:35,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35" (1/1) ... [2021-11-21 01:39:35,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35" (1/1) ... [2021-11-21 01:39:35,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35" (1/1) ... [2021-11-21 01:39:35,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35" (1/1) ... [2021-11-21 01:39:35,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35" (1/1) ... [2021-11-21 01:39:35,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35" (1/1) ... [2021-11-21 01:39:35,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:39:35,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:39:35,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:39:35,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:39:35,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35" (1/1) ... [2021-11-21 01:39:35,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:39:35,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:39:35,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:39:35,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:39:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:39:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 01:39:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-21 01:39:35,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-21 01:39:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:39:35,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:39:35,718 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:39:35,719 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:39:38,205 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:39:38,209 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:39:38,210 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-21 01:39:38,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:39:38 BoogieIcfgContainer [2021-11-21 01:39:38,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:39:38,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:39:38,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:39:38,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:39:38,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:39:35" (1/3) ... [2021-11-21 01:39:38,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7508e7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:39:38, skipping insertion in model container [2021-11-21 01:39:38,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:35" (2/3) ... [2021-11-21 01:39:38,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7508e7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:39:38, skipping insertion in model container [2021-11-21 01:39:38,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:39:38" (3/3) ... [2021-11-21 01:39:38,225 INFO L111 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2021-11-21 01:39:38,230 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:39:38,230 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 01:39:38,274 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:39:38,281 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:39:38,281 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 01:39:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:39:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-21 01:39:38,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:39:38,315 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:39:38,316 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:39:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:39:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1019803906, now seen corresponding path program 1 times [2021-11-21 01:39:38,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:39:38,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818511231] [2021-11-21 01:39:38,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:39:38,334 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:39:38,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:39:38,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:39:38,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 01:39:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:39:38,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-21 01:39:38,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:39:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 01:39:38,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:39:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 01:39:38,784 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:39:38,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818511231] [2021-11-21 01:39:38,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818511231] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:39:38,785 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:39:38,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 01:39:38,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747725159] [2021-11-21 01:39:38,788 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:39:38,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 01:39:38,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:39:38,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 01:39:38,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 01:39:38,821 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:39:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:39:38,839 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-11-21 01:39:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 01:39:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-21 01:39:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:39:38,848 INFO L225 Difference]: With dead ends: 35 [2021-11-21 01:39:38,848 INFO L226 Difference]: Without dead ends: 15 [2021-11-21 01:39:38,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 01:39:38,855 INFO L933 BasicCegarLoop]: 20 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, 20 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 [2021-11-21 01:39:38,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:39:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-11-21 01:39:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-11-21 01:39:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:39:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-11-21 01:39:38,891 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 17 [2021-11-21 01:39:38,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:39:38,891 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-11-21 01:39:38,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:39:38,892 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-11-21 01:39:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-21 01:39:38,894 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:39:38,894 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:39:38,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:39:39,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:39:39,110 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:39:39,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:39:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1211444824, now seen corresponding path program 1 times [2021-11-21 01:39:39,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:39:39,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271195448] [2021-11-21 01:39:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:39:39,112 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:39:39,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:39:39,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:39:39,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 01:39:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:39:40,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-21 01:39:40,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:40:29,479 WARN L227 SmtUtils]: Spent 22.33s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:40:46,478 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse2 (fp.neg .cse1)) (fp.lt .cse2 .cse1) (= (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~x~0#1|)))) |c_ULTIMATE.start_main_~result~0#1|)))) is different from false [2021-11-21 01:40:48,516 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse2 (fp.neg .cse1)) (fp.lt .cse2 .cse1) (= (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~x~0#1|)))) |c_ULTIMATE.start_main_~result~0#1|)))) is different from true [2021-11-21 01:41:56,489 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse3))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)))) (fp.gt .cse4 (fp.neg .cse3)) (fp.lt .cse4 .cse3)))) is different from false [2021-11-21 01:41:58,530 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse3))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)))) (fp.gt .cse4 (fp.neg .cse3)) (fp.lt .cse4 .cse3)))) is different from true [2021-11-21 01:42:15,147 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))))) is different from false [2021-11-21 01:42:17,186 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))))) is different from true [2021-11-21 01:42:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 01:42:17,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:42:27,896 WARN L838 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) is different from false [2021-11-21 01:42:29,964 WARN L860 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) is different from true [2021-11-21 01:42:35,759 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) is different from false [2021-11-21 01:42:37,813 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) is different from true [2021-11-21 01:42:48,581 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))))) is different from false [2021-11-21 01:42:50,636 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))))) is different from true [2021-11-21 01:43:01,039 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|) .cse2))))) is different from true [2021-11-21 01:43:19,685 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|) .cse2)))) (= c_assume_abort_if_not_~cond (_ bv0 32))) is different from true [2021-11-21 01:43:35,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))))) is different from false [2021-11-21 01:43:37,320 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))))) is different from true [2021-11-21 01:44:42,225 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (let ((.cse3 (fp.gt .cse4 (fp.neg .cse2)))) (and (or .cse3 (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv1 32))) (not .cse3)))) (not (fp.lt .cse4 .cse2))))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse5 (fp.neg .cse6)) (not (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse7 (fp.sub c_currentRoundingMode .cse7 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (fp.add c_currentRoundingMode .cse8 (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))) (fp.lt .cse5 .cse6))))) is different from false [2021-11-21 01:44:44,281 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (let ((.cse3 (fp.gt .cse4 (fp.neg .cse2)))) (and (or .cse3 (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv1 32))) (not .cse3)))) (not (fp.lt .cse4 .cse2))))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse5 (fp.neg .cse6)) (not (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse7 (fp.sub c_currentRoundingMode .cse7 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (fp.add c_currentRoundingMode .cse8 (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))) (fp.lt .cse5 .cse6))))) is different from true [2021-11-21 01:46:50,342 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (let ((.cse3 (fp.gt .cse4 (fp.neg .cse2)))) (and (or .cse3 (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv1 32))) (not .cse3)))) (not (fp.lt .cse4 .cse2))))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse5 (fp.neg .cse6)) (not (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse7 (fp.sub c_currentRoundingMode .cse7 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (fp.add c_currentRoundingMode .cse8 (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))) (fp.lt .cse5 .cse6)))) (= c_assume_abort_if_not_~cond (_ bv0 32))) is different from false [2021-11-21 01:46:52,401 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (let ((.cse3 (fp.gt .cse4 (fp.neg .cse2)))) (and (or .cse3 (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv1 32))) (not .cse3)))) (not (fp.lt .cse4 .cse2))))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse5 (fp.neg .cse6)) (not (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse7 (fp.sub c_currentRoundingMode .cse7 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (fp.add c_currentRoundingMode .cse8 (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))) (fp.lt .cse5 .cse6)))) (= c_assume_abort_if_not_~cond (_ bv0 32))) is different from true [2021-11-21 01:47:19,582 WARN L838 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv1 32))) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (not (fp.gt .cse3 (fp.neg .cse2))) (not (fp.lt .cse3 .cse2))))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse4 (fp.neg .cse5)) (not (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse6 (fp.sub c_currentRoundingMode .cse6 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse7 ((_ to_fp 8 24) c_currentRoundingMode .cse5))) (fp.add c_currentRoundingMode .cse7 (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))) (fp.lt .cse4 .cse5))))) is different from false [2021-11-21 01:47:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-11-21 01:47:32,413 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:47:32,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271195448] [2021-11-21 01:47:32,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271195448] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 01:47:32,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-21 01:47:32,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 21 [2021-11-21 01:47:32,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490223363] [2021-11-21 01:47:32,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:47:32,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-21 01:47:32,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:47:32,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-21 01:47:32,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=65, Unknown=22, NotChecked=286, Total=420 [2021-11-21 01:47:32,419 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:47:36,322 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 01:47:38,699 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 01:47:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:47:38,702 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2021-11-21 01:47:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-21 01:47:38,805 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2021-11-21 01:47:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:47:38,806 INFO L225 Difference]: With dead ends: 21 [2021-11-21 01:47:38,806 INFO L226 Difference]: Without dead ends: 17 [2021-11-21 01:47:38,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 78.6s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=22, NotChecked=308, Total=462 [2021-11-21 01:47:38,809 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:47:38,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 1 Unknown, 37 Unchecked, 6.2s Time] [2021-11-21 01:47:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-21 01:47:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-21 01:47:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:47:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-11-21 01:47:38,815 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 18 [2021-11-21 01:47:38,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:47:38,817 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-21 01:47:38,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:47:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-11-21 01:47:38,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-21 01:47:38,818 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:47:38,818 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:47:38,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:47:39,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:47:39,019 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:47:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:47:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash 311013171, now seen corresponding path program 1 times [2021-11-21 01:47:39,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:47:39,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638801448] [2021-11-21 01:47:39,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:47:39,021 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:47:39,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:47:39,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:47:39,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c82d11-50f7-4cc5-be00-76ec6e683a5a/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 01:47:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:47:48,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-21 01:47:48,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:48:20,061 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|))) (and (= .cse0 |c_ULTIMATE.start_main_~term~0#1|) (= .cse0 |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse1 (fp.neg .cse2)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x~0#1|))))) (= (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.lt .cse1 .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-21 01:48:51,241 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x~0#1|))))) (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|))))) (fp.lt .cse0 .cse1) (= (fp.add c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~term~0#1|) |c_ULTIMATE.start_main_~exp~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-21 01:49:32,708 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (= (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) |c_ULTIMATE.start_main_~result~0#1|) (= |c_ULTIMATE.start_main_~exp~0#1| (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))))) is different from false [2021-11-21 01:49:34,761 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (= (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) |c_ULTIMATE.start_main_~result~0#1|) (= |c_ULTIMATE.start_main_~exp~0#1| (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))))) is different from true [2021-11-21 01:50:47,628 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and .cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) (fp.gt .cse5 (fp.neg .cse4)) (fp.lt .cse5 .cse4)))) is different from false [2021-11-21 01:50:49,683 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and .cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) (fp.gt .cse5 (fp.neg .cse4)) (fp.lt .cse5 .cse4)))) is different from true [2021-11-21 01:51:06,500 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))) (fp.lt .cse0 .cse1)))) is different from false [2021-11-21 01:51:08,557 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))) (fp.lt .cse0 .cse1)))) is different from true [2021-11-21 01:51:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2021-11-21 01:51:08,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:51:15,121 WARN L838 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) is different from false [2021-11-21 01:51:17,190 WARN L860 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) is different from true [2021-11-21 01:51:27,697 WARN L838 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (let ((.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|))))))) is different from false [2021-11-21 01:51:29,806 WARN L860 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (let ((.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|))))))) is different from true [2021-11-21 01:51:36,021 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) is different from false [2021-11-21 01:51:38,096 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) is different from true [2021-11-21 01:51:49,086 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))))) is different from false [2021-11-21 01:51:51,165 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))))) is different from true [2021-11-21 01:52:01,685 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|) .cse3))))) is different from true [2021-11-21 01:52:20,630 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|) .cse3)))) (= c_assume_abort_if_not_~cond (_ bv0 32))) is different from true [2021-11-21 01:52:36,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) is different from false [2021-11-21 01:52:38,737 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) is different from true [2021-11-21 01:53:41,793 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.lt .cse4 .cse3)) (let ((.cse5 (fp.gt .cse4 (fp.neg .cse3)))) (and (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) .cse5) (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv1 32))) (not .cse5))))))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse6 (fp.neg .cse7)) (fp.lt .cse6 .cse7) (not (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse8 (fp.sub c_currentRoundingMode .cse8 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode .cse7))) (let ((.cse10 (fp.mul c_currentRoundingMode .cse9 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse9 .cse10) (fp.mul c_currentRoundingMode .cse10 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))))) is different from false [2021-11-21 01:53:43,870 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.lt .cse4 .cse3)) (let ((.cse5 (fp.gt .cse4 (fp.neg .cse3)))) (and (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) .cse5) (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv1 32))) (not .cse5))))))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse6 (fp.neg .cse7)) (fp.lt .cse6 .cse7) (not (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse8 (fp.sub c_currentRoundingMode .cse8 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode .cse7))) (let ((.cse10 (fp.mul c_currentRoundingMode .cse9 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse9 .cse10) (fp.mul c_currentRoundingMode .cse10 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))))) is different from true