./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF --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 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-12 22:23:12,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-12 22:23:12,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-12 22:23:12,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-12 22:23:12,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-12 22:23:12,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-12 22:23:12,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-12 22:23:12,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-12 22:23:12,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-12 22:23:12,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-12 22:23:12,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-12 22:23:12,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-12 22:23:12,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-12 22:23:12,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-12 22:23:12,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-12 22:23:12,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-12 22:23:12,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-12 22:23:12,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-12 22:23:12,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-12 22:23:12,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-12 22:23:12,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-12 22:23:12,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-12 22:23:12,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-12 22:23:12,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-12 22:23:12,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-12 22:23:12,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-12 22:23:12,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-12 22:23:12,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-12 22:23:12,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-12 22:23:12,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-12 22:23:12,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-12 22:23:12,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-12 22:23:12,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-12 22:23:12,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-12 22:23:12,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-12 22:23:12,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-12 22:23:12,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-12 22:23:12,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-12 22:23:12,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-12 22:23:12,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-12 22:23:12,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-12 22:23:12,370 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-12 22:23:12,417 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-12 22:23:12,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-12 22:23:12,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-12 22:23:12,419 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-12 22:23:12,419 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-12 22:23:12,419 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-12 22:23:12,420 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-12 22:23:12,420 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-12 22:23:12,420 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-12 22:23:12,420 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-12 22:23:12,421 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-12 22:23:12,421 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-12 22:23:12,422 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-12 22:23:12,422 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-12 22:23:12,422 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-12 22:23:12,422 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-12 22:23:12,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-12 22:23:12,423 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-12 22:23:12,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-12 22:23:12,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-12 22:23:12,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-12 22:23:12,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-12 22:23:12,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-12 22:23:12,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-12 22:23:12,425 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-12 22:23:12,425 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-12 22:23:12,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-12 22:23:12,426 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-12 22:23:12,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-12 22:23:12,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-12 22:23:12,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-12 22:23:12,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 22:23:12,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-12 22:23:12,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-12 22:23:12,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-12 22:23:12,429 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-12 22:23:12,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-12 22:23:12,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-12 22:23:12,430 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-12 22:23:12,430 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-12 22:23:12,430 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_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/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_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2021-11-12 22:23:12,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-12 22:23:12,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-12 22:23:12,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-12 22:23:12,766 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-12 22:23:12,767 INFO L275 PluginConnector]: CDTParser initialized [2021-11-12 22:23:12,768 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/float-benchs/interpolation.c [2021-11-12 22:23:12,852 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/data/fb2e49817/e08e4d0930bc4064b8c3e4c3b02c667d/FLAG83eae220e [2021-11-12 22:23:13,331 INFO L306 CDTParser]: Found 1 translation units. [2021-11-12 22:23:13,333 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/sv-benchmarks/c/float-benchs/interpolation.c [2021-11-12 22:23:13,343 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/data/fb2e49817/e08e4d0930bc4064b8c3e4c3b02c667d/FLAG83eae220e [2021-11-12 22:23:13,686 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/data/fb2e49817/e08e4d0930bc4064b8c3e4c3b02c667d [2021-11-12 22:23:13,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-12 22:23:13,689 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-12 22:23:13,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-12 22:23:13,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-12 22:23:13,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-12 22:23:13,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 10:23:13" (1/1) ... [2021-11-12 22:23:13,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5489c80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13, skipping insertion in model container [2021-11-12 22:23:13,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 10:23:13" (1/1) ... [2021-11-12 22:23:13,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-12 22:23:13,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-12 22:23:13,915 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_518d849e-5381-4490-b863-8663b068c9d8/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-12 22:23:13,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 22:23:13,944 INFO L203 MainTranslator]: Completed pre-run [2021-11-12 22:23:13,957 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_518d849e-5381-4490-b863-8663b068c9d8/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-12 22:23:13,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 22:23:13,981 INFO L208 MainTranslator]: Completed translation [2021-11-12 22:23:13,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13 WrapperNode [2021-11-12 22:23:13,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-12 22:23:13,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-12 22:23:13,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-12 22:23:13,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-12 22:23:13,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13" (1/1) ... [2021-11-12 22:23:14,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13" (1/1) ... [2021-11-12 22:23:14,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-12 22:23:14,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-12 22:23:14,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-12 22:23:14,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-12 22:23:14,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13" (1/1) ... [2021-11-12 22:23:14,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13" (1/1) ... [2021-11-12 22:23:14,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13" (1/1) ... [2021-11-12 22:23:14,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13" (1/1) ... [2021-11-12 22:23:14,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13" (1/1) ... [2021-11-12 22:23:14,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13" (1/1) ... [2021-11-12 22:23:14,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13" (1/1) ... [2021-11-12 22:23:14,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-12 22:23:14,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-12 22:23:14,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-12 22:23:14,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-12 22:23:14,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13" (1/1) ... [2021-11-12 22:23:14,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 22:23:14,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 22:23:14,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-12 22:23:14,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-12 22:23:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-12 22:23:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-12 22:23:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-12 22:23:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-12 22:23:14,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-12 22:23:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-12 22:23:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-12 22:23:14,496 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-12 22:23:14,496 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-12 22:23:14,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 10:23:14 BoogieIcfgContainer [2021-11-12 22:23:14,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-12 22:23:14,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-12 22:23:14,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-12 22:23:14,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-12 22:23:14,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 10:23:13" (1/3) ... [2021-11-12 22:23:14,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d32c08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 10:23:14, skipping insertion in model container [2021-11-12 22:23:14,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:13" (2/3) ... [2021-11-12 22:23:14,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d32c08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 10:23:14, skipping insertion in model container [2021-11-12 22:23:14,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 10:23:14" (3/3) ... [2021-11-12 22:23:14,506 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c [2021-11-12 22:23:14,511 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-12 22:23:14,511 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-12 22:23:14,603 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-12 22:23:14,610 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-12 22:23:14,610 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-12 22:23:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:23:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-12 22:23:14,645 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:23:14,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-12 22:23:14,646 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 22:23:14,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:23:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash 85683978, now seen corresponding path program 1 times [2021-11-12 22:23:14,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:23:14,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300301837] [2021-11-12 22:23:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:23:14,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:23:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:23:14,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-12 22:23:14,925 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:23:14,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300301837] [2021-11-12 22:23:14,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300301837] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:23:14,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:23:14,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-12 22:23:14,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420694002] [2021-11-12 22:23:14,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:23:14,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-12 22:23:14,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:23:14,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-12 22:23:14,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 22:23:14,980 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:23:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:23:15,034 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-12 22:23:15,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-12 22:23:15,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-12 22:23:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:23:15,044 INFO L225 Difference]: With dead ends: 23 [2021-11-12 22:23:15,045 INFO L226 Difference]: Without dead ends: 13 [2021-11-12 22:23:15,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 22:23:15,054 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.63ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.68ms IncrementalHoareTripleChecker+Time [2021-11-12 22:23:15,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 10 Invalid, 9 Unknown, 0 Unchecked, 0.63ms Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 36.68ms Time] [2021-11-12 22:23:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-12 22:23:15,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2021-11-12 22:23:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:23:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-11-12 22:23:15,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2021-11-12 22:23:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:23:15,092 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-11-12 22:23:15,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:23:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-11-12 22:23:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-12 22:23:15,093 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:23:15,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-12 22:23:15,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-12 22:23:15,095 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 22:23:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:23:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1666710841, now seen corresponding path program 1 times [2021-11-12 22:23:15,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:23:15,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263624877] [2021-11-12 22:23:15,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:23:15,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:23:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-12 22:23:15,159 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-12 22:23:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-12 22:23:15,255 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-12 22:23:15,256 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-12 22:23:15,258 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-12 22:23:15,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-12 22:23:15,263 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-12 22:23:15,266 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-12 22:23:15,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 10:23:15 BoogieIcfgContainer [2021-11-12 22:23:15,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-12 22:23:15,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-12 22:23:15,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-12 22:23:15,308 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-12 22:23:15,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 10:23:14" (3/4) ... [2021-11-12 22:23:15,314 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-12 22:23:15,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-12 22:23:15,316 INFO L158 Benchmark]: Toolchain (without parser) took 1626.48ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 61.1MB in the beginning and 110.3MB in the end (delta: -49.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-12 22:23:15,318 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 96.5MB. Free memory was 71.9MB in the beginning and 71.9MB in the end (delta: 26.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-12 22:23:15,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.95ms. Allocated memory is still 96.5MB. Free memory was 60.9MB in the beginning and 71.0MB in the end (delta: -10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-12 22:23:15,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.43ms. Allocated memory is still 96.5MB. Free memory was 71.0MB in the beginning and 69.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-12 22:23:15,327 INFO L158 Benchmark]: Boogie Preprocessor took 26.15ms. Allocated memory is still 96.5MB. Free memory was 69.7MB in the beginning and 68.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-12 22:23:15,328 INFO L158 Benchmark]: RCFGBuilder took 437.83ms. Allocated memory is still 96.5MB. Free memory was 68.1MB in the beginning and 55.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-12 22:23:15,329 INFO L158 Benchmark]: TraceAbstraction took 805.10ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 54.7MB in the beginning and 111.1MB in the end (delta: -56.4MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2021-11-12 22:23:15,329 INFO L158 Benchmark]: Witness Printer took 8.21ms. Allocated memory is still 134.2MB. Free memory was 111.1MB in the beginning and 110.3MB in the end (delta: 770.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-12 22:23:15,336 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.26ms. Allocated memory is still 96.5MB. Free memory was 71.9MB in the beginning and 71.9MB in the end (delta: 26.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.95ms. Allocated memory is still 96.5MB. Free memory was 60.9MB in the beginning and 71.0MB in the end (delta: -10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.43ms. Allocated memory is still 96.5MB. Free memory was 71.0MB in the beginning and 69.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.15ms. Allocated memory is still 96.5MB. Free memory was 69.7MB in the beginning and 68.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 437.83ms. Allocated memory is still 96.5MB. Free memory was 68.1MB in the beginning and 55.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 805.10ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 54.7MB in the beginning and 111.1MB in the end (delta: -56.4MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * Witness Printer took 8.21ms. Allocated memory is still 134.2MB. Free memory was 111.1MB in the beginning and 110.3MB in the end (delta: 770.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 9]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 26, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 24. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L18] t = __VERIFIER_nondet_float() [L19] EXPR min[0] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L19] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) [L19] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L21] i = 0 VAL [i=0, max={4:0}, min={5:0}] [L21] COND TRUE i < sizeof(min) / sizeof(min[0]) [L22] EXPR max[i] VAL [i=0, max={4:0}, max[i]=49, min={5:0}] [L22] COND TRUE t <= max[i] [L24] EXPR min[i] [L24] EXPR max[i] [L24] EXPR min[i] [L24] z = (t - min[i]) / (max[i] - min[i]) [L26] CALL __VERIFIER_assert(z >= 0.f && z <= 1.f) [L9] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L9] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 36.68ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 27.67ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 5 mSDtfsCounter, 9 mSolverCounterSat, 0.63ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-12 22:23:15,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/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_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF --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 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-12 22:23:17,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-12 22:23:17,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-12 22:23:17,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-12 22:23:17,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-12 22:23:17,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-12 22:23:17,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-12 22:23:17,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-12 22:23:17,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-12 22:23:17,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-12 22:23:17,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-12 22:23:17,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-12 22:23:17,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-12 22:23:17,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-12 22:23:17,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-12 22:23:17,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-12 22:23:17,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-12 22:23:17,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-12 22:23:17,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-12 22:23:17,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-12 22:23:17,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-12 22:23:17,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-12 22:23:17,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-12 22:23:17,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-12 22:23:17,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-12 22:23:17,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-12 22:23:17,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-12 22:23:17,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-12 22:23:17,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-12 22:23:17,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-12 22:23:17,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-12 22:23:17,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-12 22:23:17,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-12 22:23:17,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-12 22:23:17,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-12 22:23:17,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-12 22:23:17,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-12 22:23:17,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-12 22:23:17,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-12 22:23:17,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-12 22:23:17,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-12 22:23:17,844 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-12 22:23:17,905 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-12 22:23:17,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-12 22:23:17,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-12 22:23:17,907 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-12 22:23:17,908 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-12 22:23:17,908 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-12 22:23:17,908 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-12 22:23:17,909 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-12 22:23:17,909 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-12 22:23:17,909 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-12 22:23:17,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-12 22:23:17,912 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-12 22:23:17,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-12 22:23:17,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-12 22:23:17,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-12 22:23:17,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-12 22:23:17,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-12 22:23:17,914 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-12 22:23:17,914 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-12 22:23:17,915 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-12 22:23:17,915 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-12 22:23:17,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-12 22:23:17,915 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-12 22:23:17,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-12 22:23:17,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-12 22:23:17,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-12 22:23:17,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-12 22:23:17,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 22:23:17,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-12 22:23:17,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-12 22:23:17,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-12 22:23:17,918 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-12 22:23:17,919 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-12 22:23:17,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-12 22:23:17,920 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-12 22:23:17,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-12 22:23:17,920 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_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/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_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2021-11-12 22:23:18,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-12 22:23:18,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-12 22:23:18,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-12 22:23:18,301 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-12 22:23:18,302 INFO L275 PluginConnector]: CDTParser initialized [2021-11-12 22:23:18,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/float-benchs/interpolation.c [2021-11-12 22:23:18,378 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/data/0880d539d/79daa96edb6544a888c3b9e15227e237/FLAG7fabf1e65 [2021-11-12 22:23:18,841 INFO L306 CDTParser]: Found 1 translation units. [2021-11-12 22:23:18,841 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/sv-benchmarks/c/float-benchs/interpolation.c [2021-11-12 22:23:18,850 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/data/0880d539d/79daa96edb6544a888c3b9e15227e237/FLAG7fabf1e65 [2021-11-12 22:23:19,230 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/data/0880d539d/79daa96edb6544a888c3b9e15227e237 [2021-11-12 22:23:19,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-12 22:23:19,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-12 22:23:19,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-12 22:23:19,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-12 22:23:19,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-12 22:23:19,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 10:23:19" (1/1) ... [2021-11-12 22:23:19,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c74beb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19, skipping insertion in model container [2021-11-12 22:23:19,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 10:23:19" (1/1) ... [2021-11-12 22:23:19,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-12 22:23:19,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-12 22:23:19,435 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_518d849e-5381-4490-b863-8663b068c9d8/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-12 22:23:19,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 22:23:19,472 INFO L203 MainTranslator]: Completed pre-run [2021-11-12 22:23:19,512 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_518d849e-5381-4490-b863-8663b068c9d8/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-12 22:23:19,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 22:23:19,575 INFO L208 MainTranslator]: Completed translation [2021-11-12 22:23:19,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19 WrapperNode [2021-11-12 22:23:19,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-12 22:23:19,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-12 22:23:19,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-12 22:23:19,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-12 22:23:19,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19" (1/1) ... [2021-11-12 22:23:19,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19" (1/1) ... [2021-11-12 22:23:19,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-12 22:23:19,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-12 22:23:19,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-12 22:23:19,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-12 22:23:19,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19" (1/1) ... [2021-11-12 22:23:19,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19" (1/1) ... [2021-11-12 22:23:19,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19" (1/1) ... [2021-11-12 22:23:19,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19" (1/1) ... [2021-11-12 22:23:19,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19" (1/1) ... [2021-11-12 22:23:19,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19" (1/1) ... [2021-11-12 22:23:19,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19" (1/1) ... [2021-11-12 22:23:19,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-12 22:23:19,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-12 22:23:19,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-12 22:23:19,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-12 22:23:19,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19" (1/1) ... [2021-11-12 22:23:19,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 22:23:19,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 22:23:19,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-12 22:23:19,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-12 22:23:19,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-12 22:23:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-12 22:23:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-12 22:23:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-12 22:23:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-12 22:23:19,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-12 22:23:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-12 22:23:22,116 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-12 22:23:22,117 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-12 22:23:22,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 10:23:22 BoogieIcfgContainer [2021-11-12 22:23:22,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-12 22:23:22,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-12 22:23:22,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-12 22:23:22,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-12 22:23:22,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 10:23:19" (1/3) ... [2021-11-12 22:23:22,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fdb7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 10:23:22, skipping insertion in model container [2021-11-12 22:23:22,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:23:19" (2/3) ... [2021-11-12 22:23:22,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fdb7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 10:23:22, skipping insertion in model container [2021-11-12 22:23:22,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 10:23:22" (3/3) ... [2021-11-12 22:23:22,128 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c [2021-11-12 22:23:22,134 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-12 22:23:22,134 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-12 22:23:22,183 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-12 22:23:22,191 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-12 22:23:22,191 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-12 22:23:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:23:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-12 22:23:22,234 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:23:22,235 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:23:22,236 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 22:23:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:23:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2021-11-12 22:23:22,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 22:23:22,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195950603] [2021-11-12 22:23:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:23:22,270 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 22:23:22,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 22:23:22,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 22:23:22,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-12 22:23:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:23:22,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-12 22:23:22,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 22:23:22,855 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-12 22:23:22,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 22:23:22,917 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-12 22:23:22,918 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-12 22:23:22,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195950603] [2021-11-12 22:23:22,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195950603] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-12 22:23:22,919 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:23:22,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-12 22:23:22,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812922404] [2021-11-12 22:23:22,922 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-12 22:23:22,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-12 22:23:22,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-12 22:23:22,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-12 22:23:22,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-12 22:23:22,965 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:23:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:23:22,978 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-11-12 22:23:22,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-12 22:23:22,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-12 22:23:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:23:22,992 INFO L225 Difference]: With dead ends: 29 [2021-11-12 22:23:22,992 INFO L226 Difference]: Without dead ends: 13 [2021-11-12 22:23:22,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-12 22:23:23,002 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.46ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-12 22:23:23,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.46ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-12 22:23:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-12 22:23:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-12 22:23:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:23:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-12 22:23:23,038 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-11-12 22:23:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:23:23,039 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-12 22:23:23,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:23:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-12 22:23:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-12 22:23:23,041 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:23:23,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:23:23,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-12 22:23:23,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-12 22:23:23,246 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 22:23:23,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:23:23,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2021-11-12 22:23:23,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 22:23:23,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597042922] [2021-11-12 22:23:23,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:23:23,249 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 22:23:23,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 22:23:23,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 22:23:23,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-12 22:23:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:23:23,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-12 22:23:23,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 22:23:23,694 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-12 22:23:23,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 22:23:23,765 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-12 22:23:23,765 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-12 22:23:23,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597042922] [2021-11-12 22:23:23,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597042922] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-12 22:23:23,766 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:23:23,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-12 22:23:23,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217445598] [2021-11-12 22:23:23,766 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-12 22:23:23,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-12 22:23:23,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-12 22:23:23,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-12 22:23:23,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-12 22:23:23,769 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:23:25,954 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-12 22:23:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:23:26,014 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-12 22:23:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-12 22:23:26,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-12 22:23:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:23:26,016 INFO L225 Difference]: With dead ends: 23 [2021-11-12 22:23:26,016 INFO L226 Difference]: Without dead ends: 19 [2021-11-12 22:23:26,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-12 22:23:26,019 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2194.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.05ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2234.98ms IncrementalHoareTripleChecker+Time [2021-11-12 22:23:26,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 1.05ms Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 2234.98ms Time] [2021-11-12 22:23:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-12 22:23:26,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-11-12 22:23:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:23:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-12 22:23:26,026 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2021-11-12 22:23:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:23:26,026 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-12 22:23:26,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:23:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-12 22:23:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-12 22:23:26,027 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:23:26,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:23:26,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-12 22:23:26,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-12 22:23:26,243 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 22:23:26,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:23:26,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2021-11-12 22:23:26,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 22:23:26,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133570488] [2021-11-12 22:23:26,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:23:26,245 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 22:23:26,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 22:23:26,246 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 22:23:26,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-12 22:23:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:23:26,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-12 22:23:26,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 22:23:29,676 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-12 22:23:29,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 392 treesize of output 192 [2021-11-12 22:26:29,889 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0) (let ((.cse1 (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0)))) is different from true [2021-11-12 22:27:22,831 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0)))) is different from false [2021-11-12 22:27:24,850 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0)))) is different from true [2021-11-12 22:27:24,851 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-12 22:27:24,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 22:27:35,283 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from false [2021-11-12 22:27:37,326 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from true [2021-11-12 22:27:50,234 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem12#1|))) is different from false [2021-11-12 22:29:02,282 WARN L227 SmtUtils]: Spent 19.45s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 22:29:17,119 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)))) is different from true [2021-11-12 22:29:31,786 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)))) is different from false [2021-11-12 22:29:33,832 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)))) is different from true [2021-11-12 22:29:51,516 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (not |c_ULTIMATE.start_main_#t~short10#1|))) is different from false [2021-11-12 22:30:07,838 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse4 (let ((.cse6 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (let ((.cse2 (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3))))) (and (fp.geq .cse2 (_ +zero 8 24)) (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse4)) (not |c_ULTIMATE.start_main_#t~short10#1|)))) is different from false [2021-11-12 22:30:23,066 WARN L227 SmtUtils]: Spent 14.12s on a formula simplification. DAG size of input: 8 DAG size of output: 3 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-12 22:30:23,067 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-12 22:30:23,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 274 treesize of output 133 [2021-11-12 22:31:44,439 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (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_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (or (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse0)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~t~0#1_8| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))))))) is different from false [2021-11-12 22:31:46,475 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (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_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (or (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse0)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~t~0#1_8| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))))))) is different from true [2021-11-12 22:31:46,475 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-12 22:31:46,476 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-12 22:31:46,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133570488] [2021-11-12 22:31:46,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133570488] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-12 22:31:46,476 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:31:46,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 20 [2021-11-12 22:31:46,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798607547] [2021-11-12 22:31:46,477 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-12 22:31:46,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-12 22:31:46,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-12 22:31:46,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-12 22:31:46,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=88, Unknown=29, NotChecked=252, Total=420 [2021-11-12 22:31:46,479 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:31:48,487 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-12 22:31:50,606 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (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_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (or (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse0)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~t~0#1_8| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-12 22:31:52,655 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_4 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (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_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (or (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse0)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~t~0#1_8| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-12 22:31:55,455 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse4 (let ((.cse9 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.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_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse3 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse1 (not |c_ULTIMATE.start_main_#t~short10#1|))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (let ((.cse0 (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse2))) (or (and (not .cse0) .cse1) (and .cse0 |c_ULTIMATE.start_main_#t~short10#1|))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse4)) (let ((.cse5 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (and (fp.geq .cse5 (_ +zero 8 24)) (fp.leq .cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3)) .cse1)))) is different from true [2021-11-12 22:33:11,197 WARN L227 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 61 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 22:33:13,930 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-12 22:33:16,878 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse5 (let ((.cse10 (select .cse8 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (let ((.cse1 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))) (let ((.cse3 (not .cse1)) (.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse4 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse0 (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (or (and .cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse2 .cse3)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse4) (or (and .cse3 (not |c_ULTIMATE.start_main_#t~short10#1|)) (and |c_ULTIMATE.start_main_#t~short10#1| .cse1)) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (or .cse2 (let ((.cse6 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse0 .cse4)))) (and (fp.geq .cse6 (_ +zero 8 24)) (fp.leq .cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2021-11-12 22:33:19,405 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (.cse1 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse2 (let ((.cse4 (select .cse5 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (or (let ((.cse3 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (and (fp.geq .cse3 (_ +zero 8 24)) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-12 22:33:23,171 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse2 (let ((.cse12 (select .cse8 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse3 (let ((.cse11 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse2) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (let ((.cse9 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse6 (let ((.cse10 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse9)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (or (let ((.cse4 (let ((.cse5 (let ((.cse7 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse9)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5))))) (and (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse6))))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-12 22:33:25,176 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-12 22:33:27,438 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse2 (let ((.cse12 (select .cse8 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse3 (let ((.cse11 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse6 (let ((.cse10 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse9)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse2) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (or (let ((.cse4 (let ((.cse5 (let ((.cse7 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse9)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5))))) (and (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem12#1|))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse6 |c_ULTIMATE.start_main_#t~mem12#1|)))) is different from true [2021-11-12 22:33:31,453 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse10 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse11 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse10)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse3 (let ((.cse8 (let ((.cse9 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse10)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse8) (fp.sub c_currentRoundingMode .cse2 .cse8)))) (.cse4 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2) (fp.geq .cse3 (_ +zero 8 24)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse4) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (let ((.cse5 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2021-11-12 22:33:56,325 WARN L227 SmtUtils]: Spent 7.49s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-12 22:33:58,181 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-12 22:34:00,245 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-12 22:34:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:34:00,318 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-11-12 22:34:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-12 22:34:00,319 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-12 22:34:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:34:00,320 INFO L225 Difference]: With dead ends: 26 [2021-11-12 22:34:00,320 INFO L226 Difference]: Without dead ends: 22 [2021-11-12 22:34:00,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 214.0s TimeCoverageRelationStatistics Valid=72, Invalid=128, Unknown=46, NotChecked=624, Total=870 [2021-11-12 22:34:00,325 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10990.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.42ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 11243.17ms IncrementalHoareTripleChecker+Time [2021-11-12 22:34:00,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 93 Unknown, 0 Unchecked, 1.42ms Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 4 Unknown, 72 Unchecked, 11243.17ms Time] [2021-11-12 22:34:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-12 22:34:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-12 22:34:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:34:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-11-12 22:34:00,332 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 11 [2021-11-12 22:34:00,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:34:00,332 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-11-12 22:34:00,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:34:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-11-12 22:34:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-12 22:34:00,334 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:34:00,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:34:00,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-12 22:34:00,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-12 22:34:00,539 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 22:34:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:34:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1504580037, now seen corresponding path program 1 times [2021-11-12 22:34:00,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 22:34:00,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91857969] [2021-11-12 22:34:00,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:34:00,541 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 22:34:00,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 22:34:00,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 22:34:00,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-12 22:34:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:34:00,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-12 22:34:00,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 22:34:00,962 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-12 22:34:00,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 22:34:01,016 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-12 22:34:01,017 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-12 22:34:01,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91857969] [2021-11-12 22:34:01,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91857969] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-12 22:34:01,018 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:34:01,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-12 22:34:01,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614944462] [2021-11-12 22:34:01,018 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-12 22:34:01,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-12 22:34:01,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-12 22:34:01,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-12 22:34:01,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-12 22:34:01,020 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:34:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:34:01,090 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-11-12 22:34:01,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-12 22:34:01,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-12 22:34:01,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:34:01,091 INFO L225 Difference]: With dead ends: 31 [2021-11-12 22:34:01,091 INFO L226 Difference]: Without dead ends: 17 [2021-11-12 22:34:01,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-12 22:34:01,093 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.57ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.11ms IncrementalHoareTripleChecker+Time [2021-11-12 22:34:01,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 0.57ms Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 42.11ms Time] [2021-11-12 22:34:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-12 22:34:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-12 22:34:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:34:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-11-12 22:34:01,099 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2021-11-12 22:34:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:34:01,100 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-12 22:34:01,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:34:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-11-12 22:34:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-12 22:34:01,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:34:01,102 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:34:01,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-12 22:34:01,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-12 22:34:01,326 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-12 22:34:01,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:34:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash 723862385, now seen corresponding path program 1 times [2021-11-12 22:34:01,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-12 22:34:01,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465359634] [2021-11-12 22:34:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:34:01,328 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-12 22:34:01,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat [2021-11-12 22:34:01,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-12 22:34:01,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_518d849e-5381-4490-b863-8663b068c9d8/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-12 22:34:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:34:01,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-12 22:34:01,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 22:34:07,460 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-11-12 22:34:07,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 439 treesize of output 215 [2021-11-12 22:34:53,292 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse0 .cse1) (or (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse3 .cse2)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse3) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0)) (= .cse2 .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32)) .cse3)))) is different from false [2021-11-12 22:35:02,026 WARN L227 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 9 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-12 22:35:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:35:02,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 22:35:12,600 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from false [2021-11-12 22:35:14,652 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from true [2021-11-12 22:35:26,119 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem12#1|))) is different from false [2021-11-12 22:35:41,676 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from false [2021-11-12 22:35:43,728 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from true [2021-11-12 22:35:58,310 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from false [2021-11-12 22:36:00,360 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from true [2021-11-12 22:36:13,214 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem12#1|) (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from false [2021-11-12 22:36:15,267 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem12#1|) (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from true [2021-11-12 22:36:33,654 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse2 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse5 (let ((.cse7 (select .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse3 (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse5 .cse4))))) (and (fp.geq .cse3 (_ +zero 8 24)) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))))) is different from false [2021-11-12 22:36:35,711 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse2 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse5 (let ((.cse7 (select .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse3 (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse5 .cse4))))) (and (fp.geq .cse3 (_ +zero 8 24)) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))))) is different from true [2021-11-12 22:36:50,360 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse6 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) is different from false [2021-11-12 22:36:52,413 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse6 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) is different from true [2021-11-12 22:37:12,688 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse6 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) is different from true [2021-11-12 22:37:30,919 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse6 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (not |c_ULTIMATE.start_main_#t~short10#1|) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) is different from false [2021-11-12 22:37:32,969 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse6 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (not |c_ULTIMATE.start_main_#t~short10#1|) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) is different from true