./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 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:36:27,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:36:27,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:36:27,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:36:27,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:36:27,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:36:27,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:36:27,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:36:27,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:36:27,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:36:27,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:36:27,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:36:27,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:36:27,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:36:27,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:36:27,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:36:27,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:36:27,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:36:27,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:36:27,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:36:27,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:36:27,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:36:27,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:36:27,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:36:27,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:36:27,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:36:27,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:36:27,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:36:27,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:36:27,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:36:27,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:36:27,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:36:27,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:36:27,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:36:27,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:36:27,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:36:27,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:36:27,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:36:27,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:36:27,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:36:27,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:36:27,373 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 05:36:27,424 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:36:27,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:36:27,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:36:27,427 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:36:27,427 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:36:27,427 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:36:27,427 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 05:36:27,428 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:36:27,428 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:36:27,428 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 05:36:27,437 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 05:36:27,437 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:36:27,437 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 05:36:27,437 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 05:36:27,438 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 05:36:27,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:36:27,439 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:36:27,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 05:36:27,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:36:27,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:36:27,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 05:36:27,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:36:27,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 05:36:27,440 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:36:27,441 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:36:27,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 05:36:27,441 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:36:27,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 05:36:27,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:36:27,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:36:27,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:36:27,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:36:27,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:36:27,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 05:36:27,446 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 05:36:27,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 05:36:27,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 05:36:27,446 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:36:27,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:36:27,447 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_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2021-11-03 05:36:27,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:36:27,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:36:27,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:36:27,780 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:36:27,781 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:36:27,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/float-benchs/interpolation.c [2021-11-03 05:36:27,863 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/data/e498d17bb/2ecc19e8fbfe4e2e8d9ea0580e13c536/FLAGea6dd207f [2021-11-03 05:36:28,368 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:36:28,368 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/sv-benchmarks/c/float-benchs/interpolation.c [2021-11-03 05:36:28,377 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/data/e498d17bb/2ecc19e8fbfe4e2e8d9ea0580e13c536/FLAGea6dd207f [2021-11-03 05:36:28,736 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/data/e498d17bb/2ecc19e8fbfe4e2e8d9ea0580e13c536 [2021-11-03 05:36:28,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:36:28,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:36:28,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:36:28,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:36:28,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:36:28,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:36:28" (1/1) ... [2021-11-03 05:36:28,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fabcb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:28, skipping insertion in model container [2021-11-03 05:36:28,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:36:28" (1/1) ... [2021-11-03 05:36:28,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:36:28,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:36:28,958 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_16835b7b-287a-4b6a-b74b-8ab6d59729bc/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-03 05:36:28,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:36:28,987 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:36:29,000 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_16835b7b-287a-4b6a-b74b-8ab6d59729bc/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-03 05:36:29,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:36:29,022 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:36:29,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:29 WrapperNode [2021-11-03 05:36:29,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:36:29,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:36:29,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:36:29,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:36:29,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:29" (1/1) ... [2021-11-03 05:36:29,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:29" (1/1) ... [2021-11-03 05:36:29,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:36:29,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:36:29,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:36:29,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:36:29,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:29" (1/1) ... [2021-11-03 05:36:29,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:29" (1/1) ... [2021-11-03 05:36:29,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:29" (1/1) ... [2021-11-03 05:36:29,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:29" (1/1) ... [2021-11-03 05:36:29,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:29" (1/1) ... [2021-11-03 05:36:29,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:29" (1/1) ... [2021-11-03 05:36:29,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:29" (1/1) ... [2021-11-03 05:36:29,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:36:29,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:36:29,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:36:29,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:36:29,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:29" (1/1) ... [2021-11-03 05:36:29,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:36:29,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:36:29,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:36:29,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:36:29,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 05:36:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:36:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-03 05:36:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:36:29,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:36:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-03 05:36:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 05:36:29,492 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:36:29,493 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-03 05:36:29,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:36:29 BoogieIcfgContainer [2021-11-03 05:36:29,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:36:29,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:36:29,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:36:29,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:36:29,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:36:28" (1/3) ... [2021-11-03 05:36:29,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad00802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:36:29, skipping insertion in model container [2021-11-03 05:36:29,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:29" (2/3) ... [2021-11-03 05:36:29,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad00802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:36:29, skipping insertion in model container [2021-11-03 05:36:29,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:36:29" (3/3) ... [2021-11-03 05:36:29,505 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c [2021-11-03 05:36:29,510 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:36:29,510 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 05:36:29,560 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:36:29,567 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 05:36:29,568 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 05:36:29,602 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-03 05:36:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 05:36:29,607 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:36:29,608 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 05:36:29,609 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:36:29,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:36:29,614 INFO L85 PathProgramCache]: Analyzing trace with hash 85683978, now seen corresponding path program 1 times [2021-11-03 05:36:29,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:36:29,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324406121] [2021-11-03 05:36:29,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:36:29,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:36:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:36:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:36:29,923 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:36:29,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324406121] [2021-11-03 05:36:29,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324406121] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:36:29,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:36:29,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:36:29,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480065780] [2021-11-03 05:36:29,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:36:29,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:36:29,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:36:29,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:36:29,955 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-03 05:36:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:36:29,997 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-03 05:36:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:36:30,000 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-03 05:36:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:36:30,010 INFO L225 Difference]: With dead ends: 23 [2021-11-03 05:36:30,010 INFO L226 Difference]: Without dead ends: 13 [2021-11-03 05:36:30,014 INFO L786 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-03 05:36:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-03 05:36:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2021-11-03 05:36:30,048 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-03 05:36:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-11-03 05:36:30,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2021-11-03 05:36:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:36:30,054 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-11-03 05:36:30,054 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-03 05:36:30,054 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-11-03 05:36:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 05:36:30,055 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:36:30,055 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 05:36:30,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 05:36:30,057 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:36:30,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:36:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1666710841, now seen corresponding path program 1 times [2021-11-03 05:36:30,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:36:30,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858569550] [2021-11-03 05:36:30,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:36:30,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:36:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 05:36:30,101 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 05:36:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 05:36:30,174 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 05:36:30,174 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 05:36:30,177 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:36:30,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 05:36:30,183 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-03 05:36:30,188 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 05:36:30,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 05:36:30 BoogieIcfgContainer [2021-11-03 05:36:30,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 05:36:30,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 05:36:30,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 05:36:30,225 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 05:36:30,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:36:29" (3/4) ... [2021-11-03 05:36:30,229 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-03 05:36:30,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 05:36:30,231 INFO L168 Benchmark]: Toolchain (without parser) took 1488.51 ms. Allocated memory is still 127.9 MB. Free memory was 87.1 MB in the beginning and 56.7 MB in the end (delta: 30.4 MB). Peak memory consumption was 26.6 MB. Max. memory is 16.1 GB. [2021-11-03 05:36:30,232 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 127.9 MB. Free memory was 104.1 MB in the beginning and 104.1 MB in the end (delta: 55.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:36:30,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.47 ms. Allocated memory is still 127.9 MB. Free memory was 86.9 MB in the beginning and 99.4 MB in the end (delta: -12.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-03 05:36:30,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.81 ms. Allocated memory is still 127.9 MB. Free memory was 99.4 MB in the beginning and 97.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:36:30,234 INFO L168 Benchmark]: Boogie Preprocessor took 25.02 ms. Allocated memory is still 127.9 MB. Free memory was 97.7 MB in the beginning and 96.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:36:30,235 INFO L168 Benchmark]: RCFGBuilder took 408.52 ms. Allocated memory is still 127.9 MB. Free memory was 96.4 MB in the beginning and 81.3 MB in the end (delta: 15.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-11-03 05:36:30,236 INFO L168 Benchmark]: TraceAbstraction took 726.30 ms. Allocated memory is still 127.9 MB. Free memory was 80.9 MB in the beginning and 57.1 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:36:30,237 INFO L168 Benchmark]: Witness Printer took 5.19 ms. Allocated memory is still 127.9 MB. Free memory was 57.1 MB in the beginning and 56.7 MB in the end (delta: 387.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:36:30,241 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.25 ms. Allocated memory is still 127.9 MB. Free memory was 104.1 MB in the beginning and 104.1 MB in the end (delta: 55.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 279.47 ms. Allocated memory is still 127.9 MB. Free memory was 86.9 MB in the beginning and 99.4 MB in the end (delta: -12.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.81 ms. Allocated memory is still 127.9 MB. Free memory was 99.4 MB in the beginning and 97.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.02 ms. Allocated memory is still 127.9 MB. Free memory was 97.7 MB in the beginning and 96.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 408.52 ms. Allocated memory is still 127.9 MB. Free memory was 96.4 MB in the beginning and 81.3 MB in the end (delta: 15.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 726.30 ms. Allocated memory is still 127.9 MB. Free memory was 80.9 MB in the beginning and 57.1 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Witness Printer took 5.19 ms. Allocated memory is still 127.9 MB. Free memory was 57.1 MB in the beginning and 56.7 MB in the end (delta: 387.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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] t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L19] t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L7] COND FALSE !(!cond) [L21] i = 0 [L21] COND TRUE i < sizeof(min) / sizeof(min[0]) [L22] EXPR max[i] [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]) [L9] COND TRUE !(cond) [L9] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 8 SDtfs, 7 SDslu, 6 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, 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.0s SatisfiabilityAnalysisTime, 0.0s 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-03 05:36:30,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:36:32,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:36:32,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:36:32,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:36:32,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:36:32,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:36:32,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:36:32,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:36:32,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:36:32,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:36:32,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:36:32,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:36:32,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:36:32,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:36:32,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:36:32,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:36:32,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:36:32,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:36:32,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:36:32,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:36:32,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:36:32,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:36:32,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:36:32,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:36:32,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:36:32,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:36:32,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:36:32,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:36:32,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:36:32,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:36:32,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:36:32,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:36:32,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:36:32,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:36:32,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:36:32,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:36:32,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:36:32,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:36:32,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:36:32,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:36:32,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:36:32,989 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-03 05:36:33,022 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:36:33,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:36:33,023 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:36:33,023 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:36:33,024 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:36:33,024 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:36:33,024 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:36:33,024 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:36:33,025 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:36:33,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:36:33,026 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:36:33,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:36:33,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:36:33,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 05:36:33,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:36:33,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 05:36:33,027 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:36:33,028 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-03 05:36:33,028 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-03 05:36:33,028 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:36:33,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 05:36:33,029 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:36:33,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 05:36:33,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:36:33,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 05:36:33,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:36:33,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:36:33,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:36:33,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:36:33,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 05:36:33,031 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-03 05:36:33,032 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-03 05:36:33,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 05:36:33,032 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:36:33,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:36:33,033 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_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2021-11-03 05:36:33,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:36:33,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:36:33,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:36:33,498 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:36:33,499 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:36:33,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/float-benchs/interpolation.c [2021-11-03 05:36:33,572 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/data/2ef73390b/31407f30944b4d92aa0ea92b6e3103dc/FLAG04a9c9758 [2021-11-03 05:36:34,161 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:36:34,163 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/sv-benchmarks/c/float-benchs/interpolation.c [2021-11-03 05:36:34,170 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/data/2ef73390b/31407f30944b4d92aa0ea92b6e3103dc/FLAG04a9c9758 [2021-11-03 05:36:34,494 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/data/2ef73390b/31407f30944b4d92aa0ea92b6e3103dc [2021-11-03 05:36:34,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:36:34,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:36:34,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:36:34,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:36:34,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:36:34,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:36:34" (1/1) ... [2021-11-03 05:36:34,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca32587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34, skipping insertion in model container [2021-11-03 05:36:34,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:36:34" (1/1) ... [2021-11-03 05:36:34,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:36:34,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:36:34,742 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_16835b7b-287a-4b6a-b74b-8ab6d59729bc/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-03 05:36:34,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:36:34,804 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:36:34,827 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_16835b7b-287a-4b6a-b74b-8ab6d59729bc/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-03 05:36:34,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:36:34,869 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:36:34,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34 WrapperNode [2021-11-03 05:36:34,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:36:34,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:36:34,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:36:34,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:36:34,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34" (1/1) ... [2021-11-03 05:36:34,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34" (1/1) ... [2021-11-03 05:36:34,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:36:34,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:36:34,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:36:34,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:36:34,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34" (1/1) ... [2021-11-03 05:36:34,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34" (1/1) ... [2021-11-03 05:36:34,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34" (1/1) ... [2021-11-03 05:36:34,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34" (1/1) ... [2021-11-03 05:36:34,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34" (1/1) ... [2021-11-03 05:36:34,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34" (1/1) ... [2021-11-03 05:36:34,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34" (1/1) ... [2021-11-03 05:36:34,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:36:34,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:36:34,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:36:34,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:36:34,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34" (1/1) ... [2021-11-03 05:36:34,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:36:34,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:36:35,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:36:35,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:36:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-03 05:36:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-03 05:36:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:36:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-03 05:36:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:36:35,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:36:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 05:36:37,506 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:36:37,506 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-03 05:36:37,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:36:37 BoogieIcfgContainer [2021-11-03 05:36:37,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:36:37,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:36:37,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:36:37,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:36:37,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:36:34" (1/3) ... [2021-11-03 05:36:37,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c0460c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:36:37, skipping insertion in model container [2021-11-03 05:36:37,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:36:34" (2/3) ... [2021-11-03 05:36:37,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c0460c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:36:37, skipping insertion in model container [2021-11-03 05:36:37,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:36:37" (3/3) ... [2021-11-03 05:36:37,520 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c [2021-11-03 05:36:37,525 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:36:37,525 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 05:36:37,573 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:36:37,581 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 05:36:37,581 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 05:36:37,598 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-03 05:36:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 05:36:37,605 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:36:37,605 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:36:37,606 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:36:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:36:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2021-11-03 05:36:37,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 05:36:37,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901907573] [2021-11-03 05:36:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:36:37,653 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 05:36:37,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 05:36:37,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 05:36:37,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-03 05:36:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:36:38,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-03 05:36:38,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:36:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:36:38,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:36:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:36:38,307 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 05:36:38,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901907573] [2021-11-03 05:36:38,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901907573] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 05:36:38,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:36:38,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-03 05:36:38,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083884323] [2021-11-03 05:36:38,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 05:36:38,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 05:36:38,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 05:36:38,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 05:36:38,338 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-03 05:36:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:36:38,358 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-11-03 05:36:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 05:36:38,360 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-03 05:36:38,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:36:38,369 INFO L225 Difference]: With dead ends: 29 [2021-11-03 05:36:38,369 INFO L226 Difference]: Without dead ends: 13 [2021-11-03 05:36:38,372 INFO L786 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-03 05:36:38,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-03 05:36:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-03 05:36:38,406 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-03 05:36:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-03 05:36:38,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-11-03 05:36:38,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:36:38,410 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-03 05:36:38,410 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-03 05:36:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-03 05:36:38,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 05:36:38,412 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:36:38,412 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:36:38,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-03 05:36:38,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 05:36:38,621 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:36:38,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:36:38,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2021-11-03 05:36:38,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 05:36:38,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99444064] [2021-11-03 05:36:38,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:36:38,624 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 05:36:38,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 05:36:38,625 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 05:36:38,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-03 05:36:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:36:38,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 05:36:38,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:36:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:36:39,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:36:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:36:39,102 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 05:36:39,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99444064] [2021-11-03 05:36:39,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99444064] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 05:36:39,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:36:39,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-03 05:36:39,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858514387] [2021-11-03 05:36:39,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:36:39,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 05:36:39,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:36:39,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:36:39,108 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-03 05:36:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:36:41,381 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-03 05:36:41,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:36:41,382 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-03 05:36:41,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:36:41,384 INFO L225 Difference]: With dead ends: 23 [2021-11-03 05:36:41,384 INFO L226 Difference]: Without dead ends: 19 [2021-11-03 05:36:41,385 INFO L786 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-03 05:36:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-03 05:36:41,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-11-03 05:36:41,390 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-03 05:36:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-03 05:36:41,391 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2021-11-03 05:36:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:36:41,392 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-03 05:36:41,392 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-03 05:36:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-03 05:36:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 05:36:41,394 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:36:41,394 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:36:41,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-03 05:36:41,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 05:36:41,610 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:36:41,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:36:41,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2021-11-03 05:36:41,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 05:36:41,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113706932] [2021-11-03 05:36:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:36:41,612 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 05:36:41,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 05:36:41,613 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 05:36:41,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-03 05:36:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:36:42,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-03 05:36:42,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:36:45,420 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-03 05:36:45,421 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-03 05:39:55,249 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (fp.geq ULTIMATE.start_main_~t~0 .cse0) (let ((.cse1 (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse0) (fp.sub roundNearestTiesToEven .cse2 .cse0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse1)))) (fp.leq ULTIMATE.start_main_~t~0 .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2)))) is different from false [2021-11-03 05:39:57,270 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (fp.geq ULTIMATE.start_main_~t~0 .cse0) (let ((.cse1 (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse0) (fp.sub roundNearestTiesToEven .cse2 .cse0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse1)))) (fp.leq ULTIMATE.start_main_~t~0 .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2)))) is different from true [2021-11-03 05:40:49,489 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (fp.geq ULTIMATE.start_main_~t~0 .cse0) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (fp.leq ULTIMATE.start_main_~t~0 .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from false [2021-11-03 05:40:51,512 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (fp.geq ULTIMATE.start_main_~t~0 .cse0) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (fp.leq ULTIMATE.start_main_~t~0 .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from true [2021-11-03 05:40:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:40:51,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:41:02,041 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.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 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.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-03 05:41:04,099 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.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 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.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-03 05:41:17,447 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|)) (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.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 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.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-03 05:41:19,501 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|)) (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.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 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.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-03 05:41:33,462 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse0)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.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 .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))))) is different from false [2021-11-03 05:41:35,518 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse0)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.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 .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))))) is different from true [2021-11-03 05:41:49,867 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.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.base|) |c_ULTIMATE.start_main_~#min~0.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 .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 .cse2)))) is different from false [2021-11-03 05:41:51,913 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.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.base|) |c_ULTIMATE.start_main_~#min~0.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 .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 .cse2)))) is different from true [2021-11-03 05:42:09,518 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.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.base|) |c_ULTIMATE.start_main_~#min~0.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 .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)))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)))) is different from false [2021-11-03 05:42:11,566 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.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.base|) |c_ULTIMATE.start_main_~#min~0.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 .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)))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)))) is different from true [2021-11-03 05:42:27,461 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.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.base|) |c_ULTIMATE.start_main_~#min~0.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 .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 |c_ULTIMATE.start_main_#t~short10|) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)))) is different from false [2021-11-03 05:42:29,508 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.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.base|) |c_ULTIMATE.start_main_~#min~0.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 .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 |c_ULTIMATE.start_main_#t~short10|) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)))) is different from true [2021-11-03 05:42:48,320 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse4 (let ((.cse6 (select .cse1 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (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.base|) |c_ULTIMATE.start_main_~#min~0.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 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3))))) (and (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse2 (_ +zero 8 24)))) (not |c_ULTIMATE.start_main_#t~short10|) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse4))))) is different from false [2021-11-03 05:42:50,369 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse4 (let ((.cse6 (select .cse1 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (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.base|) |c_ULTIMATE.start_main_~#min~0.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 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3))))) (and (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse2 (_ +zero 8 24)))) (not |c_ULTIMATE.start_main_#t~short10|) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse4))))) is different from true [2021-11-03 05:43:04,586 WARN L207 SmtUtils]: Spent 14.16 s on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2021-11-03 05:43:04,587 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-03 05:43:04,588 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-03 05:44:27,163 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_arrayElimCell_6 (_ BitVec 32)) (v_ULTIMATE.start_main_~t~0_10 (_ FloatingPoint 8 24)) (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 (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~t~0_10 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (fp.geq v_ULTIMATE.start_main_~t~0_10 .cse0)) (not (fp.leq v_ULTIMATE.start_main_~t~0_10 .cse1)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))))))) is different from false [2021-11-03 05:44:29,212 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_arrayElimCell_6 (_ BitVec 32)) (v_ULTIMATE.start_main_~t~0_10 (_ FloatingPoint 8 24)) (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 (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~t~0_10 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (fp.geq v_ULTIMATE.start_main_~t~0_10 .cse0)) (not (fp.leq v_ULTIMATE.start_main_~t~0_10 .cse1)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))))))) is different from true [2021-11-03 05:44:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:29,213 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 05:44:29,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113706932] [2021-11-03 05:44:29,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113706932] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 05:44:29,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:44:29,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 20 [2021-11-03 05:44:29,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273208633] [2021-11-03 05:44:29,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-03 05:44:29,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 05:44:29,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-03 05:44:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=79, Unknown=20, NotChecked=270, Total=420 [2021-11-03 05:44:29,219 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-03 05:44:31,310 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_arrayElimCell_6 (_ BitVec 32)) (v_ULTIMATE.start_main_~t~0_10 (_ FloatingPoint 8 24)) (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 (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~t~0_10 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (fp.geq v_ULTIMATE.start_main_~t~0_10 .cse0)) (not (fp.leq v_ULTIMATE.start_main_~t~0_10 .cse1)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-03 05:44:33,358 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_arrayElimCell_6 (_ BitVec 32)) (v_ULTIMATE.start_main_~t~0_10 (_ FloatingPoint 8 24)) (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 (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~t~0_10 .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (fp.geq v_ULTIMATE.start_main_~t~0_10 .cse0)) (not (fp.leq v_ULTIMATE.start_main_~t~0_10 .cse1)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-03 05:44:36,557 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse3 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse4 (not |c_ULTIMATE.start_main_#t~short10|)) (.cse2 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse0 (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (or (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse1 (_ +zero 8 24)))) .cse4 (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse3))) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~t~0 .cse2))) (or (and |c_ULTIMATE.start_main_#t~short10| .cse5) (and (not .cse5) .cse4))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-03 05:44:39,516 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse1 (not |c_ULTIMATE.start_main_#t~short10|)) (.cse5 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse4 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse2 (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~t~0 .cse2))) (or (and (not .cse0) .cse1) (and |c_ULTIMATE.start_main_#t~short10| .cse0))) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (or (let ((.cse3 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse4) (fp.sub c_currentRoundingMode .cse5 .cse4)))) (and (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse3 (_ +zero 8 24)))) .cse1 (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse5))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~t~0 .cse4) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-03 05:44:41,758 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse1 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse5 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse3 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse2 (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~t~0 .cse2))) (or (and (not .cse0) .cse1) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse0))) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (or (let ((.cse4 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse3) (fp.sub c_currentRoundingMode .cse5 .cse3)))) (and (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse4 (_ +zero 8 24)))) .cse1 (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse5))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~t~0 .cse3) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-03 05:44:44,628 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse2 (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#max~0.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.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse3 (let ((.cse4 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (and (or (let ((.cse0 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .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 .cse2))) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~t~0 .cse3) (fp.geq c_ULTIMATE.start_main_~t~0 .cse1) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-03 05:46:05,540 WARN L207 SmtUtils]: Spent 1.06 m on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2021-11-03 05:46:10,049 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|)) (.cse6 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse12 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse1 (let ((.cse11 (select .cse5 |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse9 (let ((.cse10 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (and (= c_ULTIMATE.start_main_~i~0 (_ bv0 32)) (= |c_ULTIMATE.start_main_#t~mem12| .cse0) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse6)))) (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 .cse3) (fp.sub c_currentRoundingMode .cse0 .cse3))))) (and (fp.geq .cse2 (_ +zero 8 24)) (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))) (= (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~t~0 .cse9) (fp.geq c_ULTIMATE.start_main_~t~0 .cse1) (= .cse9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-03 05:46:13,101 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|)) (.cse9 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse11 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|))) (let ((.cse2 (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse0 (let ((.cse6 (let ((.cse7 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#min~0.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 .cse6) (fp.sub c_currentRoundingMode .cse1 .cse6))))) (and (= c_ULTIMATE.start_main_~i~0 (_ bv0 32)) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (fp.leq c_ULTIMATE.start_main_~t~0 .cse1) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~t~0 .cse2) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (= (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))))) is different from true [2021-11-03 05:46:15,198 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (fp.geq ULTIMATE.start_main_~t~0 .cse0) (let ((.cse1 (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse0) (fp.sub roundNearestTiesToEven .cse2 .cse0)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse1)))) (fp.leq ULTIMATE.start_main_~t~0 .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2))))) is different from false [2021-11-03 05:46:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:46:20,981 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-11-03 05:46:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:46:20,982 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-03 05:46:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:46:20,983 INFO L225 Difference]: With dead ends: 26 [2021-11-03 05:46:20,983 INFO L226 Difference]: Without dead ends: 22 [2021-11-03 05:46:20,985 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 146.3s TimeCoverageRelationStatistics Valid=72, Invalid=98, Unknown=34, NotChecked=666, Total=870 [2021-11-03 05:46:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-03 05:46:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-03 05:46:20,989 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-03 05:46:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-11-03 05:46:20,990 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 11 [2021-11-03 05:46:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:46:20,990 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-11-03 05:46:20,991 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-03 05:46:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-11-03 05:46:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 05:46:20,992 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:46:20,992 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:46:21,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-03 05:46:21,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 05:46:21,201 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:46:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:46:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1504580037, now seen corresponding path program 1 times [2021-11-03 05:46:21,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 05:46:21,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454915332] [2021-11-03 05:46:21,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:46:21,204 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 05:46:21,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 05:46:21,211 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 05:46:21,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-03 05:46:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:46:21,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-03 05:46:21,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:46:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:46:21,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:46:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:46:21,747 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 05:46:21,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454915332] [2021-11-03 05:46:21,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454915332] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 05:46:21,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:46:21,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-03 05:46:21,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097349717] [2021-11-03 05:46:21,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:46:21,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 05:46:21,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:46:21,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:46:21,750 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-03 05:46:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:46:21,819 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-11-03 05:46:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:46:21,819 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-03 05:46:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:46:21,820 INFO L225 Difference]: With dead ends: 31 [2021-11-03 05:46:21,820 INFO L226 Difference]: Without dead ends: 17 [2021-11-03 05:46:21,821 INFO L786 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-03 05:46:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-03 05:46:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-03 05:46:21,824 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-03 05:46:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-11-03 05:46:21,825 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2021-11-03 05:46:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:46:21,826 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-03 05:46:21,826 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-03 05:46:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-11-03 05:46:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 05:46:21,827 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:46:21,828 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:46:21,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-03 05:46:22,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 05:46:22,041 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:46:22,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:46:22,042 INFO L85 PathProgramCache]: Analyzing trace with hash 723862385, now seen corresponding path program 1 times [2021-11-03 05:46:22,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 05:46:22,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942385458] [2021-11-03 05:46:22,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:46:22,043 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 05:46:22,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 05:46:22,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 05:46:22,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16835b7b-287a-4b6a-b74b-8ab6d59729bc/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-03 05:46:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:46:22,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-03 05:46:22,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:46:27,286 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-11-03 05:46:27,287 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-03 05:47:31,245 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse3 (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))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (= .cse0 .cse1) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (or (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse3) (fp.sub roundNearestTiesToEven .cse2 .cse3)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (not (fp.leq ULTIMATE.start_main_~t~0 .cse0)) (= .cse3 .cse1) (fp.leq ULTIMATE.start_main_~t~0 .cse2)))) is different from true [2021-11-03 05:47:56,715 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-03 05:47:56,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:48:06,459 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.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 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.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-03 05:48:08,513 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.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 .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.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-03 05:49:26,242 WARN L207 SmtUtils]: Spent 18.11 s on a formula simplification that was a NOOP. DAG size: 37 [2021-11-03 05:49:42,384 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse0)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.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 .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))))) is different from true [2021-11-03 05:49:54,500 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv4 32) .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.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0.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 .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 .cse2))))) is different from true