./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-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_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/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_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/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_c801687f-d862-487e-a439-235685842cf5/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 a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:04:30,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:04:30,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:04:30,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:04:30,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:04:30,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:04:30,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:04:30,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:04:30,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:04:30,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:04:30,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:04:30,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:04:30,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:04:30,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:04:30,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:04:30,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:04:30,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:04:30,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:04:30,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:04:30,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:04:30,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:04:30,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:04:30,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:04:30,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:04:30,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:04:30,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:04:30,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:04:30,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:04:30,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:04:30,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:04:30,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:04:30,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:04:30,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:04:30,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:04:30,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:04:30,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:04:30,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:04:30,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:04:30,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:04:30,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:04:30,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:04:30,905 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:04:30,950 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:04:30,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:04:30,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:04:30,952 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:04:30,952 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:04:30,952 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:04:30,952 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:04:30,953 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:04:30,953 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:04:30,953 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:04:30,960 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:04:30,960 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:04:30,961 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:04:30,961 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:04:30,961 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:04:30,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:04:30,962 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:04:30,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:04:30,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:04:30,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:04:30,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:04:30,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:04:30,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:04:30,963 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:04:30,964 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:04:30,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:04:30,964 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:04:30,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:04:30,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:04:30,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:04:30,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:04:30,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:04:30,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:04:30,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:04:30,967 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:04:30,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:04:30,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:04:30,968 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:04:30,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:04:30,968 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_c801687f-d862-487e-a439-235685842cf5/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_c801687f-d862-487e-a439-235685842cf5/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 -> a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e [2021-11-07 01:04:31,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:04:31,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:04:31,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:04:31,237 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:04:31,238 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:04:31,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2021-11-07 01:04:31,322 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/data/94bca15b0/b5d7f263008249a69bd4e979d5bedc26/FLAG7071a2b94 [2021-11-07 01:04:31,801 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:04:31,803 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2021-11-07 01:04:31,815 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/data/94bca15b0/b5d7f263008249a69bd4e979d5bedc26/FLAG7071a2b94 [2021-11-07 01:04:32,153 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/data/94bca15b0/b5d7f263008249a69bd4e979d5bedc26 [2021-11-07 01:04:32,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:04:32,157 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:04:32,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:04:32,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:04:32,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:04:32,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:32" (1/1) ... [2021-11-07 01:04:32,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79dcfb11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32, skipping insertion in model container [2021-11-07 01:04:32,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:32" (1/1) ... [2021-11-07 01:04:32,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:04:32,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:04:32,410 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_c801687f-d862-487e-a439-235685842cf5/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2021-11-07 01:04:32,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:04:32,424 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:04:32,453 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_c801687f-d862-487e-a439-235685842cf5/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2021-11-07 01:04:32,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:04:32,473 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:04:32,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32 WrapperNode [2021-11-07 01:04:32,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:04:32,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:04:32,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:04:32,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:04:32,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32" (1/1) ... [2021-11-07 01:04:32,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32" (1/1) ... [2021-11-07 01:04:32,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:04:32,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:04:32,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:04:32,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:04:32,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32" (1/1) ... [2021-11-07 01:04:32,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32" (1/1) ... [2021-11-07 01:04:32,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32" (1/1) ... [2021-11-07 01:04:32,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32" (1/1) ... [2021-11-07 01:04:32,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32" (1/1) ... [2021-11-07 01:04:32,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32" (1/1) ... [2021-11-07 01:04:32,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32" (1/1) ... [2021-11-07 01:04:32,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:04:32,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:04:32,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:04:32,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:04:32,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32" (1/1) ... [2021-11-07 01:04:32,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:04:32,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:04:32,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:04:32,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:04:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:04:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:04:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-07 01:04:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:04:32,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:04:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-07 01:04:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:04:32,921 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:04:32,921 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 01:04:32,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:32 BoogieIcfgContainer [2021-11-07 01:04:32,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:04:32,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:04:32,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:04:32,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:04:32,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:04:32" (1/3) ... [2021-11-07 01:04:32,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11208e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:32, skipping insertion in model container [2021-11-07 01:04:32,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32" (2/3) ... [2021-11-07 01:04:32,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11208e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:32, skipping insertion in model container [2021-11-07 01:04:32,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:32" (3/3) ... [2021-11-07 01:04:32,949 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+cfa-reducer.c [2021-11-07 01:04:32,960 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:04:32,960 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 01:04:33,029 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:04:33,039 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 01:04:33,040 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 01:04:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 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:04:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:04:33,064 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:33,064 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:33,065 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:33,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:33,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1392335393, now seen corresponding path program 1 times [2021-11-07 01:04:33,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:33,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066864420] [2021-11-07 01:04:33,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:33,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:33,431 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:04:33,432 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:33,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066864420] [2021-11-07 01:04:33,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066864420] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:33,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:33,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:04:33,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387087314] [2021-11-07 01:04:33,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:04:33,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:33,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:04:33,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:04:33,462 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 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.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:33,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:33,583 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2021-11-07 01:04:33,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:04:33,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 01:04:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:33,594 INFO L225 Difference]: With dead ends: 26 [2021-11-07 01:04:33,594 INFO L226 Difference]: Without dead ends: 14 [2021-11-07 01:04:33,597 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 01:04:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-07 01:04:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-07 01:04:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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 01:04:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-07 01:04:33,724 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2021-11-07 01:04:33,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:33,725 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-07 01:04:33,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-07 01:04:33,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:04:33,726 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:33,726 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:33,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:04:33,727 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:33,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1409346054, now seen corresponding path program 1 times [2021-11-07 01:04:33,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:33,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756798290] [2021-11-07 01:04:33,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:33,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:33,797 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:04:33,797 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:33,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756798290] [2021-11-07 01:04:33,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756798290] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:33,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:33,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:04:33,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929117424] [2021-11-07 01:04:33,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:04:33,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:33,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:04:33,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:04:33,802 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:33,820 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-11-07 01:04:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:04:33,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 01:04:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:33,822 INFO L225 Difference]: With dead ends: 32 [2021-11-07 01:04:33,822 INFO L226 Difference]: Without dead ends: 24 [2021-11-07 01:04:33,823 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:04:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-07 01:04:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2021-11-07 01:04:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:04:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-11-07 01:04:33,828 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-11-07 01:04:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:33,829 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-11-07 01:04:33,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:33,829 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-11-07 01:04:33,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:04:33,830 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:33,830 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:33,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:04:33,830 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:33,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:33,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1916271840, now seen corresponding path program 1 times [2021-11-07 01:04:33,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:33,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958817365] [2021-11-07 01:04:33,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:33,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:04:33,857 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:04:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:04:33,904 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:04:33,904 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:04:33,905 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:04:33,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:04:33,910 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-07 01:04:33,913 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:04:33,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:04:33 BoogieIcfgContainer [2021-11-07 01:04:33,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:04:33,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:04:33,946 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:04:33,946 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:04:33,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:32" (3/4) ... [2021-11-07 01:04:33,954 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 01:04:33,955 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:04:33,958 INFO L168 Benchmark]: Toolchain (without parser) took 1798.69 ms. Allocated memory is still 130.0 MB. Free memory was 96.2 MB in the beginning and 92.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 1.8 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:33,959 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 88.1 MB. Free memory is still 46.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:04:33,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.26 ms. Allocated memory is still 130.0 MB. Free memory was 96.0 MB in the beginning and 104.4 MB in the end (delta: -8.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:33,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.65 ms. Allocated memory is still 130.0 MB. Free memory was 104.4 MB in the beginning and 102.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:33,966 INFO L168 Benchmark]: Boogie Preprocessor took 33.01 ms. Allocated memory is still 130.0 MB. Free memory was 102.8 MB in the beginning and 101.2 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:04:33,966 INFO L168 Benchmark]: RCFGBuilder took 364.61 ms. Allocated memory is still 130.0 MB. Free memory was 101.2 MB in the beginning and 87.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:33,967 INFO L168 Benchmark]: TraceAbstraction took 1018.69 ms. Allocated memory is still 130.0 MB. Free memory was 87.2 MB in the beginning and 92.3 MB in the end (delta: -5.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:04:33,967 INFO L168 Benchmark]: Witness Printer took 8.91 ms. Allocated memory is still 130.0 MB. Free memory is still 92.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:04:33,971 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 88.1 MB. Free memory is still 46.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 315.26 ms. Allocated memory is still 130.0 MB. Free memory was 96.0 MB in the beginning and 104.4 MB in the end (delta: -8.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.65 ms. Allocated memory is still 130.0 MB. Free memory was 104.4 MB in the beginning and 102.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.01 ms. Allocated memory is still 130.0 MB. Free memory was 102.8 MB in the beginning and 101.2 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 364.61 ms. Allocated memory is still 130.0 MB. Free memory was 101.2 MB in the beginning and 87.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1018.69 ms. Allocated memory is still 130.0 MB. Free memory was 87.2 MB in the beginning and 92.3 MB in the end (delta: -5.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 8.91 ms. Allocated memory is still 130.0 MB. Free memory is still 92.3 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 35, 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_129; [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_129=0, __return_main=0] [L24] COND TRUE main__t >= (main__min[0]) [L26] EXPR main__max[4UL] VAL [__return_129=0, __return_main=0] [L26] COND TRUE main__t <= (main__max[4UL]) [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_129=0, __return_main=0] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_129=0, __return_main=0] [L33] COND TRUE main__i < 5UL [L35] EXPR main__max[main__i] VAL [__return_129=0, __return_main=0] [L35] 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_129=0, __return_main=0] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_129=0, __return_main=0] [L66] main____CPAchecker_TMP_1 = 0 VAL [__return_129=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_129=0, __return_main=0] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_129=0, __return_main=0] [L53] reach_error() VAL [__return_129=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, 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, 35 SDslu, 47 SDs, 0 SdLazy, 19 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 30 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 01:04:34,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/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_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/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_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/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_c801687f-d862-487e-a439-235685842cf5/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 a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:04:36,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:04:36,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:04:36,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:04:36,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:04:36,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:04:36,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:04:36,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:04:36,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:04:36,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:04:36,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:04:36,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:04:36,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:04:36,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:04:36,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:04:36,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:04:36,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:04:36,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:04:36,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:04:36,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:04:36,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:04:36,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:04:36,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:04:36,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:04:36,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:04:36,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:04:36,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:04:36,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:04:36,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:04:36,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:04:36,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:04:36,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:04:36,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:04:36,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:04:36,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:04:36,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:04:36,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:04:36,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:04:36,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:04:36,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:04:36,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:04:36,738 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-07 01:04:36,786 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:04:36,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:04:36,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:04:36,788 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:04:36,788 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:04:36,789 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:04:36,789 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:04:36,789 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:04:36,790 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:04:36,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:04:36,793 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:04:36,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:04:36,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:04:36,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:04:36,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:04:36,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:04:36,794 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:04:36,795 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 01:04:36,795 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 01:04:36,795 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:04:36,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:04:36,796 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:04:36,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:04:36,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:04:36,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 01:04:36,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:04:36,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:04:36,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:04:36,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:04:36,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:04:36,798 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-07 01:04:36,799 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 01:04:36,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:04:36,799 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:04:36,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:04:36,800 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_c801687f-d862-487e-a439-235685842cf5/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_c801687f-d862-487e-a439-235685842cf5/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 -> a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e [2021-11-07 01:04:37,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:04:37,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:04:37,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:04:37,279 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:04:37,280 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:04:37,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2021-11-07 01:04:37,362 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/data/d7e778f07/32fa25fa400b4f428776aacfcf487725/FLAG7f361d40d [2021-11-07 01:04:37,871 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:04:37,872 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2021-11-07 01:04:37,885 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/data/d7e778f07/32fa25fa400b4f428776aacfcf487725/FLAG7f361d40d [2021-11-07 01:04:38,260 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/data/d7e778f07/32fa25fa400b4f428776aacfcf487725 [2021-11-07 01:04:38,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:04:38,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:04:38,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:04:38,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:04:38,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:04:38,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:38" (1/1) ... [2021-11-07 01:04:38,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2b9f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38, skipping insertion in model container [2021-11-07 01:04:38,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:38" (1/1) ... [2021-11-07 01:04:38,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:04:38,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:04:38,450 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_c801687f-d862-487e-a439-235685842cf5/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2021-11-07 01:04:38,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:04:38,479 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:04:38,507 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_c801687f-d862-487e-a439-235685842cf5/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2021-11-07 01:04:38,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:04:38,554 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:04:38,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38 WrapperNode [2021-11-07 01:04:38,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:04:38,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:04:38,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:04:38,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:04:38,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38" (1/1) ... [2021-11-07 01:04:38,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38" (1/1) ... [2021-11-07 01:04:38,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:04:38,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:04:38,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:04:38,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:04:38,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38" (1/1) ... [2021-11-07 01:04:38,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38" (1/1) ... [2021-11-07 01:04:38,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38" (1/1) ... [2021-11-07 01:04:38,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38" (1/1) ... [2021-11-07 01:04:38,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38" (1/1) ... [2021-11-07 01:04:38,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38" (1/1) ... [2021-11-07 01:04:38,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38" (1/1) ... [2021-11-07 01:04:38,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:04:38,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:04:38,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:04:38,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:04:38,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38" (1/1) ... [2021-11-07 01:04:38,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:04:38,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:04:38,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:04:38,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:04:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-07 01:04:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 01:04:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:04:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-07 01:04:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:04:38,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:04:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:04:41,650 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:04:41,651 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 01:04:41,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:41 BoogieIcfgContainer [2021-11-07 01:04:41,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:04:41,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:04:41,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:04:41,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:04:41,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:04:38" (1/3) ... [2021-11-07 01:04:41,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13973102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:41, skipping insertion in model container [2021-11-07 01:04:41,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:38" (2/3) ... [2021-11-07 01:04:41,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13973102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:41, skipping insertion in model container [2021-11-07 01:04:41,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:41" (3/3) ... [2021-11-07 01:04:41,688 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+cfa-reducer.c [2021-11-07 01:04:41,694 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:04:41,694 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 01:04:41,736 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:04:41,743 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 01:04:41,743 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 01:04:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:04:41,763 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:41,764 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:41,764 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2021-11-07 01:04:41,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:04:41,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241862587] [2021-11-07 01:04:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:41,785 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:04:41,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:04:41,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:04:41,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 01:04:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:42,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:04:42,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:04:42,423 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:04:42,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:04:42,520 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:04:42,521 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:04:42,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241862587] [2021-11-07 01:04:42,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241862587] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:42,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:42,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 01:04:42,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300810244] [2021-11-07 01:04:42,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:04:42,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:04:42,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:04:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:04:42,550 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:04:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:44,976 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-11-07 01:04:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:04:44,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 01:04:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:44,990 INFO L225 Difference]: With dead ends: 34 [2021-11-07 01:04:44,990 INFO L226 Difference]: Without dead ends: 20 [2021-11-07 01:04:44,994 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:04:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-07 01:04:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-11-07 01:04:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-11-07 01:04:45,034 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2021-11-07 01:04:45,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:45,035 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-07 01:04:45,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:04:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-11-07 01:04:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:04:45,036 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:45,037 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:45,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:04:45,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:04:45,260 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:45,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash -859311250, now seen corresponding path program 1 times [2021-11-07 01:04:45,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:04:45,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40813026] [2021-11-07 01:04:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:45,262 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:04:45,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:04:45,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:04:45,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 01:04:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:45,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 01:04:45,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:04:45,904 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:04:45,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:04:46,028 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:04:46,029 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:04:46,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40813026] [2021-11-07 01:04:46,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40813026] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:46,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:46,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 01:04:46,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552244825] [2021-11-07 01:04:46,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:04:46,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:04:46,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:04:46,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:04:46,035 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. 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 01:04:50,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:50,444 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-11-07 01:04:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:04:50,445 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 01:04:50,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:50,446 INFO L225 Difference]: With dead ends: 22 [2021-11-07 01:04:50,446 INFO L226 Difference]: Without dead ends: 18 [2021-11-07 01:04:50,447 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 01:04:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-07 01:04:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-07 01:04:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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:04:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2021-11-07 01:04:50,452 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2021-11-07 01:04:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:50,453 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2021-11-07 01:04:50,453 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 01:04:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2021-11-07 01:04:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:04:50,454 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:50,455 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:50,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:04:50,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:04:50,674 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:50,675 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2021-11-07 01:04:50,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:04:50,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382509685] [2021-11-07 01:04:50,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:50,676 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:04:50,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:04:50,678 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:04:50,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 01:04:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:51,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-07 01:04:51,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:05:01,051 WARN L207 SmtUtils]: Spent 6.75 s on a formula simplification. DAG size of input: 33 DAG size of output: 17 [2021-11-07 01:05:01,052 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-07 01:05:01,053 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:06:06,545 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 01:07:30,978 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 01:07:33,004 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:08:56,325 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)))) (= ((_ 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 01:08:58,353 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)))) (= ((_ 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:11:31,193 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:11:31,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:11:38,728 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:11:40,822 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:11:51,378 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:11:53,465 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:12:04,015 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:12:06,097 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:12:16,664 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:12:18,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 .cse3)))) is different from true [2021-11-07 01:12:33,669 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:12:35,765 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:12:55,087 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:12:57,179 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:14:29,533 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:14:29,534 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-11-07 01:14:29,535 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:16:11,534 WARN L838 $PredicateComparison]: unable to prove that (or (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))))) (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 ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (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_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (or (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0)) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) is different from false [2021-11-07 01:16:13,613 WARN L860 $PredicateComparison]: unable to prove that (or (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))))) (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 ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (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_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (or (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0)) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) is different from true [2021-11-07 01:16:13,614 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:16:13,614 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:16:13,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382509685] [2021-11-07 01:16:13,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382509685] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:16:13,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:16:13,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 19 [2021-11-07 01:16:13,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870452329] [2021-11-07 01:16:13,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-07 01:16:13,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:16:13,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-07 01:16:13,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=63, Unknown=19, NotChecked=250, Total=380 [2021-11-07 01:16:13,621 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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:16:15,759 WARN L838 $PredicateComparison]: unable to prove that (and (or (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))))) (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 ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (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_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (or (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0)) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 01:16:17,856 WARN L860 $PredicateComparison]: unable to prove that (and (or (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))))) (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 ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (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_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (or (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse1)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0)) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 01:16:19,889 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:16:21,967 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:16:24,013 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:16:26,091 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:16:28,129 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:16:30,211 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:16:32,251 WARN L838 $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 false [2021-11-07 01:16:34,342 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:16:36,401 WARN L838 $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 false [2021-11-07 01:16:38,483 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:16:40,557 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:16:42,656 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:16:44,722 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:16:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:16:58,249 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2021-11-07 01:16:58,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 01:16:58,255 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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:16:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:16:58,256 INFO L225 Difference]: With dead ends: 31 [2021-11-07 01:16:58,256 INFO L226 Difference]: Without dead ends: 26 [2021-11-07 01:16:58,257 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 73.0s TimeCoverageRelationStatistics Valid=64, Invalid=64, Unknown=34, NotChecked=594, Total=756 [2021-11-07 01:16:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-07 01:16:58,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2021-11-07 01:16:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:16:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-07 01:16:58,263 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-11-07 01:16:58,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:16:58,264 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-07 01:16:58,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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:16:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-07 01:16:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:16:58,265 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:16:58,265 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:16:58,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-07 01:16:58,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:16:58,482 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:16:58,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:16:58,483 INFO L85 PathProgramCache]: Analyzing trace with hash -858361424, now seen corresponding path program 1 times [2021-11-07 01:16:58,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:16:58,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965291668] [2021-11-07 01:16:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:16:58,484 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:16:58,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:16:58,485 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:16:58,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c801687f-d862-487e-a439-235685842cf5/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 01:16:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:16:59,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-07 01:16:59,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:06,049 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-07 01:17:06,050 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:18:08,760 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