./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 00:54:34,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 00:54:34,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 00:54:34,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 00:54:34,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 00:54:34,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 00:54:34,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 00:54:34,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 00:54:34,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 00:54:34,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 00:54:34,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 00:54:34,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 00:54:34,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 00:54:34,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 00:54:34,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 00:54:34,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 00:54:34,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 00:54:34,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 00:54:34,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 00:54:34,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 00:54:34,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 00:54:34,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 00:54:34,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 00:54:34,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 00:54:34,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 00:54:34,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 00:54:34,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 00:54:34,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 00:54:34,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 00:54:34,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 00:54:34,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 00:54:34,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 00:54:34,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 00:54:34,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 00:54:34,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 00:54:34,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 00:54:34,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 00:54:34,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 00:54:34,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 00:54:34,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 00:54:34,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 00:54:34,753 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 00:54:34,813 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 00:54:34,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 00:54:34,815 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 00:54:34,815 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 00:54:34,815 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 00:54:34,816 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 00:54:34,816 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 00:54:34,816 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 00:54:34,824 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 00:54:34,825 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 00:54:34,826 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 00:54:34,827 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 00:54:34,827 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 00:54:34,827 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 00:54:34,827 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 00:54:34,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 00:54:34,829 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 00:54:34,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 00:54:34,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 00:54:34,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 00:54:34,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 00:54:34,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 00:54:34,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 00:54:34,831 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 00:54:34,831 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 00:54:34,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 00:54:34,831 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 00:54:34,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 00:54:34,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 00:54:34,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 00:54:34,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:54:34,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 00:54:34,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 00:54:34,836 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 00:54:34,836 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 00:54:34,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 00:54:34,837 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 00:54:34,837 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 00:54:34,837 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 00:54:34,837 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_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f [2021-11-07 00:54:35,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 00:54:35,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 00:54:35,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 00:54:35,188 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 00:54:35,189 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 00:54:35,190 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2021-11-07 00:54:35,315 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/data/0ce0be75d/7fbec75a22a146eab6b65d86b8b6b3c1/FLAG6720cd190 [2021-11-07 00:54:35,845 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 00:54:35,846 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2021-11-07 00:54:35,853 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/data/0ce0be75d/7fbec75a22a146eab6b65d86b8b6b3c1/FLAG6720cd190 [2021-11-07 00:54:36,180 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/data/0ce0be75d/7fbec75a22a146eab6b65d86b8b6b3c1 [2021-11-07 00:54:36,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 00:54:36,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 00:54:36,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 00:54:36,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 00:54:36,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 00:54:36,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:36" (1/1) ... [2021-11-07 00:54:36,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9cd859c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36, skipping insertion in model container [2021-11-07 00:54:36,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:36" (1/1) ... [2021-11-07 00:54:36,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 00:54:36,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 00:54:36,422 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2021-11-07 00:54:36,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:54:36,442 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 00:54:36,473 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2021-11-07 00:54:36,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:54:36,516 INFO L208 MainTranslator]: Completed translation [2021-11-07 00:54:36,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36 WrapperNode [2021-11-07 00:54:36,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 00:54:36,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 00:54:36,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 00:54:36,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 00:54:36,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36" (1/1) ... [2021-11-07 00:54:36,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36" (1/1) ... [2021-11-07 00:54:36,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 00:54:36,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 00:54:36,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 00:54:36,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 00:54:36,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36" (1/1) ... [2021-11-07 00:54:36,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36" (1/1) ... [2021-11-07 00:54:36,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36" (1/1) ... [2021-11-07 00:54:36,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36" (1/1) ... [2021-11-07 00:54:36,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36" (1/1) ... [2021-11-07 00:54:36,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36" (1/1) ... [2021-11-07 00:54:36,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36" (1/1) ... [2021-11-07 00:54:36,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 00:54:36,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 00:54:36,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 00:54:36,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 00:54:36,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36" (1/1) ... [2021-11-07 00:54:36,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:54:36,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:54:36,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 00:54:36,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 00:54:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 00:54:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 00:54:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-07 00:54:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 00:54:36,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 00:54:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-07 00:54:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 00:54:37,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 00:54:37,211 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 00:54:37,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:37 BoogieIcfgContainer [2021-11-07 00:54:37,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 00:54:37,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 00:54:37,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 00:54:37,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 00:54:37,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:54:36" (1/3) ... [2021-11-07 00:54:37,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4976f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:37, skipping insertion in model container [2021-11-07 00:54:37,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:36" (2/3) ... [2021-11-07 00:54:37,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4976f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:37, skipping insertion in model container [2021-11-07 00:54:37,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:37" (3/3) ... [2021-11-07 00:54:37,226 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2021-11-07 00:54:37,233 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 00:54:37,234 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 00:54:37,303 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 00:54:37,318 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 00:54:37,319 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 00:54:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:54:37,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:54:37,349 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:54:37,349 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:54:37,352 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:54:37,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:54:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1054039300, now seen corresponding path program 1 times [2021-11-07 00:54:37,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:54:37,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417928042] [2021-11-07 00:54:37,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:54:37,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:54:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:54:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:54:37,649 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:54:37,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417928042] [2021-11-07 00:54:37,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417928042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:54:37,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:54:37,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 00:54:37,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193657575] [2021-11-07 00:54:37,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 00:54:37,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:54:37,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 00:54:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 00:54:37,679 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 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 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:54:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:54:37,812 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2021-11-07 00:54:37,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 00:54:37,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 12 [2021-11-07 00:54:37,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:54:37,825 INFO L225 Difference]: With dead ends: 35 [2021-11-07 00:54:37,835 INFO L226 Difference]: Without dead ends: 21 [2021-11-07 00:54:37,861 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 00:54:37,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-07 00:54:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-11-07 00:54:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:54:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2021-11-07 00:54:37,907 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2021-11-07 00:54:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:54:37,908 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-11-07 00:54:37,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:54:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2021-11-07 00:54:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 00:54:37,910 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:54:37,910 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:54:37,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 00:54:37,911 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:54:37,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:54:37,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1037028639, now seen corresponding path program 1 times [2021-11-07 00:54:37,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:54:37,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737522755] [2021-11-07 00:54:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:54:37,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:54:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 00:54:37,975 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 00:54:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 00:54:38,060 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 00:54:38,060 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 00:54:38,063 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 00:54:38,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 00:54:38,070 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-07 00:54:38,074 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 00:54:38,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:54:38 BoogieIcfgContainer [2021-11-07 00:54:38,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 00:54:38,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 00:54:38,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 00:54:38,114 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 00:54:38,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:37" (3/4) ... [2021-11-07 00:54:38,118 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 00:54:38,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 00:54:38,121 INFO L168 Benchmark]: Toolchain (without parser) took 1934.37 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 47.5 MB in the beginning and 75.2 MB in the end (delta: -27.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 00:54:38,121 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 83.9 MB. Free memory is still 47.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 00:54:38,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.43 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 47.3 MB in the beginning and 88.2 MB in the end (delta: -40.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 16.1 GB. [2021-11-07 00:54:38,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.56 ms. Allocated memory is still 109.1 MB. Free memory was 88.2 MB in the beginning and 87.8 MB in the end (delta: 355.4 kB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. [2021-11-07 00:54:38,124 INFO L168 Benchmark]: Boogie Preprocessor took 37.16 ms. Allocated memory is still 109.1 MB. Free memory was 87.8 MB in the beginning and 86.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 00:54:38,125 INFO L168 Benchmark]: RCFGBuilder took 547.84 ms. Allocated memory is still 109.1 MB. Free memory was 86.3 MB in the beginning and 71.6 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-07 00:54:38,126 INFO L168 Benchmark]: TraceAbstraction took 895.32 ms. Allocated memory is still 109.1 MB. Free memory was 71.0 MB in the beginning and 75.2 MB in the end (delta: -4.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 00:54:38,126 INFO L168 Benchmark]: Witness Printer took 5.55 ms. Allocated memory is still 109.1 MB. Free memory is still 75.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 00:54:38,131 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.22 ms. Allocated memory is still 83.9 MB. Free memory is still 47.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 326.43 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 47.3 MB in the beginning and 88.2 MB in the end (delta: -40.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 110.56 ms. Allocated memory is still 109.1 MB. Free memory was 88.2 MB in the beginning and 87.8 MB in the end (delta: 355.4 kB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.16 ms. Allocated memory is still 109.1 MB. Free memory was 87.8 MB in the beginning and 86.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 547.84 ms. Allocated memory is still 109.1 MB. Free memory was 86.3 MB in the beginning and 71.6 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 895.32 ms. Allocated memory is still 109.1 MB. Free memory was 71.0 MB in the beginning and 75.2 MB in the end (delta: -4.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 5.55 ms. Allocated memory is still 109.1 MB. Free memory is still 75.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 53]: 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 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L1] int __return_main; [L12] int __return_136; [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L22] main__t = __VERIFIER_nondet_float() [L23] int main____CPAchecker_TMP_0; [L24] EXPR main__min[0] VAL [__return_136=0, __return_main=0] [L24] COND TRUE main__t >= (main__min[0]) [L26] EXPR main__max[4UL] VAL [__return_136=0, __return_main=0] [L26] COND TRUE main__t <= (main__max[4UL]) [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_136=0, __return_main=0] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_136=0, __return_main=0] [L32] COND TRUE main__i < 5UL [L34] EXPR main__max[main__i] VAL [__return_136=0, __return_main=0] [L34] COND TRUE main__t <= (main__max[main__i]) [L38] EXPR main__org[main__i] [L38] EXPR main__slope[main__i] [L38] EXPR main__min[main__i] [L38] EXPR main__max[main__i] [L38] EXPR main__min[main__i] [L38] main__z = (main__org[main__i]) + (((main__slope[main__i]) * (main__t - (main__min[main__i]))) / ((main__max[main__i]) - (main__min[main__i]))) [L39] int main____CPAchecker_TMP_1; VAL [__return_136=0, __return_main=0] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_136=0, __return_main=0] [L66] main____CPAchecker_TMP_1 = 0 VAL [__return_136=0, __return_main=0] [L47] int __tmp_1; [L48] __tmp_1 = main____CPAchecker_TMP_1 [L49] int __VERIFIER_assert__cond; [L50] __VERIFIER_assert__cond = __tmp_1 VAL [__return_136=0, __return_main=0] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_136=0, __return_main=0] [L53] reach_error() VAL [__return_136=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, 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: 33 SDtfs, 37 SDslu, 64 SDs, 0 SdLazy, 13 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-07 00:54:38,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 00:54:41,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 00:54:41,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 00:54:41,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 00:54:41,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 00:54:41,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 00:54:41,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 00:54:41,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 00:54:41,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 00:54:41,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 00:54:41,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 00:54:41,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 00:54:41,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 00:54:41,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 00:54:41,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 00:54:41,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 00:54:41,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 00:54:41,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 00:54:41,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 00:54:41,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 00:54:41,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 00:54:41,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 00:54:41,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 00:54:41,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 00:54:41,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 00:54:41,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 00:54:41,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 00:54:41,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 00:54:41,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 00:54:41,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 00:54:41,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 00:54:41,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 00:54:41,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 00:54:41,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 00:54:41,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 00:54:41,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 00:54:41,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 00:54:41,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 00:54:41,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 00:54:41,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 00:54:41,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 00:54:41,295 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-07 00:54:41,335 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 00:54:41,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 00:54:41,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 00:54:41,340 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 00:54:41,340 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 00:54:41,341 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 00:54:41,341 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 00:54:41,341 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 00:54:41,342 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 00:54:41,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 00:54:41,345 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 00:54:41,346 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 00:54:41,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 00:54:41,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 00:54:41,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 00:54:41,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 00:54:41,347 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 00:54:41,347 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 00:54:41,348 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 00:54:41,348 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 00:54:41,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 00:54:41,349 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 00:54:41,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 00:54:41,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 00:54:41,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 00:54:41,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 00:54:41,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:54:41,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 00:54:41,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 00:54:41,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 00:54:41,351 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-07 00:54:41,351 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 00:54:41,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 00:54:41,352 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 00:54:41,353 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 00:54:41,353 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_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f [2021-11-07 00:54:41,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 00:54:41,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 00:54:41,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 00:54:41,840 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 00:54:41,841 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 00:54:41,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2021-11-07 00:54:41,934 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/data/359eb032d/9d901411d0bc458cadf60fca5fcd64d7/FLAG1a29fccec [2021-11-07 00:54:42,732 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 00:54:42,733 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2021-11-07 00:54:42,743 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/data/359eb032d/9d901411d0bc458cadf60fca5fcd64d7/FLAG1a29fccec [2021-11-07 00:54:43,060 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/data/359eb032d/9d901411d0bc458cadf60fca5fcd64d7 [2021-11-07 00:54:43,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 00:54:43,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 00:54:43,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 00:54:43,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 00:54:43,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 00:54:43,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:43" (1/1) ... [2021-11-07 00:54:43,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4100acf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43, skipping insertion in model container [2021-11-07 00:54:43,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:43" (1/1) ... [2021-11-07 00:54:43,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 00:54:43,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 00:54:43,278 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2021-11-07 00:54:43,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:54:43,336 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 00:54:43,372 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2021-11-07 00:54:43,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:54:43,405 INFO L208 MainTranslator]: Completed translation [2021-11-07 00:54:43,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43 WrapperNode [2021-11-07 00:54:43,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 00:54:43,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 00:54:43,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 00:54:43,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 00:54:43,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43" (1/1) ... [2021-11-07 00:54:43,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43" (1/1) ... [2021-11-07 00:54:43,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 00:54:43,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 00:54:43,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 00:54:43,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 00:54:43,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43" (1/1) ... [2021-11-07 00:54:43,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43" (1/1) ... [2021-11-07 00:54:43,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43" (1/1) ... [2021-11-07 00:54:43,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43" (1/1) ... [2021-11-07 00:54:43,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43" (1/1) ... [2021-11-07 00:54:43,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43" (1/1) ... [2021-11-07 00:54:43,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43" (1/1) ... [2021-11-07 00:54:43,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 00:54:43,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 00:54:43,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 00:54:43,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 00:54:43,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43" (1/1) ... [2021-11-07 00:54:43,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:54:43,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:54:43,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 00:54:43,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 00:54:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-07 00:54:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 00:54:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 00:54:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-07 00:54:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 00:54:43,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 00:54:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 00:54:46,844 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 00:54:46,844 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 00:54:46,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:46 BoogieIcfgContainer [2021-11-07 00:54:46,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 00:54:46,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 00:54:46,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 00:54:46,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 00:54:46,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:54:43" (1/3) ... [2021-11-07 00:54:46,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c189bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:46, skipping insertion in model container [2021-11-07 00:54:46,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:43" (2/3) ... [2021-11-07 00:54:46,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c189bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:46, skipping insertion in model container [2021-11-07 00:54:46,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:46" (3/3) ... [2021-11-07 00:54:46,857 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2021-11-07 00:54:46,864 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 00:54:46,864 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 00:54:46,916 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 00:54:46,923 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 00:54:46,923 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 00:54:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:54:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 00:54:46,947 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:54:46,948 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:54:46,949 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:54:46,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:54:46,956 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2021-11-07 00:54:46,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 00:54:46,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449643475] [2021-11-07 00:54:46,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:54:46,974 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 00:54:46,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 00:54:46,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 00:54:46,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 00:54:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:54:47,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 00:54:47,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:54:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:54:47,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:54:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:54:47,802 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 00:54:47,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449643475] [2021-11-07 00:54:47,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449643475] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 00:54:47,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:54:47,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 00:54:47,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002890942] [2021-11-07 00:54:47,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 00:54:47,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 00:54:47,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 00:54:47,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 00:54:47,831 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 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 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:54:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:54:52,412 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2021-11-07 00:54:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 00:54:52,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 13 [2021-11-07 00:54:52,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:54:52,426 INFO L225 Difference]: With dead ends: 38 [2021-11-07 00:54:52,427 INFO L226 Difference]: Without dead ends: 22 [2021-11-07 00:54:52,430 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 00:54:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-07 00:54:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-07 00:54:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:54:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-11-07 00:54:52,461 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2021-11-07 00:54:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:54:52,462 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-11-07 00:54:52,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:54:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-11-07 00:54:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 00:54:52,463 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:54:52,463 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:54:52,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-07 00:54:52,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 00:54:52,680 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:54:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:54:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash 792769235, now seen corresponding path program 1 times [2021-11-07 00:54:52,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 00:54:52,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470262721] [2021-11-07 00:54:52,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:54:52,683 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 00:54:52,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 00:54:52,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 00:54:52,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 00:54:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:54:53,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-07 00:54:53,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:54:58,271 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-07 00:54:58,273 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 266 treesize of output 146 [2021-11-07 00:56:04,537 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= c_ULTIMATE.start_main_~main__z~0 (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)))) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 00:57:30,595 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)))) is different from false [2021-11-07 00:57:32,624 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)))) is different from true [2021-11-07 01:01:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:01:43,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:01:50,689 WARN L838 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) is different from false [2021-11-07 01:01:52,772 WARN L860 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) is different from true [2021-11-07 01:02:03,315 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) is different from false [2021-11-07 01:02:05,397 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) is different from true [2021-11-07 01:02:15,961 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (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_~#main__slope~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2021-11-07 01:02:18,049 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (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_~#main__slope~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2021-11-07 01:02:27,732 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)))) is different from false [2021-11-07 01:02:29,811 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)))) is different from true [2021-11-07 01:02:44,673 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)))) is different from false [2021-11-07 01:02:46,757 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)))) is different from true [2021-11-07 01:03:05,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse5 (select .cse6 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))) is different from false [2021-11-07 01:03:08,051 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse5 (select .cse6 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))) is different from true [2021-11-07 01:04:40,409 WARN L207 SmtUtils]: Spent 1.54 m on a formula simplification. DAG size of input: 33 DAG size of output: 11 [2021-11-07 01:04:40,410 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-11-07 01:04:40,410 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 300 treesize of output 162 [2021-11-07 01:06:12,657 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_10 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from false [2021-11-07 01:06:14,741 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_10 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-07 01:06:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:06:14,742 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:06:14,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470262721] [2021-11-07 01:06:14,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470262721] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:06:14,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:14,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-07 01:06:14,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096379371] [2021-11-07 01:06:14,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-07 01:06:14,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:06:14,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-07 01:06:14,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=63, Unknown=17, NotChecked=216, Total=342 [2021-11-07 01:06:14,748 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:06:16,890 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_10 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 01:06:18,974 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_10 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 01:06:21,010 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse3 (let ((.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (and (= (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (= (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse3 |c_ULTIMATE.start_main_#t~mem8|) (= (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse9 (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) (let ((.cse8 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse8)) (fp.sub c_currentRoundingMode .cse9 .cse8))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse9)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse11 (select .cse12 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))))) is different from false [2021-11-07 01:06:23,095 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse3 (let ((.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (and (= (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (= (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse3 |c_ULTIMATE.start_main_#t~mem8|) (= (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse9 (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) (let ((.cse8 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse8)) (fp.sub c_currentRoundingMode .cse9 .cse8))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse9)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse11 (select .cse12 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))))) is different from true [2021-11-07 01:06:25,137 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse10 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse0 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse2 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse3 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse1 |c_ULTIMATE.start_main_#t~mem9|) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse2) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from false [2021-11-07 01:06:27,220 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse10 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse0 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse2 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse3 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse1 |c_ULTIMATE.start_main_#t~mem9|) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse2) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-07 01:06:29,263 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse10 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse0 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse3 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse4 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse4))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse3) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from false [2021-11-07 01:06:31,351 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse10 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse0 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse3 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse4 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse4))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse3) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-07 01:06:34,942 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse2 (let ((.cse17 (select .cse12 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|)) (.cse13 (let ((.cse16 (select .cse10 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|))) (and (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse2) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (let ((.cse5 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse3 (let ((.cse11 (select .cse12 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse4 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse10 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse8)) (fp.sub c_currentRoundingMode .cse3 .cse8))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) (= .cse13 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse13) (= (let ((.cse14 (select .cse12 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse15 (select .cse7 |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from true [2021-11-07 01:06:38,584 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse6 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32))) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse17 (select .cse13 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|)) (.cse2 (let ((.cse16 (select .cse13 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse4 (let ((.cse15 (select .cse11 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|))) (and (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_#t~mem10| .cse2) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse5 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse9 (let ((.cse10 (select .cse11 (bvadd |c_ULTIMATE.start_main_~#main__min~0.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_~#main__slope~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse9)) (fp.sub c_currentRoundingMode .cse2 .cse9))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse4) (= (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse14 (select .cse8 |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from true [2021-11-07 01:06:40,650 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse10 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32))) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|))) (let ((.cse5 (let ((.cse16 (select .cse14 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|)) (.cse2 (let ((.cse15 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (and (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse2) (= (let ((.cse3 (select .cse4 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse5) (= (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse9 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (let ((.cse12 (let ((.cse13 (select .cse14 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse11 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse12)) (fp.sub c_currentRoundingMode .cse2 .cse12))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2021-11-07 01:06:42,738 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse10 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32))) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|))) (let ((.cse5 (let ((.cse16 (select .cse14 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|)) (.cse2 (let ((.cse15 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (and (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse2) (= (let ((.cse3 (select .cse4 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse5) (= (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse9 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (let ((.cse12 (let ((.cse13 (select .cse14 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse11 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse12)) (fp.sub c_currentRoundingMode .cse2 .cse12))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2021-11-07 01:06:44,803 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= c_ULTIMATE.start_main_~main__z~0 (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)))) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__z~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 01:06:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:06:56,029 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-11-07 01:06:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 01:06:56,032 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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 13 [2021-11-07 01:06:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:06:56,033 INFO L225 Difference]: With dead ends: 35 [2021-11-07 01:06:56,033 INFO L226 Difference]: Without dead ends: 30 [2021-11-07 01:06:56,034 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 67.9s TimeCoverageRelationStatistics Valid=62, Invalid=66, Unknown=30, NotChecked=544, Total=702 [2021-11-07 01:06:56,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-07 01:06:56,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-11-07 01:06:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:06:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-11-07 01:06:56,040 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 13 [2021-11-07 01:06:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:06:56,040 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-11-07 01:06:56,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:06:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-11-07 01:06:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:06:56,042 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:06:56,042 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:56,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-07 01:06:56,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:06:56,245 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:06:56,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:06:56,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1710804433, now seen corresponding path program 1 times [2021-11-07 01:06:56,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:06:56,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121854056] [2021-11-07 01:06:56,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:06:56,247 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:06:56,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:06:56,248 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:06:56,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f841a0a-2ad2-41d9-a861-b4d361fa6a3a/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 01:06:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:06:57,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-07 01:06:57,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:07:02,965 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-07 01:07:02,966 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 266 treesize of output 146 [2021-11-07 01:08:09,266 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)))) (and (= (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) c_ULTIMATE.start_main_~main__z~0) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (fp.geq ULTIMATE.start_main_~main__t~0 .cse2) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false