./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:10:56,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:10:56,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:10:56,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:10:56,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:10:56,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:10:56,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:10:56,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:10:56,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:10:56,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:10:56,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:10:56,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:10:56,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:10:56,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:10:56,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:10:56,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:10:56,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:10:56,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:10:56,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:10:56,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:10:56,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:10:56,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:10:56,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:10:56,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:10:56,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:10:56,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:10:56,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:10:56,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:10:56,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:10:56,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:10:56,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:10:56,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:10:56,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:10:56,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:10:56,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:10:56,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:10:56,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:10:56,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:10:56,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:10:56,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:10:56,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:10:56,648 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 00:10:56,696 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:10:56,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:10:56,697 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:10:56,697 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:10:56,705 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:10:56,705 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:10:56,705 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:10:56,706 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:10:56,706 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:10:56,706 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 00:10:56,707 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:10:56,707 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:10:56,708 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 00:10:56,708 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 00:10:56,708 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:10:56,708 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 00:10:56,708 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 00:10:56,709 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 00:10:56,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:10:56,710 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:10:56,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:10:56,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:10:56,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:10:56,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:10:56,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:10:56,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:10:56,713 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:10:56,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:10:56,713 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:10:56,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:10:56,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:10:56,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:10:56,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:10:56,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:10:56,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:10:56,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:10:56,715 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 00:10:56,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 00:10:56,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:10:56,716 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:10:56,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:10:56,716 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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2021-11-21 00:10:57,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:10:57,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:10:57,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:10:57,041 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:10:57,042 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:10:57,043 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/float-benchs/interpolation2.c [2021-11-21 00:10:57,143 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/data/bde0574c6/e9aa3eee47ec4bb8a5a314b181954a5c/FLAG425c2a7ec [2021-11-21 00:10:57,624 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:10:57,625 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/sv-benchmarks/c/float-benchs/interpolation2.c [2021-11-21 00:10:57,639 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/data/bde0574c6/e9aa3eee47ec4bb8a5a314b181954a5c/FLAG425c2a7ec [2021-11-21 00:10:57,958 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/data/bde0574c6/e9aa3eee47ec4bb8a5a314b181954a5c [2021-11-21 00:10:57,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:10:57,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:10:57,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:10:57,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:10:57,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:10:57,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:10:57" (1/1) ... [2021-11-21 00:10:57,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c65f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:57, skipping insertion in model container [2021-11-21 00:10:57,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:10:57" (1/1) ... [2021-11-21 00:10:57,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:10:58,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:10:58,187 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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2021-11-21 00:10:58,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:10:58,222 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:10:58,236 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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2021-11-21 00:10:58,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:10:58,271 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:10:58,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:58 WrapperNode [2021-11-21 00:10:58,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:10:58,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:10:58,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:10:58,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:10:58,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:58" (1/1) ... [2021-11-21 00:10:58,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:58" (1/1) ... [2021-11-21 00:10:58,313 INFO L137 Inliner]: procedures = 18, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2021-11-21 00:10:58,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:10:58,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:10:58,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:10:58,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:10:58,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:58" (1/1) ... [2021-11-21 00:10:58,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:58" (1/1) ... [2021-11-21 00:10:58,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:58" (1/1) ... [2021-11-21 00:10:58,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:58" (1/1) ... [2021-11-21 00:10:58,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:58" (1/1) ... [2021-11-21 00:10:58,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:58" (1/1) ... [2021-11-21 00:10:58,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:58" (1/1) ... [2021-11-21 00:10:58,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:10:58,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:10:58,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:10:58,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:10:58,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:58" (1/1) ... [2021-11-21 00:10:58,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:10:58,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:10:58,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:10:58,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:10:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:10:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 00:10:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:10:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-21 00:10:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:10:58,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:10:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-21 00:10:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:10:58,490 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:10:58,492 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:10:58,623 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:10:58,673 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:10:58,673 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-21 00:10:58,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:10:58 BoogieIcfgContainer [2021-11-21 00:10:58,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:10:58,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:10:58,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:10:58,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:10:58,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:10:57" (1/3) ... [2021-11-21 00:10:58,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@defaf3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:10:58, skipping insertion in model container [2021-11-21 00:10:58,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:10:58" (2/3) ... [2021-11-21 00:10:58,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@defaf3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:10:58, skipping insertion in model container [2021-11-21 00:10:58,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:10:58" (3/3) ... [2021-11-21 00:10:58,686 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2021-11-21 00:10:58,692 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:10:58,692 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 00:10:58,747 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:10:58,756 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 00:10:58,756 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 00:10:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:58,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-21 00:10:58,778 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:58,779 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-21 00:10:58,780 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:10:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:58,786 INFO L85 PathProgramCache]: Analyzing trace with hash 85773351, now seen corresponding path program 1 times [2021-11-21 00:10:58,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:58,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373385509] [2021-11-21 00:10:58,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:58,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:10:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:10:58,980 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:10:58,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373385509] [2021-11-21 00:10:58,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373385509] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:10:58,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:10:58,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 00:10:58,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125197711] [2021-11-21 00:10:58,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:10:58,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:10:58,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:10:59,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:10:59,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:10:59,023 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:59,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:10:59,063 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-21 00:10:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:10:59,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-21 00:10:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:10:59,076 INFO L225 Difference]: With dead ends: 23 [2021-11-21 00:10:59,076 INFO L226 Difference]: Without dead ends: 13 [2021-11-21 00:10:59,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:10:59,085 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:10:59,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 10 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:10:59,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-21 00:10:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2021-11-21 00:10:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-11-21 00:10:59,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2021-11-21 00:10:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:10:59,179 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-11-21 00:10:59,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:10:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-11-21 00:10:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 00:10:59,180 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:10:59,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 00:10:59,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 00:10:59,181 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:10:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:10:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1666710841, now seen corresponding path program 1 times [2021-11-21 00:10:59,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:10:59,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832296572] [2021-11-21 00:10:59,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:10:59,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:10:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 00:10:59,263 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-21 00:10:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 00:10:59,340 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-21 00:10:59,340 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-21 00:10:59,342 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 00:10:59,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 00:10:59,349 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-21 00:10:59,353 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 00:10:59,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 12:10:59 BoogieIcfgContainer [2021-11-21 00:10:59,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 00:10:59,388 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 00:10:59,388 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 00:10:59,388 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 00:10:59,389 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:10:58" (3/4) ... [2021-11-21 00:10:59,393 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-21 00:10:59,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 00:10:59,394 INFO L158 Benchmark]: Toolchain (without parser) took 1430.35ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 53.9MB in the beginning and 89.0MB in the end (delta: -35.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:10:59,394 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 96.5MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:10:59,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.85ms. Allocated memory is still 96.5MB. Free memory was 53.7MB in the beginning and 69.8MB in the end (delta: -16.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-21 00:10:59,396 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.17ms. Allocated memory is still 96.5MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:10:59,397 INFO L158 Benchmark]: Boogie Preprocessor took 39.24ms. Allocated memory is still 96.5MB. Free memory was 67.7MB in the beginning and 66.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:10:59,398 INFO L158 Benchmark]: RCFGBuilder took 319.59ms. Allocated memory is still 96.5MB. Free memory was 66.4MB in the beginning and 52.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-21 00:10:59,398 INFO L158 Benchmark]: TraceAbstraction took 708.61ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 52.0MB in the beginning and 89.8MB in the end (delta: -37.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:10:59,399 INFO L158 Benchmark]: Witness Printer took 5.08ms. Allocated memory is still 117.4MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:10:59,403 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.28ms. Allocated memory is still 96.5MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.85ms. Allocated memory is still 96.5MB. Free memory was 53.7MB in the beginning and 69.8MB in the end (delta: -16.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.17ms. Allocated memory is still 96.5MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.24ms. Allocated memory is still 96.5MB. Free memory was 67.7MB in the beginning and 66.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 319.59ms. Allocated memory is still 96.5MB. Free memory was 66.4MB in the beginning and 52.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 708.61ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 52.0MB in the beginning and 89.8MB in the end (delta: -37.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.08ms. Allocated memory is still 117.4MB. Free memory is still 89.0MB. 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: 9]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 28, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 26. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L20] t = __VERIFIER_nondet_float() [L21] EXPR min[0] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) [L21] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L23] i = 0 VAL [i=0, max={6:0}, min={4:0}, org={5:0}, slope={7:0}] [L23] COND TRUE i < sizeof(min) / sizeof(min[0]) [L24] EXPR max[i] VAL [i=0, max={6:0}, max[i]=49, min={4:0}, org={5:0}, slope={7:0}] [L24] COND TRUE t <= max[i] [L26] EXPR org[i] [L26] EXPR slope[i] [L26] EXPR min[i] [L26] EXPR max[i] [L26] EXPR min[i] [L26] z = org[i] + slope[i] * (t - min[i]) / (max[i] - min[i]) [L28] CALL __VERIFIER_assert(z >= -10.f && z <= 30.f) [L9] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L9] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 5 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-21 00:10:59,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:11:02,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:11:02,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:11:02,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:11:02,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:11:02,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:11:02,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:11:02,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:11:02,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:11:02,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:11:02,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:11:02,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:11:02,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:11:02,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:11:02,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:11:02,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:11:02,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:11:02,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:11:02,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:11:02,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:11:02,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:11:02,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:11:02,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:11:02,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:11:02,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:11:02,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:11:02,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:11:02,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:11:02,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:11:02,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:11:02,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:11:02,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:11:02,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:11:02,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:11:02,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:11:02,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:11:02,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:11:02,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:11:02,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:11:02,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:11:02,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:11:02,106 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-21 00:11:02,134 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:11:02,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:11:02,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:11:02,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:11:02,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:11:02,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:11:02,136 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:11:02,137 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:11:02,137 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:11:02,137 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:11:02,137 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:11:02,138 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:11:02,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:11:02,139 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:11:02,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:11:02,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:11:02,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:11:02,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:11:02,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:11:02,140 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 00:11:02,141 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 00:11:02,141 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:11:02,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:11:02,141 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:11:02,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:11:02,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:11:02,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 00:11:02,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:11:02,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:11:02,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:11:02,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:11:02,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:11:02,144 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 00:11:02,144 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 00:11:02,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:11:02,145 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:11:02,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:11:02,145 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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2021-11-21 00:11:02,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:11:02,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:11:02,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:11:02,567 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:11:02,568 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:11:02,570 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/float-benchs/interpolation2.c [2021-11-21 00:11:02,650 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/data/8e4a57635/99942c2d790f4bb29567c6efa2cf333b/FLAG94c77efc6 [2021-11-21 00:11:03,260 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:11:03,261 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/sv-benchmarks/c/float-benchs/interpolation2.c [2021-11-21 00:11:03,269 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/data/8e4a57635/99942c2d790f4bb29567c6efa2cf333b/FLAG94c77efc6 [2021-11-21 00:11:03,604 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/data/8e4a57635/99942c2d790f4bb29567c6efa2cf333b [2021-11-21 00:11:03,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:11:03,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:11:03,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:11:03,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:11:03,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:11:03,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:11:03" (1/1) ... [2021-11-21 00:11:03,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12fbb6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:03, skipping insertion in model container [2021-11-21 00:11:03,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:11:03" (1/1) ... [2021-11-21 00:11:03,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:11:03,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:11:03,879 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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2021-11-21 00:11:03,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:11:03,945 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:11:03,995 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_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2021-11-21 00:11:04,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:11:04,051 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:11:04,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:04 WrapperNode [2021-11-21 00:11:04,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:11:04,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:11:04,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:11:04,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:11:04,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:04" (1/1) ... [2021-11-21 00:11:04,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:04" (1/1) ... [2021-11-21 00:11:04,104 INFO L137 Inliner]: procedures = 19, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2021-11-21 00:11:04,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:11:04,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:11:04,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:11:04,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:11:04,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:04" (1/1) ... [2021-11-21 00:11:04,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:04" (1/1) ... [2021-11-21 00:11:04,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:04" (1/1) ... [2021-11-21 00:11:04,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:04" (1/1) ... [2021-11-21 00:11:04,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:04" (1/1) ... [2021-11-21 00:11:04,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:04" (1/1) ... [2021-11-21 00:11:04,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:04" (1/1) ... [2021-11-21 00:11:04,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:11:04,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:11:04,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:11:04,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:11:04,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:04" (1/1) ... [2021-11-21 00:11:04,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:11:04,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:11:04,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:11:04,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:11:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:11:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-21 00:11:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 00:11:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:11:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-21 00:11:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:11:04,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:11:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:11:04,343 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:11:04,345 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:11:06,802 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:11:06,824 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:11:06,825 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-21 00:11:06,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:11:06 BoogieIcfgContainer [2021-11-21 00:11:06,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:11:06,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:11:06,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:11:06,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:11:06,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:11:03" (1/3) ... [2021-11-21 00:11:06,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334136b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:11:06, skipping insertion in model container [2021-11-21 00:11:06,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:04" (2/3) ... [2021-11-21 00:11:06,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334136b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:11:06, skipping insertion in model container [2021-11-21 00:11:06,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:11:06" (3/3) ... [2021-11-21 00:11:06,836 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2021-11-21 00:11:06,843 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:11:06,843 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 00:11:06,900 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:11:06,907 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 00:11:06,907 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 00:11:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 00:11:06,925 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:06,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:11:06,926 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:11:06,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2021-11-21 00:11:06,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:11:06,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618906167] [2021-11-21 00:11:06,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:06,950 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:11:06,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:11:06,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:11:06,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 00:11:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:07,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-21 00:11:07,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:11:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:07,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:11:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:07,850 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:11:07,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618906167] [2021-11-21 00:11:07,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618906167] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:07,851 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:07,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 00:11:07,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823945080] [2021-11-21 00:11:07,855 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:07,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 00:11:07,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:11:07,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 00:11:07,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 00:11:07,896 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:07,914 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-11-21 00:11:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 00:11:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-21 00:11:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:07,926 INFO L225 Difference]: With dead ends: 29 [2021-11-21 00:11:07,927 INFO L226 Difference]: Without dead ends: 13 [2021-11-21 00:11:07,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 00:11:07,964 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:07,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:11:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-21 00:11:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-21 00:11:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-21 00:11:07,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-11-21 00:11:07,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:07,997 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-21 00:11:07,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-21 00:11:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 00:11:07,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:07,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:11:08,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-21 00:11:08,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:11:08,224 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:11:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2021-11-21 00:11:08,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:11:08,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070570605] [2021-11-21 00:11:08,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:08,227 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:11:08,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:11:08,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:11:08,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 00:11:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:08,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 00:11:08,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:11:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:08,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:11:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:11:08,953 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:11:08,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070570605] [2021-11-21 00:11:08,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070570605] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:11:08,954 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:11:08,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 00:11:08,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803808392] [2021-11-21 00:11:08,954 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:11:08,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:11:08,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:11:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:11:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:11:08,958 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:11,256 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-21 00:11:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:11:11,382 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-21 00:11:11,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:11:11,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-21 00:11:11,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:11:11,385 INFO L225 Difference]: With dead ends: 23 [2021-11-21 00:11:11,385 INFO L226 Difference]: Without dead ends: 19 [2021-11-21 00:11:11,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:11:11,387 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:11:11,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2021-11-21 00:11:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-21 00:11:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-11-21 00:11:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-21 00:11:11,395 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2021-11-21 00:11:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:11:11,395 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-21 00:11:11,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:11:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-21 00:11:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-21 00:11:11,397 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:11:11,398 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:11:11,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 00:11:11,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:11:11,608 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:11:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:11:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2021-11-21 00:11:11,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:11:11,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498485253] [2021-11-21 00:11:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:11:11,611 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:11:11,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:11:11,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:11:11,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 00:11:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:11:12,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-21 00:11:12,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:11:19,234 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-21 00:11:19,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 612 treesize of output 312 [2021-11-21 00:16:45,566 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (let ((.cse0 (fp.leq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse4 .cse3))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse4) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse3) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse4) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse2)))) is different from false [2021-11-21 00:16:47,596 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (let ((.cse0 (fp.leq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse4 .cse3))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse4) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse3) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse4) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse2)))) is different from true [2021-11-21 00:18:08,610 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse3) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1)))) is different from false [2021-11-21 00:18:10,634 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse3) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1)))) is different from true [2021-11-21 00:18:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:18:10,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:18:21,336 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) is different from false [2021-11-21 00:18:23,412 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) is different from true [2021-11-21 00:18:38,306 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)) (let ((.cse0 (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) is different from false [2021-11-21 00:18:40,386 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)) (let ((.cse0 (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) is different from true [2021-11-21 00:18:55,269 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .cse5)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))))) is different from false [2021-11-21 00:18:57,345 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .cse5)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))))) is different from true [2021-11-21 00:19:12,251 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from false [2021-11-21 00:19:14,329 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from true [2021-11-21 00:19:33,537 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from false [2021-11-21 00:19:35,613 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from true [2021-11-21 00:19:54,813 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from false [2021-11-21 00:19:56,891 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from true [2021-11-21 00:20:20,327 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse8 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse2 .cse6)))))) (and (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))))) is different from false [2021-11-21 00:20:22,404 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse8 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse2 .cse6)))))) (and (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))))) is different from true [2021-11-21 00:21:54,716 WARN L227 SmtUtils]: Spent 1.54m on a formula simplification. DAG size of input: 33 DAG size of output: 11 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-21 00:21:54,717 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-11-21 00:21:54,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 409 treesize of output 211 [2021-11-21 00:23:41,166 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_7 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~t~0#1_8| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse3)) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.geq |v_ULTIMATE.start_main_~t~0#1_8| .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse1)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))))) is different from false [2021-11-21 00:23:43,249 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_7 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~t~0#1_8| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse3)) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.geq |v_ULTIMATE.start_main_~t~0#1_8| .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse1)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))))) is different from true [2021-11-21 00:23:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:23:43,250 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:23:43,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498485253] [2021-11-21 00:23:43,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498485253] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:23:43,250 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:23:43,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 20 [2021-11-21 00:23:43,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993146012] [2021-11-21 00:23:43,251 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:23:43,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-21 00:23:43,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:23:43,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-21 00:23:43,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=79, Unknown=20, NotChecked=270, Total=420 [2021-11-21 00:23:43,253 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:23:45,345 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_7 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~t~0#1_8| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse3)) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.geq |v_ULTIMATE.start_main_~t~0#1_8| .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse1)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-21 00:23:47,419 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_7 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~t~0#1_8| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse3)) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.geq |v_ULTIMATE.start_main_~t~0#1_8| .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse1)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-21 00:23:51,481 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse3 (not |c_ULTIMATE.start_main_#t~short7#1|)) (.cse1 (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse0 (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse4 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse5 (let ((.cse9 (select .cse10 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse7 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (let ((.cse2 (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse4))) (or (and (not .cse2) .cse3) (and .cse2 |c_ULTIMATE.start_main_#t~short7#1|))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) .cse3 (let ((.cse6 (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (and (fp.leq .cse6 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse6 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-21 00:23:54,233 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse3 (let ((.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse1 (not |c_ULTIMATE.start_main_#t~short7#1|)) (.cse5 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse7 (let ((.cse9 (select .cse10 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse4 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) .cse1 (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .cse5))))) (and (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse5) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (let ((.cse6 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse7))) (or (and (not .cse6) .cse1) (and .cse6 |c_ULTIMATE.start_main_#t~short7#1|))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-21 00:23:58,009 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse1 (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 (let ((.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse5 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse7 (let ((.cse9 (select .cse10 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse4 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (or .cse0 (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse1 .cse5))))) (and (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (let ((.cse6 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse7))) (or (and .cse6 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse0 (not .cse6)))) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse5) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-21 00:24:01,470 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse0 (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse1 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse3 (let ((.cse7 (select .cse8 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (.cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1)) (fp.sub c_currentRoundingMode .cse0 .cse1))))) (and (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse4 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-21 00:24:05,376 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|)) (.cse13 (let ((.cse18 (select .cse11 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)))) (.cse15 (let ((.cse17 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (let ((.cse6 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse12 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse6)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse6)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse9 (let ((.cse10 (select .cse11 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse6)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse7 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse6)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse9)) (fp.sub c_currentRoundingMode .cse2 .cse9)))))) (and (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))))) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse13) (= (let ((.cse14 (select .cse5 |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse15) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse13 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse15 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse16 (select .cse8 |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-21 00:24:07,436 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse8 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|)) (.cse12 (let ((.cse18 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)))) (.cse2 (let ((.cse17 (select .cse14 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse5 (let ((.cse16 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse2) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)) (let ((.cse6 (fp.add c_currentRoundingMode (let ((.cse7 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (let ((.cse11 (let ((.cse13 (select .cse14 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse9 (select .cse10 (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse11)) (fp.sub c_currentRoundingMode .cse12 .cse11)))))) (and (fp.leq .cse6 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse6 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_#t~mem9#1| .cse12) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse15 (select .cse10 |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from false [2021-11-21 00:24:09,519 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse8 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|)) (.cse12 (let ((.cse18 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)))) (.cse2 (let ((.cse17 (select .cse14 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse5 (let ((.cse16 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse2) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)) (let ((.cse6 (fp.add c_currentRoundingMode (let ((.cse7 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (let ((.cse11 (let ((.cse13 (select .cse14 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse9 (select .cse10 (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse11)) (fp.sub c_currentRoundingMode .cse12 .cse11)))))) (and (fp.leq .cse6 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse6 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_#t~mem9#1| .cse12) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse15 (select .cse10 |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-21 00:24:11,573 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse13 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|)) (.cse3 (let ((.cse17 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse13)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse12 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse13)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))) (let ((.cse15 (let ((.cse16 (select .cse11 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse13)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse14 (select .cse9 (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse13)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse15)) (fp.sub c_currentRoundingMode .cse3 .cse15))))) (.cse4 (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (= (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse4) (= (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (let ((.cse7 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))))))) is different from false [2021-11-21 00:24:13,652 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse13 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|)) (.cse3 (let ((.cse17 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse13)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse12 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse13)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))) (let ((.cse15 (let ((.cse16 (select .cse11 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse13)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse14 (select .cse9 (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse13)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse15)) (fp.sub c_currentRoundingMode .cse3 .cse15))))) (.cse4 (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (= (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse4) (= (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (let ((.cse7 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))))))) is different from true [2021-11-21 00:24:15,702 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (let ((.cse0 (fp.leq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse4 .cse3))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse4) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse3) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse4) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse2))))) is different from false [2021-11-21 00:24:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:24:15,738 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-11-21 00:24:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-21 00:24:15,740 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-21 00:24:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:24:15,741 INFO L225 Difference]: With dead ends: 26 [2021-11-21 00:24:15,741 INFO L226 Difference]: Without dead ends: 22 [2021-11-21 00:24:15,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 75.8s TimeCoverageRelationStatistics Valid=69, Invalid=85, Unknown=32, NotChecked=684, Total=870 [2021-11-21 00:24:15,744 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:24:15,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 80 Unchecked, 0.1s Time] [2021-11-21 00:24:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-21 00:24:15,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-21 00:24:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:24:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-11-21 00:24:15,751 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 11 [2021-11-21 00:24:15,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:24:15,751 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-11-21 00:24:15,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:24:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-11-21 00:24:15,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-21 00:24:15,752 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:24:15,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:24:15,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 00:24:15,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:24:15,968 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:24:15,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:24:15,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1504580037, now seen corresponding path program 1 times [2021-11-21 00:24:15,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:24:15,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329168976] [2021-11-21 00:24:15,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:24:15,971 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:24:15,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:24:15,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:24:15,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 00:24:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:24:16,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 00:24:16,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:24:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:24:16,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:24:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:24:16,542 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:24:16,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329168976] [2021-11-21 00:24:16,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329168976] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:24:16,543 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:24:16,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-21 00:24:16,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028084933] [2021-11-21 00:24:16,543 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:24:16,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:24:16,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:24:16,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:24:16,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:24:16,545 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:24:16,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:24:16,635 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-11-21 00:24:16,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:24:16,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-21 00:24:16,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:24:16,636 INFO L225 Difference]: With dead ends: 31 [2021-11-21 00:24:16,636 INFO L226 Difference]: Without dead ends: 17 [2021-11-21 00:24:16,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-21 00:24:16,638 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:24:16,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:24:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-21 00:24:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-21 00:24:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:24:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-11-21 00:24:16,642 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2021-11-21 00:24:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:24:16,642 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-21 00:24:16,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:24:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-11-21 00:24:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-21 00:24:16,643 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:24:16,644 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:24:16,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 00:24:16,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:24:16,845 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:24:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:24:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash 723862385, now seen corresponding path program 1 times [2021-11-21 00:24:16,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:24:16,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135332522] [2021-11-21 00:24:16,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:24:16,846 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:24:16,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:24:16,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:24:16,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f353c8df-ef5b-4e8e-88d4-8510e7ac4250/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-21 00:24:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:24:17,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-21 00:24:17,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:24:28,015 INFO L354 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2021-11-21 00:24:28,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 659 treesize of output 335