./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH --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 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 04:56:53,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:56:53,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:56:53,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:56:53,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:56:53,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:56:53,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:56:53,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:56:53,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:56:53,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:56:53,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:56:53,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:56:53,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:56:53,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:56:53,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:56:53,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:56:53,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:56:53,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:56:53,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:56:53,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:56:53,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:56:53,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:56:53,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:56:53,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:56:53,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:56:53,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:56:53,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:56:53,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:56:53,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:56:53,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:56:53,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:56:53,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:56:53,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:56:53,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:56:53,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:56:53,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:56:53,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:56:53,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:56:53,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:56:53,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:56:53,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:56:53,334 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 04:56:53,390 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:56:53,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:56:53,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:56:53,394 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:56:53,394 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:56:53,394 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:56:53,395 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 04:56:53,395 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:56:53,395 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:56:53,396 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 04:56:53,397 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 04:56:53,397 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:56:53,398 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 04:56:53,398 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 04:56:53,398 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 04:56:53,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:56:53,400 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:56:53,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:56:53,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:56:53,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:56:53,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:56:53,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:56:53,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:56:53,402 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 04:56:53,402 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:56:53,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:56:53,403 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:56:53,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:56:53,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:56:53,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:56:53,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:56:53,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:56:53,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:56:53,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:56:53,407 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 04:56:53,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:56:53,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:56:53,408 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:56:53,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:56:53,409 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_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/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_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH 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 -> 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 [2021-11-03 04:56:53,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:56:53,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:56:53,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:56:53,780 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:56:53,781 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:56:53,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2021-11-03 04:56:53,884 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/data/5aa61ab8b/0e96bed3178c4894aa31a0998b10ca1f/FLAG06de4e964 [2021-11-03 04:56:54,577 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:56:54,578 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2021-11-03 04:56:54,592 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/data/5aa61ab8b/0e96bed3178c4894aa31a0998b10ca1f/FLAG06de4e964 [2021-11-03 04:56:54,882 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/data/5aa61ab8b/0e96bed3178c4894aa31a0998b10ca1f [2021-11-03 04:56:54,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:56:54,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:56:54,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:56:54,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:56:54,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:56:54,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:56:54" (1/1) ... [2021-11-03 04:56:54,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c2945c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:54, skipping insertion in model container [2021-11-03 04:56:54,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:56:54" (1/1) ... [2021-11-03 04:56:54,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:56:54,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:56:55,170 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_955c517d-2d23-4109-ab5b-c3d3a1b09c46/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c[1455,1468] [2021-11-03 04:56:55,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:56:55,186 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:56:55,216 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_955c517d-2d23-4109-ab5b-c3d3a1b09c46/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c[1455,1468] [2021-11-03 04:56:55,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:56:55,246 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:56:55,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:55 WrapperNode [2021-11-03 04:56:55,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:56:55,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:56:55,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:56:55,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:56:55,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:55" (1/1) ... [2021-11-03 04:56:55,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:55" (1/1) ... [2021-11-03 04:56:55,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:56:55,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:56:55,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:56:55,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:56:55,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:55" (1/1) ... [2021-11-03 04:56:55,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:55" (1/1) ... [2021-11-03 04:56:55,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:55" (1/1) ... [2021-11-03 04:56:55,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:55" (1/1) ... [2021-11-03 04:56:55,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:55" (1/1) ... [2021-11-03 04:56:55,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:55" (1/1) ... [2021-11-03 04:56:55,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:55" (1/1) ... [2021-11-03 04:56:55,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:56:55,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:56:55,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:56:55,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:56:55,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:55" (1/1) ... [2021-11-03 04:56:55,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:56:55,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:56:55,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:56:55,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:56:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:56:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:56:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-03 04:56:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:56:55,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:56:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-03 04:56:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 04:56:55,866 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:56:55,867 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-03 04:56:55,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:56:55 BoogieIcfgContainer [2021-11-03 04:56:55,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:56:55,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:56:55,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:56:55,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:56:55,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:56:54" (1/3) ... [2021-11-03 04:56:55,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6021aaee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:56:55, skipping insertion in model container [2021-11-03 04:56:55,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:56:55" (2/3) ... [2021-11-03 04:56:55,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6021aaee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:56:55, skipping insertion in model container [2021-11-03 04:56:55,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:56:55" (3/3) ... [2021-11-03 04:56:55,881 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.p+cfa-reducer.c [2021-11-03 04:56:55,888 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:56:55,888 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 04:56:55,999 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:56:56,008 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-03 04:56:56,009 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 04:56:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 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-03 04:56:56,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 04:56:56,034 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:56:56,035 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:56:56,036 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:56:56,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:56:56,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1338621212, now seen corresponding path program 1 times [2021-11-03 04:56:56,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:56:56,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349334830] [2021-11-03 04:56:56,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:56:56,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:56:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:56:56,405 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-03 04:56:56,406 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:56:56,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349334830] [2021-11-03 04:56:56,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349334830] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:56:56,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:56:56,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:56:56,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707321486] [2021-11-03 04:56:56,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:56:56,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:56:56,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:56:56,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:56:56,468 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 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-03 04:56:56,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:56:56,632 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2021-11-03 04:56:56,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 04:56:56,636 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-03 04:56:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:56:56,650 INFO L225 Difference]: With dead ends: 44 [2021-11-03 04:56:56,651 INFO L226 Difference]: Without dead ends: 26 [2021-11-03 04:56:56,656 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:56:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-03 04:56:56,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2021-11-03 04:56:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-03 04:56:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2021-11-03 04:56:56,693 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 11 [2021-11-03 04:56:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:56:56,693 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-11-03 04:56:56,694 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-03 04:56:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-11-03 04:56:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 04:56:56,694 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:56:56,695 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:56:56,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:56:56,695 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:56:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:56:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1321610551, now seen corresponding path program 1 times [2021-11-03 04:56:56,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:56:56,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471065330] [2021-11-03 04:56:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:56:56,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:56:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:56:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:56:56,779 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:56:56,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471065330] [2021-11-03 04:56:56,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471065330] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:56:56,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:56:56,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:56:56,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95231847] [2021-11-03 04:56:56,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:56:56,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:56:56,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:56:56,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:56:56,784 INFO L87 Difference]: Start difference. First operand 15 states and 19 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-03 04:56:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:56:56,816 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-11-03 04:56:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:56:56,817 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-03 04:56:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:56:56,820 INFO L225 Difference]: With dead ends: 33 [2021-11-03 04:56:56,820 INFO L226 Difference]: Without dead ends: 25 [2021-11-03 04:56:56,822 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-03 04:56:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-03 04:56:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2021-11-03 04:56:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:56:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2021-11-03 04:56:56,832 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2021-11-03 04:56:56,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:56:56,833 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-11-03 04:56:56,833 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-03 04:56:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2021-11-03 04:56:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 04:56:56,835 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:56:56,835 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:56:56,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:56:56,838 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:56:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:56:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1139004290, now seen corresponding path program 1 times [2021-11-03 04:56:56,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:56:56,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230747969] [2021-11-03 04:56:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:56:56,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:56:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:56:56,914 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 04:56:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:56:57,010 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 04:56:57,014 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 04:56:57,015 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 04:56:57,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 04:56:57,022 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-03 04:56:57,026 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 04:56:57,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:56:57 BoogieIcfgContainer [2021-11-03 04:56:57,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 04:56:57,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 04:56:57,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 04:56:57,073 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 04:56:57,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:56:55" (3/4) ... [2021-11-03 04:56:57,078 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-03 04:56:57,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 04:56:57,081 INFO L168 Benchmark]: Toolchain (without parser) took 2192.47 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 58.6 MB in the beginning and 42.4 MB in the end (delta: 16.2 MB). Peak memory consumption was 39.0 MB. Max. memory is 16.1 GB. [2021-11-03 04:56:57,082 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 94.4 MB. Free memory was 66.9 MB in the beginning and 66.9 MB in the end (delta: 31.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:56:57,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.31 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 58.4 MB in the beginning and 93.3 MB in the end (delta: -34.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 04:56:57,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.55 ms. Allocated memory is still 119.5 MB. Free memory was 93.3 MB in the beginning and 91.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:56:57,085 INFO L168 Benchmark]: Boogie Preprocessor took 36.78 ms. Allocated memory is still 119.5 MB. Free memory was 91.7 MB in the beginning and 90.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:56:57,086 INFO L168 Benchmark]: RCFGBuilder took 497.19 ms. Allocated memory is still 119.5 MB. Free memory was 90.2 MB in the beginning and 77.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-03 04:56:57,087 INFO L168 Benchmark]: TraceAbstraction took 1199.58 ms. Allocated memory is still 119.5 MB. Free memory was 76.5 MB in the beginning and 42.9 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2021-11-03 04:56:57,088 INFO L168 Benchmark]: Witness Printer took 6.12 ms. Allocated memory is still 119.5 MB. Free memory was 42.9 MB in the beginning and 42.4 MB in the end (delta: 558.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:56:57,094 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.32 ms. Allocated memory is still 94.4 MB. Free memory was 66.9 MB in the beginning and 66.9 MB in the end (delta: 31.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 352.31 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 58.4 MB in the beginning and 93.3 MB in the end (delta: -34.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 76.55 ms. Allocated memory is still 119.5 MB. Free memory was 93.3 MB in the beginning and 91.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.78 ms. Allocated memory is still 119.5 MB. Free memory was 91.7 MB in the beginning and 90.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 497.19 ms. Allocated memory is still 119.5 MB. Free memory was 90.2 MB in the beginning and 77.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1199.58 ms. Allocated memory is still 119.5 MB. Free memory was 76.5 MB in the beginning and 42.9 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. * Witness Printer took 6.12 ms. Allocated memory is still 119.5 MB. Free memory was 42.9 MB in the beginning and 42.4 MB in the end (delta: 558.3 kB). 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 17, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L1] int __return_main; [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] main__t = __VERIFIER_nondet_float() [L22] int main____CPAchecker_TMP_0; [L23] EXPR main__min[0] VAL [__return_main=0] [L23] COND TRUE main__t >= (main__min[0]) [L25] EXPR main__max[4UL] VAL [__return_main=0] [L25] COND TRUE main__t <= (main__max[4UL]) [L27] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_main=0] [L33] COND TRUE main__i < 5UL [L35] EXPR main__max[main__i] VAL [__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_main=0] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_main=0] [L65] main____CPAchecker_TMP_1 = 0 VAL [__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_main=0] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L53] reach_error() VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 38 SDtfs, 41 SDslu, 67 SDs, 0 SdLazy, 24 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 20 StatesRemovedByMinimization, 2 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-03 04:56:57,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/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_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH --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 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 04:57:00,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:57:00,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:57:00,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:57:00,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:57:00,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:57:00,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:57:00,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:57:00,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:57:00,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:57:00,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:57:00,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:57:00,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:57:00,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:57:00,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:57:00,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:57:00,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:57:00,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:57:00,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:57:00,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:57:00,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:57:00,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:57:00,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:57:00,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:57:00,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:57:00,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:57:00,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:57:00,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:57:00,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:57:00,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:57:00,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:57:00,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:57:00,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:57:00,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:57:00,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:57:00,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:57:00,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:57:00,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:57:00,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:57:00,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:57:00,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:57:00,421 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-03 04:57:00,477 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:57:00,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:57:00,480 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:57:00,480 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:57:00,480 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:57:00,481 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:57:00,481 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:57:00,481 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:57:00,482 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:57:00,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:57:00,486 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:57:00,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:57:00,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:57:00,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:57:00,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:57:00,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:57:00,488 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 04:57:00,488 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-03 04:57:00,488 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-03 04:57:00,489 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:57:00,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:57:00,489 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:57:00,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:57:00,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:57:00,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 04:57:00,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:57:00,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:57:00,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:57:00,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:57:00,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:57:00,492 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-03 04:57:00,492 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-03 04:57:00,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:57:00,493 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:57:00,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:57:00,494 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_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/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_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH 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 -> 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 [2021-11-03 04:57:00,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:57:00,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:57:00,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:57:00,987 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:57:00,988 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:57:00,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2021-11-03 04:57:01,087 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/data/8052cf3d1/e7ddc904fc2240718b2a3dd27a2e7133/FLAG129f7ffcd [2021-11-03 04:57:01,834 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:57:01,834 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2021-11-03 04:57:01,843 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/data/8052cf3d1/e7ddc904fc2240718b2a3dd27a2e7133/FLAG129f7ffcd [2021-11-03 04:57:02,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/data/8052cf3d1/e7ddc904fc2240718b2a3dd27a2e7133 [2021-11-03 04:57:02,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:57:02,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:57:02,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:57:02,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:57:02,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:57:02,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:57:02" (1/1) ... [2021-11-03 04:57:02,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a54e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02, skipping insertion in model container [2021-11-03 04:57:02,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:57:02" (1/1) ... [2021-11-03 04:57:02,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:57:02,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:57:02,465 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_955c517d-2d23-4109-ab5b-c3d3a1b09c46/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c[1455,1468] [2021-11-03 04:57:02,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:57:02,488 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:57:02,533 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_955c517d-2d23-4109-ab5b-c3d3a1b09c46/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c[1455,1468] [2021-11-03 04:57:02,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:57:02,600 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:57:02,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02 WrapperNode [2021-11-03 04:57:02,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:57:02,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:57:02,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:57:02,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:57:02,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02" (1/1) ... [2021-11-03 04:57:02,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02" (1/1) ... [2021-11-03 04:57:02,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:57:02,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:57:02,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:57:02,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:57:02,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02" (1/1) ... [2021-11-03 04:57:02,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02" (1/1) ... [2021-11-03 04:57:02,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02" (1/1) ... [2021-11-03 04:57:02,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02" (1/1) ... [2021-11-03 04:57:02,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02" (1/1) ... [2021-11-03 04:57:02,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02" (1/1) ... [2021-11-03 04:57:02,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02" (1/1) ... [2021-11-03 04:57:02,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:57:02,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:57:02,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:57:02,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:57:02,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02" (1/1) ... [2021-11-03 04:57:02,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:57:02,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:57:02,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:57:02,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:57:02,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-03 04:57:02,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-03 04:57:02,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:57:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-03 04:57:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:57:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:57:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 04:57:05,911 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:57:05,911 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-03 04:57:05,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:57:05 BoogieIcfgContainer [2021-11-03 04:57:05,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:57:05,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:57:05,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:57:05,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:57:05,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:57:02" (1/3) ... [2021-11-03 04:57:05,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22514917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:57:05, skipping insertion in model container [2021-11-03 04:57:05,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:57:02" (2/3) ... [2021-11-03 04:57:05,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22514917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:57:05, skipping insertion in model container [2021-11-03 04:57:05,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:57:05" (3/3) ... [2021-11-03 04:57:05,924 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.p+cfa-reducer.c [2021-11-03 04:57:05,931 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:57:05,931 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 04:57:05,982 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:57:05,990 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-03 04:57:05,990 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 04:57:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:57:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 04:57:06,012 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:57:06,013 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:57:06,013 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:57:06,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:57:06,020 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2021-11-03 04:57:06,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:57:06,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753500136] [2021-11-03 04:57:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:57:06,037 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:57:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:57:06,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:57:06,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-03 04:57:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:57:06,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 04:57:06,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:57:06,796 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-03 04:57:06,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:57:06,924 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-03 04:57:06,925 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:57:06,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753500136] [2021-11-03 04:57:06,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753500136] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 04:57:06,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:57:06,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-03 04:57:06,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619876457] [2021-11-03 04:57:06,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:57:06,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 04:57:06,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:57:06,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:57:06,953 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-03 04:57:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:57:09,366 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2021-11-03 04:57:09,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:57:09,371 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-03 04:57:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:57:09,381 INFO L225 Difference]: With dead ends: 35 [2021-11-03 04:57:09,381 INFO L226 Difference]: Without dead ends: 21 [2021-11-03 04:57:09,384 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-03 04:57:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-03 04:57:09,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2021-11-03 04:57:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 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-03 04:57:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2021-11-03 04:57:09,434 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 12 [2021-11-03 04:57:09,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:57:09,434 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-11-03 04:57:09,435 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-03 04:57:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2021-11-03 04:57:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 04:57:09,436 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:57:09,436 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:57:09,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-03 04:57:09,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 04:57:09,657 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:57:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:57:09,658 INFO L85 PathProgramCache]: Analyzing trace with hash -6868241, now seen corresponding path program 1 times [2021-11-03 04:57:09,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:57:09,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673293557] [2021-11-03 04:57:09,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:57:09,659 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:57:09,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:57:09,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:57:09,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-03 04:57:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:57:10,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-03 04:57:10,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:57:10,243 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-03 04:57:10,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:57:10,391 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-03 04:57:10,391 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 04:57:10,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673293557] [2021-11-03 04:57:10,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673293557] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 04:57:10,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:57:10,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-03 04:57:10,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147088213] [2021-11-03 04:57:10,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:57:10,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 04:57:10,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:57:10,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:57:10,397 INFO L87 Difference]: Start difference. First operand 19 states and 25 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-03 04:57:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:57:14,940 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-11-03 04:57:14,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:57:14,941 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-03 04:57:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:57:14,942 INFO L225 Difference]: With dead ends: 23 [2021-11-03 04:57:14,942 INFO L226 Difference]: Without dead ends: 19 [2021-11-03 04:57:14,943 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-03 04:57:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-03 04:57:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-03 04:57:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-03 04:57:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-11-03 04:57:14,947 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2021-11-03 04:57:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:57:14,947 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-11-03 04:57:14,947 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-03 04:57:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2021-11-03 04:57:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 04:57:14,948 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:57:14,948 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:57:14,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-03 04:57:15,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 04:57:15,149 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:57:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:57:15,150 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2021-11-03 04:57:15,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 04:57:15,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852155895] [2021-11-03 04:57:15,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:57:15,152 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 04:57:15,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 04:57:15,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 04:57:15,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-03 04:57:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:57:15,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-03 04:57:15,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:57:22,904 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-03 04:57:22,906 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-03 04:58:30,707 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-03 04:59:56,563 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-03 04:59:58,602 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-03 05:04:06,180 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-03 05:04:06,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:04:14,251 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-03 05:04:16,343 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-03 05:04:26,980 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-03 05:04:29,076 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-03 05:04:39,736 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-03 05:04:41,835 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-03 05:04:52,491 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-03 05:04:54,591 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-03 05:05:09,600 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-03 05:05:11,696 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-03 05:05:31,152 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-03 05:05:33,246 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-03 05:07:05,609 WARN L207 SmtUtils]: Spent 1.54 m on a formula simplification. DAG size of input: 33 DAG size of output: 11 [2021-11-03 05:07:05,610 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-11-03 05:07:05,610 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-03 05:08:40,754 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_10 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.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_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (or (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0)) (fp.sub c_currentRoundingMode .cse3 .cse0)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse2)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_8 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from false [2021-11-03 05:08:42,843 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_10 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.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_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (or (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0)) (fp.sub c_currentRoundingMode .cse3 .cse0)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse2)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_8 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-03 05:08:42,844 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-03 05:08:42,844 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 05:08:42,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852155895] [2021-11-03 05:08:42,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852155895] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 05:08:42,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:08:42,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-03 05:08:42,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293788098] [2021-11-03 05:08:42,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-03 05:08:42,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 05:08:42,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-03 05:08:42,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=63, Unknown=17, NotChecked=216, Total=342 [2021-11-03 05:08:42,849 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:08:45,157 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_10 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.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_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (or (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0)) (fp.sub c_currentRoundingMode .cse3 .cse0)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse2)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_8 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-03 05:08:47,254 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_10 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.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_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (or (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse0)) (fp.sub c_currentRoundingMode .cse3 .cse0)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse2)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_8 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-03 05:08:49,293 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-03 05:08:51,383 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-03 05:08:53,428 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-03 05:08:55,522 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-03 05:08:57,569 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-03 05:08:59,659 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-03 05:09:03,729 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-03 05:09:05,780 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-03 05:09:07,871 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-03 05:09:09,993 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-03 05:09:12,084 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-03 05:09:14,226 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-03 05:09:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:09:29,382 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2021-11-03 05:09:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:09:29,388 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 05:09:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:09:29,389 INFO L225 Difference]: With dead ends: 35 [2021-11-03 05:09:29,389 INFO L226 Difference]: Without dead ends: 30 [2021-11-03 05:09:29,391 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 69.6s TimeCoverageRelationStatistics Valid=62, Invalid=65, Unknown=31, NotChecked=544, Total=702 [2021-11-03 05:09:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-03 05:09:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-11-03 05:09:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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-03 05:09:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2021-11-03 05:09:29,398 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2021-11-03 05:09:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:09:29,398 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2021-11-03 05:09:29,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:09:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2021-11-03 05:09:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 05:09:29,399 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:09:29,400 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:09:29,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-03 05:09:29,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 05:09:29,601 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:09:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:09:29,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2097179417, now seen corresponding path program 1 times [2021-11-03 05:09:29,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 05:09:29,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887604922] [2021-11-03 05:09:29,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:09:29,602 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 05:09:29,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 05:09:29,603 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 05:09:29,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-03 05:09:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:09:30,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 05:09:30,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:09:30,248 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-03 05:09:30,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:09:30,344 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-03 05:09:30,344 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 05:09:30,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887604922] [2021-11-03 05:09:30,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887604922] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 05:09:30,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:09:30,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-03 05:09:30,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967697726] [2021-11-03 05:09:30,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:09:30,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 05:09:30,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:09:30,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:09:30,347 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-03 05:09:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:09:30,392 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-11-03 05:09:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:09:30,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-03 05:09:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:09:30,394 INFO L225 Difference]: With dead ends: 35 [2021-11-03 05:09:30,394 INFO L226 Difference]: Without dead ends: 20 [2021-11-03 05:09:30,395 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-03 05:09:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-03 05:09:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-03 05:09:30,399 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-03 05:09:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-03 05:09:30,400 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-11-03 05:09:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:09:30,401 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-03 05:09:30,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-03 05:09:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-03 05:09:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 05:09:30,402 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:09:30,402 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:09:30,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-03 05:09:30,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 05:09:30,603 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:09:30,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:09:30,603 INFO L85 PathProgramCache]: Analyzing trace with hash -202431920, now seen corresponding path program 1 times [2021-11-03 05:09:30,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 05:09:30,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650945192] [2021-11-03 05:09:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:09:30,604 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 05:09:30,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 05:09:30,605 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 05:09:30,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955c517d-2d23-4109-ab5b-c3d3a1b09c46/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-03 05:09:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:09:31,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-03 05:09:31,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:09:40,103 WARN L207 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 33 DAG size of output: 17 [2021-11-03 05:09:40,104 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-03 05:09:40,104 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-03 05:10:38,917 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