./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 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs --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-0f8a17c [2021-11-19 14:01:21,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:01:21,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:01:21,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:01:21,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:01:21,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:01:21,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:01:21,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:01:21,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:01:21,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:01:21,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:01:21,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:01:21,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:01:21,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:01:21,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:01:21,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:01:21,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:01:21,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:01:21,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:01:21,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:01:21,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:01:21,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:01:21,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:01:21,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:01:21,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:01:21,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:01:21,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:01:21,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:01:21,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:01:21,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:01:21,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:01:21,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:01:21,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:01:21,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:01:21,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:01:21,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:01:21,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:01:21,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:01:21,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:01:21,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:01:21,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:01:21,566 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-19 14:01:21,599 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:01:21,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:01:21,600 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:01:21,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:01:21,601 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:01:21,601 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:01:21,602 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:01:21,602 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 14:01:21,602 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:01:21,602 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:01:21,602 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 14:01:21,603 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 14:01:21,603 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:01:21,603 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 14:01:21,603 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 14:01:21,604 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 14:01:21,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:01:21,605 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:01:21,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 14:01:21,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:01:21,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:01:21,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:01:21,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:01:21,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:01:21,606 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:01:21,607 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:01:21,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:01:21,607 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:01:21,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:01:21,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:01:21,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:01:21,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:01:21,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:01:21,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:01:21,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:01:21,609 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 14:01:21,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 14:01:21,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:01:21,610 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:01:21,610 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:01:21,610 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_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/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_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs 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-19 14:01:21,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:01:21,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:01:21,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:01:21,931 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:01:21,931 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:01:21,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/float-benchs/interpolation.c [2021-11-19 14:01:22,010 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/data/e78ade878/afb1f2348e514a62b4ed92cae9cdb79e/FLAG1a633ceb3 [2021-11-19 14:01:22,473 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:01:22,473 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/sv-benchmarks/c/float-benchs/interpolation.c [2021-11-19 14:01:22,479 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/data/e78ade878/afb1f2348e514a62b4ed92cae9cdb79e/FLAG1a633ceb3 [2021-11-19 14:01:22,850 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/data/e78ade878/afb1f2348e514a62b4ed92cae9cdb79e [2021-11-19 14:01:22,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:01:22,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:01:22,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:01:22,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:01:22,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:01:22,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:01:22" (1/1) ... [2021-11-19 14:01:22,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e9ec828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:22, skipping insertion in model container [2021-11-19 14:01:22,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:01:22" (1/1) ... [2021-11-19 14:01:22,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:01:22,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:01:23,078 WARN L230 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_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-19 14:01:23,102 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:01:23,109 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:01:23,121 WARN L230 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_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-19 14:01:23,131 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:01:23,146 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:01:23,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:23 WrapperNode [2021-11-19 14:01:23,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:01:23,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:01:23,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:01:23,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:01:23,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:23" (1/1) ... [2021-11-19 14:01:23,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:23" (1/1) ... [2021-11-19 14:01:23,191 INFO L137 Inliner]: procedures = 18, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2021-11-19 14:01:23,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:01:23,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:01:23,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:01:23,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:01:23,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:23" (1/1) ... [2021-11-19 14:01:23,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:23" (1/1) ... [2021-11-19 14:01:23,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:23" (1/1) ... [2021-11-19 14:01:23,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:23" (1/1) ... [2021-11-19 14:01:23,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:23" (1/1) ... [2021-11-19 14:01:23,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:23" (1/1) ... [2021-11-19 14:01:23,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:23" (1/1) ... [2021-11-19 14:01:23,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:01:23,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:01:23,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:01:23,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:01:23,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:23" (1/1) ... [2021-11-19 14:01:23,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:01:23,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:23,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:01:23,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:01:23,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:01:23,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 14:01:23,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 14:01:23,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-19 14:01:23,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:01:23,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:01:23,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-19 14:01:23,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 14:01:23,365 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:01:23,366 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:01:23,494 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:01:23,539 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:01:23,539 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-19 14:01:23,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:23 BoogieIcfgContainer [2021-11-19 14:01:23,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:01:23,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:01:23,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:01:23,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:01:23,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:01:22" (1/3) ... [2021-11-19 14:01:23,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa98dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:01:23, skipping insertion in model container [2021-11-19 14:01:23,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:23" (2/3) ... [2021-11-19 14:01:23,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa98dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:01:23, skipping insertion in model container [2021-11-19 14:01:23,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:23" (3/3) ... [2021-11-19 14:01:23,551 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c [2021-11-19 14:01:23,556 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:01:23,556 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:01:23,647 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:01:23,655 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-19 14:01:23,655 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:01:23,688 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-19 14:01:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-19 14:01:23,694 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:23,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-19 14:01:23,695 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:01:23,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:23,701 INFO L85 PathProgramCache]: Analyzing trace with hash 85683978, now seen corresponding path program 1 times [2021-11-19 14:01:23,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:23,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301266553] [2021-11-19 14:01:23,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:23,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:01:24,017 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:24,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301266553] [2021-11-19 14:01:24,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301266553] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:24,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:24,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 14:01:24,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099052930] [2021-11-19 14:01:24,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:24,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 14:01:24,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:24,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 14:01:24,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 14:01:24,065 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-19 14:01:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:24,107 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-19 14:01:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 14:01:24,110 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-19 14:01:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:24,119 INFO L225 Difference]: With dead ends: 23 [2021-11-19 14:01:24,119 INFO L226 Difference]: Without dead ends: 13 [2021-11-19 14:01:24,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 14:01:24,126 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:24,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 10 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:01:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-19 14:01:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2021-11-19 14:01:24,157 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-19 14:01:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-11-19 14:01:24,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2021-11-19 14:01:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:24,160 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-11-19 14:01:24,160 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-19 14:01:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-11-19 14:01:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-19 14:01:24,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:24,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-19 14:01:24,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 14:01:24,162 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:01:24,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:24,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1666710841, now seen corresponding path program 1 times [2021-11-19 14:01:24,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:24,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771649907] [2021-11-19 14:01:24,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:24,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:01:24,204 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 14:01:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:01:24,276 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-19 14:01:24,277 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 14:01:24,279 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 14:01:24,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 14:01:24,290 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-19 14:01:24,293 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 14:01:24,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 02:01:24 BoogieIcfgContainer [2021-11-19 14:01:24,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 14:01:24,322 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 14:01:24,322 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 14:01:24,322 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 14:01:24,322 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:23" (3/4) ... [2021-11-19 14:01:24,326 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-19 14:01:24,326 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 14:01:24,327 INFO L158 Benchmark]: Toolchain (without parser) took 1472.38ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 46.8MB in the beginning and 72.5MB in the end (delta: -25.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:01:24,327 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory was 63.7MB in the beginning and 63.6MB in the end (delta: 38.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:01:24,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.30ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 46.6MB in the beginning and 84.4MB in the end (delta: -37.7MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2021-11-19 14:01:24,329 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.55ms. Allocated memory is still 109.1MB. Free memory was 84.4MB in the beginning and 82.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:01:24,329 INFO L158 Benchmark]: Boogie Preprocessor took 32.89ms. Allocated memory is still 109.1MB. Free memory was 82.5MB in the beginning and 81.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:01:24,330 INFO L158 Benchmark]: RCFGBuilder took 316.28ms. Allocated memory is still 109.1MB. Free memory was 81.4MB in the beginning and 69.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-19 14:01:24,331 INFO L158 Benchmark]: TraceAbstraction took 777.13ms. Allocated memory is still 109.1MB. Free memory was 68.8MB in the beginning and 72.9MB in the end (delta: -4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:01:24,331 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 109.1MB. Free memory was 72.9MB in the beginning and 72.5MB in the end (delta: 396.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:01:24,335 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.29ms. Allocated memory is still 83.9MB. Free memory was 63.7MB in the beginning and 63.6MB in the end (delta: 38.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.30ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 46.6MB in the beginning and 84.4MB in the end (delta: -37.7MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.55ms. Allocated memory is still 109.1MB. Free memory was 84.4MB in the beginning and 82.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.89ms. Allocated memory is still 109.1MB. Free memory was 82.5MB in the beginning and 81.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 316.28ms. Allocated memory is still 109.1MB. Free memory was 81.4MB in the beginning and 69.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 777.13ms. Allocated memory is still 109.1MB. Free memory was 68.8MB in the beginning and 72.9MB in the end (delta: -4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 109.1MB. Free memory was 72.9MB in the beginning and 72.5MB in the end (delta: 396.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 9]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 26, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 24. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L18] t = __VERIFIER_nondet_float() [L19] EXPR min[0] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L19] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) [L19] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L21] i = 0 VAL [i=0, max={5:0}, min={4:0}] [L21] COND TRUE i < sizeof(min) / sizeof(min[0]) [L22] EXPR max[i] VAL [i=0, max={5:0}, max[i]=49, min={4:0}] [L22] COND TRUE t <= max[i] [L24] EXPR min[i] [L24] EXPR max[i] [L24] EXPR min[i] [L24] z = (t - min[i]) / (max[i] - min[i]) [L26] CALL __VERIFIER_assert(z >= 0.f && z <= 1.f) [L9] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L9] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 5 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s 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-19 14:01:24,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs --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-0f8a17c [2021-11-19 14:01:26,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:01:26,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:01:26,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:01:26,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:01:26,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:01:26,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:01:26,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:01:26,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:01:26,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:01:26,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:01:26,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:01:26,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:01:26,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:01:26,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:01:26,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:01:26,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:01:26,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:01:26,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:01:27,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:01:27,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:01:27,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:01:27,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:01:27,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:01:27,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:01:27,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:01:27,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:01:27,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:01:27,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:01:27,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:01:27,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:01:27,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:01:27,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:01:27,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:01:27,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:01:27,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:01:27,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:01:27,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:01:27,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:01:27,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:01:27,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:01:27,054 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-19 14:01:27,109 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:01:27,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:01:27,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:01:27,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:01:27,111 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:01:27,111 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:01:27,112 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:01:27,112 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:01:27,112 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:01:27,112 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:01:27,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:01:27,115 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:01:27,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:01:27,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:01:27,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:01:27,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:01:27,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:01:27,116 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:01:27,116 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 14:01:27,116 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 14:01:27,116 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:01:27,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:01:27,117 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:01:27,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:01:27,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:01:27,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 14:01:27,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:01:27,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:01:27,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:01:27,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:01:27,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:01:27,119 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-19 14:01:27,119 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 14:01:27,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:01:27,119 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:01:27,120 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:01:27,120 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_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/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_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs 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-19 14:01:27,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:01:27,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:01:27,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:01:27,542 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:01:27,543 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:01:27,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/float-benchs/interpolation.c [2021-11-19 14:01:27,632 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/data/b78506628/7faa2ecfa5084df78abc99c29731f5e6/FLAG78a45a73f [2021-11-19 14:01:28,159 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:01:28,160 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/sv-benchmarks/c/float-benchs/interpolation.c [2021-11-19 14:01:28,167 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/data/b78506628/7faa2ecfa5084df78abc99c29731f5e6/FLAG78a45a73f [2021-11-19 14:01:28,512 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/data/b78506628/7faa2ecfa5084df78abc99c29731f5e6 [2021-11-19 14:01:28,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:01:28,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:01:28,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:01:28,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:01:28,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:01:28,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:01:28" (1/1) ... [2021-11-19 14:01:28,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613723dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28, skipping insertion in model container [2021-11-19 14:01:28,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:01:28" (1/1) ... [2021-11-19 14:01:28,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:01:28,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:01:28,710 WARN L230 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_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-19 14:01:28,738 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:01:28,758 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:01:28,792 WARN L230 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_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2021-11-19 14:01:28,838 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:01:28,867 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:01:28,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28 WrapperNode [2021-11-19 14:01:28,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:01:28,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:01:28,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:01:28,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:01:28,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28" (1/1) ... [2021-11-19 14:01:28,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28" (1/1) ... [2021-11-19 14:01:28,914 INFO L137 Inliner]: procedures = 19, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2021-11-19 14:01:28,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:01:28,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:01:28,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:01:28,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:01:28,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28" (1/1) ... [2021-11-19 14:01:28,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28" (1/1) ... [2021-11-19 14:01:28,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28" (1/1) ... [2021-11-19 14:01:28,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28" (1/1) ... [2021-11-19 14:01:28,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28" (1/1) ... [2021-11-19 14:01:28,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28" (1/1) ... [2021-11-19 14:01:28,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28" (1/1) ... [2021-11-19 14:01:28,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:01:28,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:01:28,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:01:28,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:01:28,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28" (1/1) ... [2021-11-19 14:01:28,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:01:28,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:29,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:01:29,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:01:29,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:01:29,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-19 14:01:29,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-19 14:01:29,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 14:01:29,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-19 14:01:29,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:01:29,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:01:29,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 14:01:29,133 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:01:29,135 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:01:30,775 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:01:30,781 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:01:30,781 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-19 14:01:30,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:30 BoogieIcfgContainer [2021-11-19 14:01:30,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:01:30,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:01:30,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:01:30,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:01:30,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:01:28" (1/3) ... [2021-11-19 14:01:30,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdb36cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:01:30, skipping insertion in model container [2021-11-19 14:01:30,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:28" (2/3) ... [2021-11-19 14:01:30,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdb36cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:01:30, skipping insertion in model container [2021-11-19 14:01:30,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:30" (3/3) ... [2021-11-19 14:01:30,806 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c [2021-11-19 14:01:30,812 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:01:30,812 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:01:30,874 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:01:30,882 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-19 14:01:30,882 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:01:30,923 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-19 14:01:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-19 14:01:30,928 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:30,929 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:30,929 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:01:30,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:30,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2021-11-19 14:01:30,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:01:30,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165190256] [2021-11-19 14:01:30,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:30,950 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:01:30,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:01:30,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:01:30,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 14:01:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:31,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-19 14:01:31,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:31,373 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-19 14:01:31,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:31,433 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-19 14:01:31,434 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:01:31,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165190256] [2021-11-19 14:01:31,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165190256] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:31,436 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:31,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-19 14:01:31,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131439473] [2021-11-19 14:01:31,440 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:31,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 14:01:31,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:01:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 14:01:31,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 14:01:31,493 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-19 14:01:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:31,510 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-11-19 14:01:31,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 14:01:31,512 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-19 14:01:31,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:31,528 INFO L225 Difference]: With dead ends: 29 [2021-11-19 14:01:31,529 INFO L226 Difference]: Without dead ends: 13 [2021-11-19 14:01:31,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 14:01:31,535 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:31,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:01:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-19 14:01:31,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-19 14:01:31,565 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-19 14:01:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-19 14:01:31,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-11-19 14:01:31,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:31,567 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-19 14:01:31,568 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-19 14:01:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-19 14:01:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-19 14:01:31,568 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:31,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:31,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-19 14:01:31,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:01:31,784 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:01:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:31,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2021-11-19 14:01:31,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:01:31,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822788744] [2021-11-19 14:01:31,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:31,791 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:01:31,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:01:31,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:01:31,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 14:01:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:32,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-19 14:01:32,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:32,284 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-19 14:01:32,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:32,349 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-19 14:01:32,350 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:01:32,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822788744] [2021-11-19 14:01:32,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822788744] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:32,351 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:32,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-19 14:01:32,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044554941] [2021-11-19 14:01:32,356 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:32,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 14:01:32,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:01:32,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 14:01:32,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-19 14:01:32,359 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-19 14:01:34,514 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:01:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:34,579 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-19 14:01:34,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 14:01:34,580 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-19 14:01:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:34,580 INFO L225 Difference]: With dead ends: 23 [2021-11-19 14:01:34,581 INFO L226 Difference]: Without dead ends: 19 [2021-11-19 14:01:34,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-19 14:01:34,583 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:34,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-11-19 14:01:34,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-19 14:01:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-11-19 14:01:34,588 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-19 14:01:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-19 14:01:34,589 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2021-11-19 14:01:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:34,590 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-19 14:01:34,590 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-19 14:01:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-19 14:01:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-19 14:01:34,591 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:34,591 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:34,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-19 14:01:34,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:01:34,808 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:01:34,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2021-11-19 14:01:34,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:01:34,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140261577] [2021-11-19 14:01:34,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:34,809 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:01:34,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:01:34,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:01:34,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-19 14:01:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:35,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-19 14:01:35,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:38,945 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 14:01:38,946 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-19 14:04:33,216 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0) (let ((.cse1 (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0)))) is different from true [2021-11-19 14:05:26,112 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0)))) is different from false [2021-11-19 14:05:28,134 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0)))) is different from true [2021-11-19 14:05:28,135 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-19 14:05:28,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:05:38,560 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from false [2021-11-19 14:05:40,605 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from true [2021-11-19 14:06:48,845 WARN L227 SmtUtils]: Spent 18.52s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:06:59,932 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from false [2021-11-19 14:07:01,983 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from true [2021-11-19 14:07:14,394 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)))) is different from false [2021-11-19 14:07:16,449 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)))) is different from true [2021-11-19 14:07:32,471 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)))) is different from false [2021-11-19 14:07:34,526 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)))) is different from true [2021-11-19 14:07:51,336 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (not |c_ULTIMATE.start_main_#t~short7#1|))) is different from true [2021-11-19 14:08:08,413 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse4 (let ((.cse6 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (let ((.cse2 (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3))))) (and (fp.geq .cse2 (_ +zero 8 24)) (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse4)) (not |c_ULTIMATE.start_main_#t~short7#1|)))) is different from false [2021-11-19 14:08:10,467 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse4 (let ((.cse6 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (let ((.cse2 (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3))))) (and (fp.geq .cse2 (_ +zero 8 24)) (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse4)) (not |c_ULTIMATE.start_main_#t~short7#1|)))) is different from true [2021-11-19 14:08:24,675 WARN L227 SmtUtils]: Spent 14.17s on a formula simplification. DAG size of input: 8 DAG size of output: 3 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-19 14:08:24,675 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-19 14:08:24,676 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-19 14:09:45,282 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (or (not (fp.geq |v_ULTIMATE.start_main_~t~0#1_8| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse1)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~t~0#1_8| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))))))) (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)))))) is different from false [2021-11-19 14:09:47,328 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (or (not (fp.geq |v_ULTIMATE.start_main_~t~0#1_8| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse1)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~t~0#1_8| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))))))) (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)))))) is different from true [2021-11-19 14:09:47,329 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-19 14:09:47,329 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:09:47,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140261577] [2021-11-19 14:09:47,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140261577] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:09:47,330 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:09:47,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 20 [2021-11-19 14:09:47,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118482520] [2021-11-19 14:09:47,331 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:09:47,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-19 14:09:47,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:09:47,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-19 14:09:47,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=89, Unknown=28, NotChecked=252, Total=420 [2021-11-19 14:09:47,334 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-19 14:09:49,389 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:09:51,461 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (or (not (fp.geq |v_ULTIMATE.start_main_~t~0#1_8| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse1)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (fp.leq (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~t~0#1_8| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))))))) (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)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 14:09:55,413 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse4 (let ((.cse9 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse3 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse0 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse2 (not |c_ULTIMATE.start_main_#t~short7#1|))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (let ((.cse1 (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse3))) (or (and (not .cse1) .cse2) (and .cse1 |c_ULTIMATE.start_main_#t~short7#1|))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse4)) (let ((.cse5 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse0 .cse3)))) (and (fp.geq .cse5 (_ +zero 8 24)) (fp.leq .cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-19 14:09:58,581 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse3 (not |c_ULTIMATE.start_main_#t~short7#1|)) (.cse1 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 (let ((.cse6 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse1) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (or (let ((.cse2 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (and (fp.geq .cse2 (_ +zero 8 24)) (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) .cse3) (let ((.cse4 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))) (or (and (not .cse4) .cse3) (and .cse4 |c_ULTIMATE.start_main_#t~short7#1|))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-19 14:10:00,793 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse3 (let ((.cse9 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse4 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse0 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (let ((.cse1 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3))) (or (and .cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse2 (not .cse1)))) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse4) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (or .cse2 (let ((.cse5 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse0 .cse4)))) (and (fp.geq .cse5 (_ +zero 8 24)) (fp.leq .cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-19 14:10:03,992 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (.cse1 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse2 (let ((.cse4 (select .cse5 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (or (let ((.cse3 (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (and (fp.geq .cse3 (_ +zero 8 24)) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-19 14:10:07,384 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse2 (let ((.cse12 (select .cse8 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse3 (let ((.cse11 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse2) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (let ((.cse9 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse6 (let ((.cse10 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse9)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (or (let ((.cse4 (let ((.cse5 (let ((.cse7 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse9)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5))))) (and (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse6))))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-19 14:10:09,402 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:11:51,176 WARN L227 SmtUtils]: Spent 1.46m on a formula simplification. DAG size of input: 73 DAG size of output: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:11:54,644 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse12 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse13 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse12)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse9 (let ((.cse10 (let ((.cse11 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse12)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse10) (fp.sub c_currentRoundingMode .cse2 .cse10))))) (let ((.cse3 (fp.geq .cse9 (_ +zero 8 24))) (.cse5 (fp.leq .cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (.cse4 (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2) .cse3 (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse4) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) .cse5 (or (and .cse3 .cse5) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (let ((.cse6 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from false [2021-11-19 14:11:56,704 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse12 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse13 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse12)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse9 (let ((.cse10 (let ((.cse11 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse12)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse10) (fp.sub c_currentRoundingMode .cse2 .cse10))))) (let ((.cse3 (fp.geq .cse9 (_ +zero 8 24))) (.cse5 (fp.leq .cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (.cse4 (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2) .cse3 (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse4) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) .cse5 (or (and .cse3 .cse5) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (let ((.cse6 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2021-11-19 14:11:58,199 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:12:00,256 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:12:02,383 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0) (let ((.cse1 (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0))))) is different from false [2021-11-19 14:12:04,428 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:12:06,520 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:12:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:12:06,521 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2021-11-19 14:12:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-19 14:12:06,583 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-19 14:12:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:12:06,584 INFO L225 Difference]: With dead ends: 28 [2021-11-19 14:12:06,584 INFO L226 Difference]: Without dead ends: 24 [2021-11-19 14:12:06,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 219.1s TimeCoverageRelationStatistics Valid=74, Invalid=111, Unknown=39, NotChecked=646, Total=870 [2021-11-19 14:12:06,587 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:12:06,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 5 Unknown, 107 Unchecked, 13.1s Time] [2021-11-19 14:12:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-19 14:12:06,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2021-11-19 14:12:06,593 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-19 14:12:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-11-19 14:12:06,594 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 11 [2021-11-19 14:12:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:12:06,594 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-11-19 14:12:06,595 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-19 14:12:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-11-19 14:12:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-19 14:12:06,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:12:06,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:12:06,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-19 14:12:06,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:12:06,812 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:12:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:12:06,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1504580037, now seen corresponding path program 1 times [2021-11-19 14:12:06,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:12:06,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610042447] [2021-11-19 14:12:06,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:12:06,813 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:12:06,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:12:06,814 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:12:06,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-19 14:12:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:12:07,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-19 14:12:07,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:12:07,232 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-19 14:12:07,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:12:07,282 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-19 14:12:07,283 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:12:07,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610042447] [2021-11-19 14:12:07,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610042447] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:12:07,283 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:12:07,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-19 14:12:07,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603241962] [2021-11-19 14:12:07,284 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:12:07,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 14:12:07,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:12:07,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 14:12:07,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 14:12:07,286 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-19 14:12:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:12:07,349 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-11-19 14:12:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 14:12:07,350 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-19 14:12:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:12:07,351 INFO L225 Difference]: With dead ends: 31 [2021-11-19 14:12:07,351 INFO L226 Difference]: Without dead ends: 17 [2021-11-19 14:12:07,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-19 14:12:07,354 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:12:07,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:12:07,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-19 14:12:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-19 14:12:07,359 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-19 14:12:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-11-19 14:12:07,360 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2021-11-19 14:12:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:12:07,360 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-19 14:12:07,361 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-19 14:12:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-11-19 14:12:07,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-19 14:12:07,362 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:12:07,362 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:12:07,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-19 14:12:07,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:12:07,568 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:12:07,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:12:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash 723862385, now seen corresponding path program 1 times [2021-11-19 14:12:07,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:12:07,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260984932] [2021-11-19 14:12:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:12:07,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:12:07,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:12:07,570 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:12:07,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51dac4f-65fe-46ac-bbc9-483f5ed7ea3a/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-19 14:12:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:12:08,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-19 14:12:08,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:12:12,933 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-11-19 14:12:12,934 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-19 14:13:10,785 WARN L227 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 14:13:49,767 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (and (= .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse2) (not (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0)) (= .cse3 .cse1) (let ((.cse4 (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse3) (fp.sub roundNearestTiesToEven .cse2 .cse3)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse4) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse4)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32)) .cse2)))) is different from true [2021-11-19 14:13:56,858 WARN L227 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 9 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-19 14:13:56,868 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-19 14:13:56,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:14:07,404 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from false [2021-11-19 14:14:24,097 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|))) is different from false [2021-11-19 14:14:26,162 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|))) is different from true [2021-11-19 14:14:39,545 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from false [2021-11-19 14:14:41,610 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from true [2021-11-19 14:14:53,925 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from false [2021-11-19 14:14:55,986 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from true [2021-11-19 14:15:14,860 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)))) is different from false [2021-11-19 14:15:16,921 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)))) is different from true [2021-11-19 14:15:33,634 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse2 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse5 (let ((.cse7 (select .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse3 (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse5 .cse4))))) (and (fp.geq .cse3 (_ +zero 8 24)) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))))) is different from false [2021-11-19 14:15:35,694 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse2 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse5 (let ((.cse7 (select .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (let ((.cse3 (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse5 .cse4))))) (and (fp.geq .cse3 (_ +zero 8 24)) (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5))))) is different from true [2021-11-19 14:15:55,781 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse6 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) is different from true